Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
The computational complexity of linear optics
- S. Aaronson, A. Arkhipov
- Computer Science, Physics
- STOC '11
- 14 November 2010
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In… Expand
Improved Simulation of Stabilizer Circuits
- S. Aaronson, D. Gottesman
- Physics, Computer Science
- ArXiv
- 25 June 2004
TLDR
Quantum computing, postselection, and probabilistic polynomial-time
- S. Aaronson
- Mathematics, Computer Science
- Proceedings of the Royal Society A: Mathematical…
- 23 December 2004
TLDR
Quantum lower bounds for the collision and the element distinctness problems
- S. Aaronson, Y. Shi
- Mathematics, Computer Science
- JACM
- 1 July 2004
TLDR
Algebrization: A New Barrier in Complexity Theory
- S. Aaronson, A. Wigderson
- Mathematics, Computer Science
- TOCT
- 1 February 2009
TLDR
Quantum search of spatial regions
- S. Aaronson, A. Ambainis
- Mathematics, Computer Science
- 44th Annual IEEE Symposium on Foundations of…
- 9 March 2003
TLDR
Lower bounds for local search by quantum arguments
- S. Aaronson
- Mathematics, Computer Science
- STOC '04
- 21 July 2003
TLDR
The learnability of quantum states
- S. Aaronson
- Computer Science, Physics
- Proceedings of the Royal Society A: Mathematical…
- 18 August 2006
TLDR
Quantum money from hidden subspaces
- S. Aaronson, Paul Christiano
- Mathematics, Computer Science
- STOC '12
- 21 March 2012
TLDR
NP-complete Problems and Physical Reality
- S. Aaronson
- Physics, Computer Science
- Electron. Colloquium Comput. Complex.
- 1 February 2005
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms,… Expand