- Home
- » Tags
- » Scott Aaronson
Top View
- Nai-Hui Chia University of Texas at Austin Monday, February 3, 2020 11:00 AM Luddy Hall, Rm
- “Quantum Computing Since Democritus” Avi Wigderson, IAS
- QMA-Complete Problems
- Constant-Round Blind Classical Verification of Quantum Sampling
- Why Philosophers Should Care About Computational Complexity
- Quantum Computing and Hidden Variables
- Understanding Quantum Algorithms Via Query Complexity
- Lecture Notes for the 28Th Mcgill Invitational Workshop on Computational Complexity
- Using Quantum Computers to Learn Physics
- Research Statement
- Limitations of Quantum Advice and One-Way Communication
- Adam Bouland University of California at Berkeley 617 Soda Hall, UC Berkeley, Berkeley, CA 94709 [email protected]
- Newsletter of the Topical Group on Quantum Information American Physical Society
- Quantum Supremacy and Its Applications
- Quantum Search of Spatial Regions
- A Full Characterization of Quantum Advice
- A Linear-Optical Proof That the Permanent Is #P-Hard
- Course Intro, Church-Turing Thesis
- Quantum Algorithms, Architecture, and Error Correction
- Barbados Lecture Notes on the Complexity of Quantum States And
- First Name Last Name Country Affiliation Scott Aaronson United
- PDQP/Qpoly = ALL, Where ALL Is the Set of All Languages L 0, 1 ∗ (Including the Halting Problem and Other Noncomputable Languages)
- The Limits of Quantum Computers
- Are Quantum States Exponentially Long Vectors?
- Multilinear Formulas and Skepticism of Quantum Computing
- 18.10.12 Scott Aaronson Seminar .Pdf
- CS395T Topics in Quantum and Classical Complexity Theory
- Paper Studies Whether Quantum Proofs Are More Powerful Than Classical Proofs, Or in Complexity Terms, Whether QMA = QCMA
- Is Quantum Mechanics an Island in Theoryspace? 1
- First Name Last Name Country Affiliation Scott Aaronson United
- Quics Workshop on Quantum Information and Computer Science
- Introduction to Quantum Information Science Lecture Notes
- On the Classical Hardness of Spoofing Linear Cross-Entropy
- The Computational Complexity of Linear Optics