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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Quantum advantage with shallow circuits
Bravyi, S., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406
Quantum Computing since Democritus
Aaronson, S. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9780511979309 · Cited by 352
Self-citationQuantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Shadow Tomography of Quantum States
Aaronson, S. (2020) · SIAM Journal on Computing · doi:10.1137/18m120275x · Cited by 315
Self-citationComputational complexity of projected entangled pair states
Schuch, N., Wolf, M. M., Verstraete, F., & Cirac, J. I. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140506 · Cited by 313
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308
Most Quantum States Are Too Entangled To Be Useful As Computational Resources
Gross, D., Flammia, S. T., & Eisert, J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.190501 · Cited by 284
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Quantum advantage with noisy shallow circuits
Bravyi, S., Gosset, D., König, R., & Tomamichel, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0948-z · Cited by 144
Temporally unstructured quantum computation
Shepherd, D., & Bremner, M. J. (2009) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2008.0443 · Cited by 135
Unitarity of black hole evaporation in final-state projection models
Lloyd, S., & Preskill, J. (2014) · Journal of High Energy Physics · doi:10.1007/jhep08(2014)126 · Cited by 100
Quantum Algorithms for Fixed Qubit Architectures
Farhi, E., Goldstone, J., Gutmann, S., & Neven, H. (2017) · arXiv · doi:10.48550/arxiv.1703.06199 · Cited by 93
How many qubits are needed for quantum computational supremacy?
Dalzell, A. M., Harrow, A. W., Koh, D. E., & La Placa, R. L. (2020) · Quantum · doi:10.22331/q-2020-05-11-264 · Cited by 88
Hardness of Classically Simulating the One-Clean-Qubit Model
Morimae, T., Fujii, K., & Fitzsimons, J. F. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.130502 · Cited by 70
Continuous-Variable Instantaneous Quantum Computing is Hard to Sample
Douce, T., Markham, D., Kashefi, E., Diamanti, E., Coudreau, T., Milman, P., van Loock, P., & Ferrini, G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.070503 · Cited by 64
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum · doi:10.22331/q-2018-05-22-65 · Cited by 58
Area laws and efficient descriptions of quantum many-body states
Ge, Y., & Eisert, J. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/8/083026 · Cited by 53
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
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
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.