Aaronson investigates the limits of quantum computation, connecting complexity theory with experiments designed to test when quantum devices can outperform classical simulation.
Scott Aaronson / UT AustinarXivarXivAaronson supplies a mathematical lens for deciding what a quantum experiment demonstrates. His work with Alex Arkhipov made sampling from linear-optical networks a central example of a restricted quantum task with potentially prohibitive classical cost. His postselection theorem links a modified quantum model to a classical complexity class, helping separate physical computation from stronger hypothetical resources. Together, these results give researchers precise questions to ask about advantage, assumptions and verification. His inclusion reflects these identifiable theoretical contributions rather than a claim that every proposed quantum speedup is established.
Scott Aaronson / UT AustinarXivarXivDefining contributions
Work, in context- 2004
Relating postselection to counting complexity
Aaronson proved that quantum computation with postselection characterizes the classical complexity class PP. The result concerns a mathematical computational model in which selected measurement outcomes can be conditioned on; it does not make postselection freely available in a laboratory.
Sole-author theoretical result by Scott Aaronson; the theorem concerns the postselection model.
Source-supported recordarXiv - 2010
The complexity case for boson sampling
With Alex Arkhipov, Aaronson analyzed sampling from linear-optical circuits and gave complexity-theoretic reasons that efficient classical simulation would have unlikely consequences. The paper helped define an experimental route to testing quantum computational advantage without requiring a universal programmable quantum computer.
Joint theoretical work by Scott Aaronson and Alex Arkhipov; the hardness conclusions depend on stated complexity assumptions.
Source-supported recordarXiv
Keep in perspective
Timeline dates identify first preprint publication. Complexity assumptions are not experimental proof of an unrestricted speedup.
Follow the evidence
3 sourcesPrimary papers, institutional records and attributed announcements. Each source supports the claims linked above.
- Scott Aaronson / UT AustinResearcher profile
Scott Aaronson — academic homepage
Current UT Austin professorship, Quantum Information Center directorship and research interests.
Checked 2026-09-19 - arXivResearch paper
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
Author identity and PostBQP = PP theorem; date is first preprint submission.
Published 2004-12-23 · Checked 2026-09-19 - arXivResearch paper
The Computational Complexity of Linear Optics
Aaronson–Arkhipov authorship, linear-optical sampling model and conditional classical hardness.
Published 2010-11-14 · Checked 2026-09-19