The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Quantum computing, postselection, and probabilistic polynomial-time
Abstract
I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic polynomial-time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and Reingold. This illustrates that quantum computing can yield new and simpler proofs of major results about classical computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Measures on the Closed Subspaces of a Hilbert Space
Gleason, A. M. (1975) · The Logico-Algebraic Approach to Quantum Mechanics · doi:10.1007/978-94-010-1795-4_7 · Cited by 990
Agrawal, M., Kayal, N., & Saxena, N. (2004) · Annals of Mathematics · doi:10.4007/annals.2004.160.781 · Cited by 931
Computational Complexity of Probabilistic Turing Machines
Gill, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206049 · Cited by 689
Measures on the Closed Subspaces of a Hilbert Space
Gleason, A. (1957) · Indiana University Mathematics Journal · doi:10.1512/iumj.1957.6.56050 · Cited by 650
Quantum theory of probability and decisions
Deutsch, D. (1999) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1999.0443 · Cited by 566
Before a Theory of Everything: What Fundamental Reconstructions Are Not Allowed to Assume
Hardy, L. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0101012 · Cited by 453
Cited by
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Self-citationInformation processing in generalized probabilistic theories
Barrett, J. (2007) · Physical Review A · doi:10.1103/physreva.75.032304 · Cited by 768
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
Quantum computations without definite causal structure
Chiribella, G., D’Ariano, G. M., Perinotti, P., & Valiron, B. (2013) · Physical Review A · doi:10.1103/physreva.88.022318 · Cited by 521
Metadata
- Authors
- Aaronson, S.
- Venue
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2005-09-05
- Volume
- 461
- Issue
- 2063
- Pages
- 3473-3482
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W2158764863
- Cited by
- 311
- References
- 34
- FWCI
- 10.99
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum computing, postselection, and probabilistic polynomial-time. https://app.cochat.ai/papers/10.1098/rspa.2005.1546
- The paper
- Aaronson, S. (2005). Quantum computing, postselection, and probabilistic polynomial-time. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. https://doi.org/10.1098/rspa.2005.1546
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.