Closed timelike curves make quantum and classical computing equivalent

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

Volumn 465, Issue 2102, 2009, Pages 631-647

  Aaronson, Scott ^a   Watrous, John ^b  

^a Department of Electrical Engineering and Computer Science   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Closed timelike curves; Computational complexity; Quantum computing

Indexed keywords

POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY;

CLASSICAL COMPUTERS; CLOSED TIMELIKE CURVES; COMPLEXITY CLASSES; CONVENTIONAL COMPUTERS; EVOLUTION OPERATORS; FIXED POINTS; GENERAL RELATIVITIES; OPEN PROBLEMS; POLYNOMIAL SPACES; QUANTUM CIRCUITS; QUANTUM COMPUTING; QUANTUM INFORMATIONS;

COMPUTATIONAL COMPLEXITY;

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

References (18)

1. Aaronson, S. 2005 NP-complete problems and physical reality. SIGACT News. March 2005. (quant-ph/0502072).
2. Aaronson, S. 2006 QMA/qpoly is contained in PSPACE/poly: de-Merlinizing quantum protocols. In Proc. IEEE Conference on Computational Complexity, pp. 261-273. (quant-ph/0510230).
3. Aharonov, D. & Ben-Or, M. 1997 Fault-tolerant quantum computation with constant error. In Proc. ACM STOC, pp. 176-188. (doi:10.1145/258533. 258579)
4. Arora, S. & Barak, B. In press. Complexity theory: a modern approach. Cambridge, UK: Cambridge University Press.
5. Bacon, D. 2004 Quantum computational complexity in the presence of closed timelike curves. Phys. Rev. A 70, 032 309. (doi:10.1103/PhysRcvA. 70.032309)
6. Borodin, A. 1977 On relating time and space to size and depth. SLAM J. Cornput. 6, 733-744. (doi:10.1137/0206054)
7. Borodin, A., Cook, S. & Pippenger. N. 1983 Parallel computation for well-endowed rings and spacebounded probabilistic machines. Inf. Control 58, 113-136. (doi:10.1016/S0019-9958(83)80060-6)
8. Brun, T. 2003 Computers with closed timelike curves can solve hard problems. Found. Phys. Lett. 16, 245-253. (doi: 10.1023/A: 1025967225931)
9. Deutsch, D. 1991 Quantum mechanics near closed timelike lines. Phys. Rev. D 44, 3197-3217. (doi:10.1103/PhysRevD.44.3197)
10. Godel, K. 1949 An example of a new type of cosmological solution of Einstein's field equations of gravitation. Rev. Mod. Phys. 21, 447. (doi:10.1103/RevModPhys.21.447)
11. Horn, R. A. & Johnson, C. R. 1990 Matrix analysis. Cambridge, UK: Cambridge University Press.
12. Morris, M. S., Thorne, K. S. & Yurtsever, U. 1988 Wormholes, time machines, and the weak energy condition. Phys. Rev. Lett. 61, 1446-1449. (doi:10.1103/PhysRevLett.61.1446)
13. Raz, R. 2005 Quantum information and the PCP theorem. In Proc. IEEE FOCS. (quant-ph/0504075).
14. Terhal, B. & DiVincenzo, D. 2000 On the problem of equilibration and the computation of correlation functions on a quantum computer. Phys. Rev. A 61, 022 301. (doi:10.1103/PhysRevA. 61.022301)
15. van Stockum, W. J. 1937 The gravitational field of a distribution of particles rotating around an axis of symmetry. Proc. R. Soc. Edinb. A 57, 135.
16. von zur Gathen, J. 1993 Parallel linear algebra. In Synthesis of parallel algorithms (ed. J. Reif), ch. 13, pp. 574-617. San Francisco, CA: Morgan Kaufmann Publishers.
17. Watrous, J. 1999 Space-bounded quantum complexity. J. Comput, Syst. Sci. 59, 281-326. (doi:10. 1006/jcss.1999.1655)
18. Watrous, J. 2008 Quantum computational complexity. In Encyclopedia of complexity and systems science. Berlin. Germany: Springer. (http://arxiv.org/abs/0804.3401)