Exponential improvements to the average-case hardness of random circuits

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
69,400
Published on ● Video Link: https://www.youtube.com/watch?v=NiUFf7p_XLY


Duration: 0:00
254 views
0

Shaun Datta (Stanford University)
https://simons.berkeley.edu/talks/shaun-datta-stanford-university-2025-07-08
Summer Cluster on Quantum Computing



Other Videos By Simons Institute for the Theory of Computing


2025-07-09Computational quantum chemistry: Classical gaps, quantum opportunities, open questions Part 2
2025-07-09Computational quantum chemistry: Classical gaps, quantum opportunities, open questions
2025-07-09Panel Discussion
2025-07-09How Hamiltonian complexity differs from quantum chemistry
2025-07-09Sum of squares spectral amplification (SOSSA)
2025-07-08When do you need an inverse or controlled unitary oracle?
2025-07-08How to model unitary oracles
2025-07-08Informational and computational aspects of holography
2025-07-08Quantum cryptography and quantum complexity
2025-07-08Quantum LDPC Codes with Transversal CCZ Gates
2025-07-07Exponential improvements to the average-case hardness of random circuits
2025-07-06An Overview of QEC at Google
2025-07-06Architectural mechanisms of a universal fault-tolerant quantum computer
2025-07-06Panel Discussion
2025-07-06Tour de gross: A modular quantum computer based on bivariate bicycle codes
2025-06-26Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from...
2025-06-26Expedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New...
2025-06-25To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic
2025-06-18Succinct arguments for QMA from standard assumptions, without quantum PCPs
2025-05-30Crypto + Meta-complexity 2
2025-05-30Crypto + Meta-complexity 1