2026 Scott Aaronson: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	50	5510	5356	2515	2430	174	13782

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

5510

5356

2515

2430

174

13782

Research.com Recognitions

2019 - ACM Fellow For contributions to quantum computing and computational complexity
2012 - National Science Foundation Alan T. Waterman Award Computer Science
2009 - Fellow of Alfred P. Sloan Foundation

Overview

Scott Aaronson is affiliated with The University of Texas at Austin in the United States. Their research primarily focuses on computer science, with a significant emphasis on artificial intelligence, computational theory and mathematics, and neurology. Other subfields of study include atomic and molecular physics, optics, as well as anesthesiology and pain medicine.

Their main topics of work cover a range of areas within quantum computing and theoretical computer science. These include:

Quantum Computing Algorithms and Architecture
Computability, Logic, AI Algorithms
Quantum Information and Cryptography
Quantum Mechanics and Applications
Transcranial Magnetic Stimulation Studies
Pain Management and Treatment
Complexity and Algorithms in Graphs

They have contributed to several papers, notable among them:

Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries, 2025, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Certified randomness using a trapped-ion quantum processor, 2025, Nature
On the Quantum Complexity of Closest Pair and Related Problems, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
(Untitled), 2020, Theory of Computing
A very preliminary analysis of DALL-E 2, 2022, arXiv (Cornell University)

Scott Aaronson frequently publishes in venues such as:

arXiv (Cornell University)
Brain Stimulation
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Biological Psychiatry
Nature

Their frequent collaborators include Linda L. Carpenter, Harold A. Sackeïm, Todd M. Hutton, Kenneth Pages, and Emre Yolcu.

Among the distinctions received, Scott Aaronson was named an ACM Fellow in 2019 for contributions related to quantum computing and computational complexity. They also received the National Science Foundation Alan T. Waterman Award in 2012 for work in computer science, in addition to being recognized as a Fellow of the Alfred P. Sloan Foundation in 2009.

Best Publications

Improved simulation of stabilizer circuits

Scott Aaronson;Daniel Gottesman

1658
Citations
The Computational Complexity of Linear Optics

Scott Aaronson;Alex Arkhipov

1471
Citations
Photonic Boson Sampling in a Tunable Circuit

Matthew A. Broome;Alessandro Fedrizzi;Saleh Rahimi-Keshari;Justin Dove

798
Citations
Read the fine print

Scott Aaronson

569
Citations
Quantum Search of Spatial Regions

Scott Aaronson;Andris Ambainis

541
Citations
Quantum Computing Since Democritus

Scott Aaronson

431
Citations
Guest Column: NP-complete problems and physical reality

Scott Aaronson

405
Citations
Quantum Computing, Postselection, and Probabilistic Polynomial-Time

Scott Aaronson

383
Citations
Quantum lower bounds for the collision and the element distinctness problems

Scott Aaronson;Yaoyun Shi

345
Citations
Shadow Tomography of Quantum States

Scott Aaronson

309
Citations
Algebrization: A New Barrier in Complexity Theory

Scott Aaronson;Avi Wigderson

291
Citations
Synthetic recombinase-based state machines in living cells

Nathaniel Roquet;Ava P. Soleimany;Alyssa C. Ferris;Scott Aaronson

280
Citations
BQP and the polynomial hierarchy

Scott Aaronson

255
Citations
Complexity-theoretic foundations of quantum supremacy experiments

Scott Aaronson;Lijie Chen

253
Citations
Quantum Copy-Protection and Quantum Money

Scott Aaronson

247
Citations
NP-complete Problems and Physical Reality

Scott Aaronson

224
Citations
The limits of quantum computers.

Scott Aaronson

216
Citations
Limitations of Quantum Advice and One-Way Communication

Scott Aaronson

203
Citations
Why Philosophers Should Care About Computational Complexity.

Scott Aaronson

193
Citations
The learnability of quantum states

Scott Aaronson

182
Citations

Frequent Co-Authors

Andris Ambainis University of Latvia

Sarah H. Lisanby Arizona State University

Mark S. George Medical University of South Carolina

Noah S. Philip Brown University

Donel Martin University of New South Wales

Shawn M. McClintock The University of Texas Southwestern Medical Center

Timothy C. Ralph University of Queensland

Peter W. Shor MIT

Ian A. Cook University of California, Los Angeles

Michael E. Thase University of Pennsylvania

External Links

Wikipedia of Scott Aaronson Personal website of Scott Aaronson Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Interested in broadening your skill set beyond computer science? Many related STEM fields now offer flexible learning options through online degree programs. One popular choice is an online mechanical engineering degree, which prepares graduates for careers in industries ranging from automotive to aerospace.

If you’re passionate about theory and experimentation, you might wonder, can you get a physics degree online? Yes! Several affordable online programs provide the flexibility you need to study core physics topics while balancing other commitments.

Data science is also a hot field with tremendous growth. If you’re aiming for a career working with big data, consider pursuing an affordable data science degree and explore a wide range of employment opportunities.

For those interested in electronics and power systems, there are excellent options for studying electrical engineering online. Electrical engineering online tuition costs can vary, so be sure to review program options that fit your budget.