Quick Navigation

Topics

Open Quantum Systems Decoherence

Computability Theory of Closed Timelike Curves

arXiv
Authors: Scott Aaronson, Mohammad Bavarian, Toby Cubitt, Sabee Grewal, Giulio Gueltrini, Ryan O'Donnell, Marien Raat

Year

2016

Paper ID

43512

Status

Preprint

Abstract Read

~2 min

Abstract Words

100

Citations

N/A

Abstract

We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study the complexity of finding approximate fixed points of computable Markov chains and quantum channels of countably infinite dimension. Our main result is that the complexity of these problems is precisely Δ2, the class of languages Turing-reducible to the Halting problem. Establishing this as an upper bound for qubit-carrying CTCs requires recently developed results in the theory of quantum Markov maps.

Why This Paper Matters

  • This paper contributes to the Open Quantum Systems & Decoherence research area in the Quantum Articles archive.
  • It adds a 2016 reference point for readers tracking recent quantum research.
  • We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #43512 #68456 Analytic Properties of the Jost... #68455 Mediative Fuzzy Logic: From Typ... #68453 Weak wave turbulence as a precu... #68449 Scale-Invariant Open Quantum Sy...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.