Articles by Scott Aaronson
|
Vol 16, Article 11 (pp 1-8)
[NOTE]
On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking by Scott Aaronson and Sam Gunn |
|
Vol 10, Article 6 (pp 133-166)
The Need for Structure in Quantum Speedups by Scott Aaronson and Andris Ambainis |
|
Vol 9, Article 9 (pp 349-401)
Quantum Money from Hidden Subspaces by Scott Aaronson and Paul Christiano |
|
Vol 9, Article 4 (pp 143-252)
The Computational Complexity of Linear Optics by Scott Aaronson and Alex Arkhipov |
|
Vol 7, Article 12 (pp 177-184)
[NOTE]
On Circuit Lower Bounds from Derandomization by Scott Aaronson and Dieter van Melkebeek |
|
Vol 5, Article 1 (pp 1-42)
The Power of Unentanglement by Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, and Peter Shor |
|
Vol 3, Article 7 (pp 129-157)
Quantum Versus Classical Proofs and Advice by Scott Aaronson and Greg Kuperberg |
|
Vol 1, Article 4 (pp 47-79)
Quantum Search of Spatial Regions by Scott Aaronson and Andris Ambainis |
|
Vol 1, Article 1 (pp 1-28)
Limitations of Quantum Advice and One-Way Communication by Scott Aaronson |