Quantum computing, postselection, and probabilistic polynomial-time

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 461, Issue 2063, 2005, Pages 3473-3482

  Aaronson, Scott ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Born's rule; Computational complexity; Quantum computers

Indexed keywords

COMPUTATIONAL COMPLEXITY; INDIUM COMPOUNDS; PUMPING PLANTS; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY;

BORN'S RULE; COMPLETE PROBLEMS; COMPLEXITY CLASS; POLYNOMIAL-TIME; QUANTUM COMPUTING; QUANTUM MECHANICS;

QUANTUM EFFICIENCY;

EID: 34247511667     PISSN: 13645021     EISSN: 14712946     Source Type: Journal    
DOI: 10.1098/rspa.2005.1546     Document Type: Article

References (34)

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. Aaronson, S. 2005 Limitations of quantum advice and one-way communication. Theory of Computing 1, 1-28. (www.arxiv.org/abs/ quant-ph/0402095.)
5. Abrams, D. S. and Lloyd, S. 1998 Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems. Phys. Rev. Lett. 81, 3992-3995. (www.arxiv.org/abs/quantph/9801041.) (doi:10.1103/PhysRevLett.81.3992.)
6. Adleman, L., DeMarrais, J. and Huang, M. D. 1997 Quantum computability. SIAM J. Comput. 26, 1524-1540. (doi:10.1137/S0097539795293639.)
7. Agrawal, M., Kayal, N. and Saxena, N. 2004 PRIMES is in P. Annals of Math. 160, 781-793.
8. Aharonov, D. and Naveh, T. 2002 Quantum NP-a survey. (www.arxiv.org/abs/ quant-ph/0210077.)
9. Aharonov, D. and Regev, O. 2004 Lattice problems in NP intersect coNP. In Proc. IEEE FOCS, 362-371.
10. Beigel, R. 1994 Perceptrons, PP, and the polynomial hierarchy. Computational Complexity 4, 339-349. (doi:10.1007/BF01263422.)
11. Beigel, R., Reingold, N. and Spielman, D. 1995 PP is closed under intersection. J. Comput. Sys. Sci. 50, 191-202. (doi:10.1006/jcss.1995.1017.)
12. Bernstein, E. and Vazirani, U. 1997 Quantum complexity theory. SIAM J. Comput. 26, 1411-1473. (doi:10.1137/S0097539796300921.)
13. Caves, C. M., Fuchs, C. A. and Schack, R. 2002 Unknown quantum states: the quantum de Finetti representation. J. Math. Phys. 45, 4537-4559. (doi:10.1063/1.1494475.)
14. Deutsch, D. 1999 Quantum theory of probability and decisions. Proc. R. Soc. A 455, 3129-3137. (doi:10.1098/rspa.1999.0443.)
15. Fenner, S., Green, F., Homer, S. and Pruim, R. 1999 Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy. Proc. R. Soc. A 455, 3953-3966. (doi:10.1098/rspa.1999. 0485.)
16. Fortnow, L. 2002 My computational complexity web log. Wednesday, October 30, 2002. Available at http://weblog.fortnow.com.
17. Fortnow, L. and Reingold, N. 1996 PP is closed under truth-table reductions. Information and Computation 124, 1-6. (doi:10.1006/inco.1996.0001.)
18. Fortnow, L. and Rogers, J. 1999 Complexity limitations on quantum computation. J. Comput. Sys. Sci. 59, 240-252. (www.arxiv.org/abs/cs. CC/9811023.) (doi:10.1006/jcss.1999.1651.)
19. Gill, J. 1972 Probabilistic Turing machines and complexity of computation. PhD thesis, University of California, Berkeley.
20. Gill, J. 1977 Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6, 675-695. (doi:10.1137/0206049.)
21. Gisin, N. 1990 Weinberg's non-linear quantum mechanics and superluminal communications. Phys. Lett. A 143, 1-2. (doi:10.1016/0375-9601 (90) 90786-N.)
22. Gleason, A. M. 1957 Measures on the closed subspaces of a Hilbert space. J. Math. Mech. 6, 885-893.
23. Han, Y., Hemaspaandra, L. and Thierauf, T. 1997 Threshold computation and cryptographic security. SIAM J. Comput. 26, 59-78. (doi:10.1137/S0097539792240467.)
24. Hardy, L. 2003 Quantum theory from five reasonable axioms. (www.arxiv.org/abs/quant-ph /0101012.)
25. Håstad, J. 2001 Some optimal inapproximability results. J. ACM 48, 798-859. (doi:10.1145 /502090.502098.)
26. Kerenidis, I. and de Wolf, R. 2003 Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proc. ACM STOC, pp. 106-115. (www.arxiv.org/abs/quant-ph /0208062.)
27. Kitaev, A. 1997 Quantum computation: algorithms and error correction. Russian Math. Surveys 52, 1191-1249.
28. Li, L. 1993 On the counting functions. Ph. D. thesis, University of Chicago.
29. Polchinski, J. 1991 Weinberg's nonlinear quantum mechanics and the Einstein-Podolsky-Rosen paradox. Phys. Rev. Lett. 66, 397-400. (doi:10.1103/PhysRevLett.66.397.)
30. Reingold, O. 2005 Undirected ST-connectivity in log-space. In Proc. ACM STOC, pp. 376-385.
31. Shi, Y. 2002 Both Toffoli and controlled-NOT need little help to do universal quantum computation. Quantum Information and Computation 3, 84-92. (www.arxiv.org/abs/quant-ph /0205115.)
32. Terhal, B. M. and DiVincenzo, D. P. 2004 Adaptive quantum computation, constant-depth circuits and Arthur-Merlin games. Quantum Information and Computation 4, 134-145. (www.arxiv.org /abs/quant-ph/0205133.)
33. Watrous, J. 2000 Succinct quantum proofs for properties of finite groups. In Proc. IEEE FOCS, pp. 537-546. (www.arxiv.org/abs/cs. CC/0009002.)
34. Zurek, W. H. 2003 Environment-assisted invariance, causality, and probabilities in quantum physics. Phys. Rev. Lett. 90. (www.arxiv.org/abs/quant-ph/0211037.) (doi:10.1103/PhysRev-Lett.90.120404.)