Scott Aaronson

Cited by

	All	Since 2019
Citations	18154	12020
h-index	62	52
i10-index	148	134

3200

1600

800

2400

20042005200620072008200920102011201220132014201520162017201820192020202120222023202484 115 135 166 180 216 208 239 242 393 531 569 767 935 1094 1242 1341 1733 1965 2581 3109

Public access

View all

41 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Saleh Rahimi-KeshariInstitute for Research in Fundamental Sciences (IPM)Verified email at ipm.ir
Alessandro FedrizziProfessor, Heriot-Watt UniversityVerified email at hw.ac.uk
Matthew BroomePrinciple Research Scientist, CSIROVerified email at csiro.au
Andris AmbainisProfessor, University of LatviaVerified email at lu.lv
Adam BoulandStanford UniversityVerified email at stanford.edu
Greg KuperbergProfessor of Mathematics and Computer Science, University of California, DavisVerified email at math.ucdavis.edu
Robin KothariStaff Research Scientist, Google Quantum AIVerified email at robinkothari.com
Andrew WhiteProfessor of Physics, University of QueenslandVerified email at uq.edu.au
Lijie ChenUC BerkeleyVerified email at berkeley.edu
avinatan hassidimVerified email at biu.ac.il
Paul ChristianoNational Institute of Standards and TechnologyVerified email at nist.gov
David GossetUniversity of Waterloo and Perimeter Institute for Theoretical PhysicsVerified email at uwaterloo.ca
John WatrousIBM QuantumVerified email at ibm.com
Daniel BrodAssistant Professor at the Universidade Federal FluminenseVerified email at id.uff.br
Salman BeigiSchool of Mathematics, Institute for Research in Fundamental Sciences (IPM)Verified email at alum.mit.edu
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Dana MoshkovitzUT AustinVerified email at cs.utexas.edu

Scott Aaronson

David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin

No verified email - Homepage

Quantum computing computational complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Improved simulation of stabilizer circuits S Aaronson, D Gottesman Physical Review A—Atomic, Molecular, and Optical Physics 70 (5), 052328, 2004	1638	2004
The computational complexity of linear optics S Aaronson, A Arkhipov Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	1604	2011
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	811	2013
Read the fine print S Aaronson Nature Physics 11 (4), 291-293, 2015	626	2015
Single-dose psilocybin for a treatment-resistant episode of major depression GM Goodwin, ST Aaronson, O Alvarez, PC Arden, A Baker, JC Bennett, ... New England Journal of Medicine 387 (18), 1637-1648, 2022	609	2022
Quantum computing since Democritus S Aaronson Cambridge University Press, 2013	509	2013
Shadow tomography of quantum states S Aaronson Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018	454	2018
Guest column: NP-complete problems and physical reality S Aaronson ACM Sigact News 36 (1), 30-52, 2005	432	2005
Quantum computing, postselection, and probabilistic polynomial-time S Aaronson Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2005	428	2005
Complexity-theoretic foundations of quantum supremacy experiments S Aaronson, L Chen arXiv preprint arXiv:1612.05903, 2016	423	2016
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	368	2004
Quantum search of spatial regions S Aaronson, A Ambainis 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	333	2003
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	326	2017
Algebrization: A new barrier in complexity theory S Aaronson, A Wigderson ACM Transactions on Computation Theory (TOCT) 1 (1), 1-54, 2009	316	2009
The learnability of quantum states S Aaronson Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2007	275	2007
Synthetic recombinase-based state machines in living cells N Roquet, AP Soleimany, AC Ferris, S Aaronson, TK Lu Science 353 (6297), aad8559, 2016	272	2016
inProceedings of the 43rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2011) S Aaronson, A Arkhipov Theory Comput 9, 143, 2013	269	2013
Proceedings of the forty-third annual ACM symposium on Theory of computing S Aaronson, A Arkhipov ACM, 2011	252	2011
BQP and the polynomial hierarchy S Aaronson Proceedings of the forty-second ACM symposium on Theory of computing, 141-150, 2010	250	2010
Quantum copy-protection and quantum money S Aaronson 2009 24th Annual IEEE Conference on Computational Complexity, 229-242, 2009	250	2009

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors