Scott Aaronson

Cited by

	All	Since 2018
Citations	13362	8418
h-index	57	44
i10-index	128	110

2100

1050

525

1575

2004200520062007200820092010201120122013201420152016201720182019202020212022202382 114 133 164 185 214 210 228 238 395 544 555 744 914 1068 1225 1334 1686 2072 1011

Public access

View all

34 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Andris AmbainisProfessor, University of LatviaVerified email at lu.lv
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 BroomeManager, Quantum Engineering, Archer Materials LtdVerified email at archerx.com.au
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
David GossetUniversity of Waterloo and Perimeter Institute for Theoretical PhysicsVerified email at uwaterloo.ca
Paul ChristianoAlignment Research CenterVerified email at alignment.org
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
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.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
The computational complexity of linear optics S Aaronson, A Arkhipov Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	1397	2011
Improved simulation of stabilizer circuits S Aaronson, D Gottesman Physical Review A 70 (5), 052328, 2004	1119	2004
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	742	2013
Read the fine print S Aaronson Nature Physics 11 (4), 291-293, 2015	451	2015
Quantum computing since Democritus S Aaronson Cambridge University Press, 2013	401	2013
Guest column: NP-complete problems and physical reality S Aaronson ACM Sigact News 36 (1), 30-52, 2005	385	2005
Quantum computing, postselection, and probabilistic polynomial-time S Aaronson Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2005	369	2005
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	328	2004
Quantum search of spatial regions S Aaronson, A Ambainis 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	306	2003
Complexity-theoretic foundations of quantum supremacy experiments S Aaronson, L Chen arXiv preprint arXiv:1612.05903, 2016	305	2016
Algebrization: A new barrier in complexity theory S Aaronson, A Wigderson ACM Transactions on Computation Theory (TOCT) 1 (1), 1-54, 2009	292	2009
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	260	2017
Shadow tomography of quantum states S Aaronson Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018	234	2018
Synthetic recombinase-based state machines in living cells N Roquet, AP Soleimany, AC Ferris, S Aaronson, TK Lu Science 353 (6297), aad8559, 2016	229	2016
Proceedings of the forty-third annual ACM symposium on Theory of computing S Aaronson, A Arkhipov ACM, 2011	219	2011
The learnability of quantum states S Aaronson Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2007	219	2007
BQP and the polynomial hierarchy S Aaronson Proceedings of the forty-second ACM symposium on Theory of computing, 141-150, 2010	207	2010
Why philosophers should care about computational complexity S Aaronson Computability: Turing, Gödel, Church, and Beyond 261, 327, 2013	191	2013
Quantum copy-protection and quantum money S Aaronson 2009 24th Annual IEEE Conference on Computational Complexity, 229-242, 2009	181	2009
The limits of quantum S Aaronson Scientific American 298 (3), 62-69, 2008	181	2008

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