DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Scott Aaronson
Scott Aaronson
Limits on Efficient Computation in the Physical World
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the Ads/CFT Duality
NP-Complete Problems and Physical Reality
Quantum Lower Bound for Recursive Fourier Sampling
The Power of Unentanglement
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Jim Ormond 212-626-0505
[email protected]
QMA/Qpoly ⊆ PSPACE/Poly : De-Merlinizing Quantum Protocols
Impossibility of Succinct Quantum Proofs for Collision-Freeness
Adam Bouland
The Limits of Quantum Computers (DRAFT) Scott Aaronson
Arxiv:1910.12085V5 [Quant-Ph] 6 Feb 2020 N Ntr Rnfrain Civmn Fqatmsupremacy Quantum a of Achievement Wherein Theoretic Demonstration One ( Transformation
On Perfect Completeness for QMA
Arxiv:2006.00987V1 [Quant-Ph] 1 Jun 2020 Complexity Estimation Techniques
Secure Software Leasing
Scott Aaronson
Teaching Statement
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