Quantum computational complexity in the presence of closed timelike curves

Dave Bacon
Phys. Rev. A 70, 032309 – Published 13 September 2004

Abstract

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which represents a valid quantification of resources given the ability to construct compact regions of closed timelike curves. The notion of self-consistent evolution for quantum computers whose components follow closed timelike curves, as pointed out by Deutsch [Phys. Rev. D 44, 3197 (1991)], implies that the evolution of the chronology respecting components which interact with the closed timelike curve components is nonlinear. We demonstrate that this nonlinearity can be used to efficiently solve computational problems which are generally thought to be intractable. In particular we demonstrate that a quantum computer which has access to closed timelike curve qubits can solve NP-complete problems with only a polynomial number of quantum gates.

  • Figure
  • Figure
  • Received 28 October 2003

DOI:https://doi.org/10.1103/PhysRevA.70.032309

©2004 American Physical Society

Authors & Affiliations

Dave Bacon*

  • Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125, USA and Department of Physics, California Institute of Technology, Pasadena, California 91125, USA

  • *Electronic address: dabacon@cs.caltech.edu

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 70, Iss. 3 — September 2004

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×