Affiliation:
1. Department of Combinatorics and Optimization, University of WaterlooOntario N2L 3G1, Canada
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.
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Reference34 articles.
1. Aaronson S. 2004 Is quantum mechanics an island in theoryspace? In Proc. of the Växjö Conference ‘Quantum Theory: Reconsideration of Foundations’ . Sweden: Växjö. (www.arxiv.org/abs/quant-ph/0307149).
2. Aaronson S. 2004 Lower bounds for local search by quantum arguments. In Proc. ACM STOC pp. 465–474. (www.arxiv.org/abs/quant-ph/0307149).
3. Aaronson S. 2005 Limits on efficient computation in the physical world. PhD thesis University of California Berkeley. (www.arxiv.org/abs/quant-ph/0412143).
4. Nonlinear Quantum Mechanics Implies Polynomial-Time Solution forNP-Complete and #PProblems
Cited by
125 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Symbolic Synthesis of Clifford Circuits and Beyond;Electronic Proceedings in Theoretical Computer Science;2023-11-16
2. Extracting Randomness from Samplable Distributions, Revisited;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Non-isometric codes for the black hole interior from fundamental and effective dynamics;Journal of High Energy Physics;2023-09-12
4. Picturing Counting Reductions with the ZH-Calculus;Electronic Proceedings in Theoretical Computer Science;2023-08-30
5. Computational advantage of quantum random sampling;Reviews of Modern Physics;2023-07-20