Follow
Scott Aaronson
Scott Aaronson
David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin
No verified email - Homepage
Title
Cited by
Cited by
Year
The computational complexity of linear optics
S Aaronson, A Arkhipov
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
11952011
Improved simulation of stabilizer circuits
S Aaronson, D Gottesman
Physical Review A 70 (5), 052328, 2004
8732004
Photonic boson sampling in a tunable circuit
MA Broome, A Fedrizzi, S Rahimi-Keshari, J Dove, S Aaronson, TC Ralph, ...
Science 339 (6121), 794-798, 2013
6942013
Guest column: NP-complete problems and physical reality
S Aaronson
ACM Sigact News 36 (1), 30-52, 2005
3592005
Quantum computing since Democritus
S Aaronson
Cambridge University Press, 2013
3512013
Quantum computing, postselection, and probabilistic polynomial-time
S Aaronson
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2005
3352005
Read the fine print
S Aaronson
Nature Physics 11 (4), 291-293, 2015
3302015
Quantum lower bounds for the collision and the element distinctness problems
S Aaronson, Y Shi
Journal of the ACM (JACM) 51 (4), 595-605, 2004
2892004
Quantum search of spatial regions
S Aaronson, A Ambainis
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
2872003
Algebrization: A new barrier in complexity theory
S Aaronson, A Wigderson
ACM Transactions on Computation Theory (TOCT) 1 (1), 1-54, 2009
2622009
Complexity-theoretic foundations of quantum supremacy experiments
S Aaronson, L Chen
arXiv preprint arXiv:1612.05903, 2016
2402016
A 5-year observational study of patients with treatment-resistant depression treated with vagus nerve stimulation or treatment as usual: comparison of response, remission, and …
ST Aaronson, P Sears, F Ruvuna, M Bunker, CR Conway, DD Dougherty, ...
American Journal of Psychiatry 174 (7), 640-648, 2017
2102017
Synthetic recombinase-based state machines in living cells
N Roquet, AP Soleimany, AC Ferris, S Aaronson, TK Lu
Science 353 (6297), aad8559, 2016
1902016
The learnability of quantum states
S Aaronson
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2007
1852007
Proceedings of the forty-third annual ACM symposium on Theory of computing
S Aaronson, A Arkhipov
ACM, 2011
1842011
BQP and the polynomial hierarchy
S Aaronson
Proceedings of the forty-second ACM symposium on Theory of computing, 141-150, 2010
1772010
Why philosophers should care about computational complexity
S Aaronson
Computability: Turing, Gödel, Church, and Beyond 261, 327, 2013
1742013
Bosonsampling is far from uniform
S Aaronson, A Arkhipov
arXiv preprint arXiv:1309.7460, 2013
1552013
The limits of quantum
S Aaronson
Scientific American 298 (3), 62-69, 2008
1532008
The complexity zoo
S Aaronson, G Kuperberg, C Granade
1462005
The system can't perform the operation now. Try again later.
Articles 1–20