Aaronson studies the capabilities and limits of quantum computers, helping readers ask exactly what a comparison proves before calling it an advantage.
Scott Aaronson / UT AustinarXivarXivAaronson supplies a mathematical lens for deciding what a quantum result 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 under stated complexity assumptions. His postselection theorem links a modified quantum model to a classical complexity class, separating physically available computation from stronger hypothetical resources. These contributions make the problem definition, computational model and assumptions part of the result itself. His current academic homepage identifies his UT Austin affiliation and Quantum Information Center directorship. Use his bibliography to explore original research, while keeping a theoretical result, an implemented experiment and an end-to-end application as distinct claims.
Scott Aaronson / UT AustinarXivarXivScott AaronsonA useful reading question: what does the comparison actually prove? Write down the task, the best relevant classical comparison and the resources counted on both sides. A significant result need not show that a practical application is faster on today’s hardware.
The work behind the recognition
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.
The evidence map
Both views link each contribution to its sources. Choose a contribution on the map or read them all in the list.
Relating postselection to counting complexity
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
Supports: Author identity and PostBQP = PP theorem; date is first preprint submission.
Published 23 Dec 2004 · Checked 19 Sept 2026Credit & limits: Sole-author theoretical result by Scott Aaronson; the theorem concerns the postselection model.
Read the full contribution| Contribution | Evidence & what it supports | Credit & limits |
|---|---|---|
| Relating postselection to counting complexity2004 | Primary paperQuantum Computing, Postselection, and Probabilistic Polynomial-Time Author identity and PostBQP = PP theorem; date is first preprint submission. Published 23 Dec 2004 · Checked 19 Sept 2026 | Sole-author theoretical result by Scott Aaronson; the theorem concerns the postselection model. |
| The complexity case for boson sampling2010 | Primary paperThe Computational Complexity of Linear Optics Aaronson–Arkhipov authorship, linear-optical sampling model and conditional classical hardness. Published 14 Nov 2010 · Checked 19 Sept 2026 | Joint theoretical work by Scott Aaronson and Alex Arkhipov; the hardness conclusions depend on stated complexity assumptions. |
Follow the evidence
4 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.
Checks: 19 Sept 2026 · 8 Oct 2026 - arXivPrimary paper
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
Author identity and PostBQP = PP theorem; date is first preprint submission.
Published 23 Dec 2004 · Checked 19 Sept 2026 - arXivPrimary paper
The Computational Complexity of Linear Optics
Aaronson–Arkhipov authorship, linear-optical sampling model and conditional classical hardness.
Published 14 Nov 2010 · Checked 19 Sept 2026 - Scott AaronsonResearcher bibliography
Scott Aaronson — Research Papers and Surveys
Primary discovery route to original papers and surveys; individual newly listed results were not evaluated for this profile enrichment.
Checked 8 Oct 2026