Many results have been recently obtained regarding the power of hypothetical closed timelike curves (CTCs) in quantum computation. Here we show that the one-way model of measurement-based quantum computation encompasses in a natural way the CTC model proposed by Bennett, Schumacher, and Svetlichny. We identify a class of CTCs in this model that can be simulated deterministically and point to a fundamental limitation of Deutsch's CTC model which leads to predictions conflicting with those of the one-way model.
Many results have been recently obtained regarding the power of hypothetical closed timelike curves (CTCs) in quantum computation. Here we show that the one-way model of measurement-based quantum computation encompasses in a natural way the CTC model proposed by Bennett, Schumacher, and Svetlichny. We identify a class of CTCs in this model that can be simulated deterministically and point to a fundamental limitation of Deutsch's CTC model which leads to predictions conflicting with those of the one-way model.
One out of many emerging implications from solutions of Einstein's general relativity equations are closed timelike curves (CTCs), which are trajectories through space-time that allow for time travel to the past without exceeding the speed of light. Two main quantum models of computation with the use of CTCs were introduced by Deutsch (D-CTC) and by Bennett and Schumacher (P-CTC). Unlike the classical theory in which CTCs lead to logical paradoxes, the quantum D-CTC model provides a solution that is logically consistent due to the self-consistency condition imposed on the evolving system, whereas the quantum P-CTC model chooses such a solution through postselection. Both models are nonequivalent and imply nonstandard phenomena in the field of quantum computation and quantum mechanics. In this paper, we study the implications of these two models on the second law of thermodynamics---the fundamental principle which states that in an isolated system the entropy never decreases. In particular, we construct CTC-based quantum circuits which lead to a decrease in entropy.
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to non-trivial insights into general relativity, quantum information and other areas. In this paper, we show that, if CTCs existed, quantum computers would be no more powerful than classical computers: both would have the (extremely large) power of the complexity class polynomial space ( ), consisting of all problems solvable by a conventional computer using a polynomial amount of memory. This solves an open problem proposed by one of us in 2005, and gives an essentially complete understanding of computational complexity in the presence of CTCs. Following the work of Deutsch, we treat a CTC as simply a region of spacetime where a ‘causal consistency’ condition is imposed, meaning that nature has to produce a (probabilistic or quantum) fixed point of some evolution operator. Our conclusion is then a consequence of the following theorem: given any quantum circuit (not necessarily unitary), a fixed point of the circuit can be (implicitly) computed in . This theorem might have independent applications in quantum information.
Abstract This study examines closed timelike curves (CTCs) in quantum mechanics, focusing on the Deutsch model, one of the most widely studied frameworks for describing quantum systems in the presence of time loops. In this model, a quantum state ∣ψ⟩|\psi\rangle∣ψ⟩ interacts unitarily with its past version, effectively forming a two-qubit system where the chronologically consistent qubit interacts with a qubit ρCTC\rho_{\text{CTC}}ρCTC trapped in a closed timelike curve. The state ρCTC\rho_{\text{CTC}}ρCTC is determined by the Deutsch consistency condition, ensuring self-consistent evolution along the CTC. This approach allows for rigorous modeling of quantum systems under non-classical temporal structures, providing insights into temporal correlations, causality violations, and the potential computational advantages offered by CTC-assisted quantum operations. While alternative CTC models based on postselection have been proposed, the Deutsch model remains a foundational reference for studying quantum evolution in non-linear temporal frameworks. Its analysis informs research in quantum information, retrocausality, and the theoretical limits of computation in exotic spacetime geometries.
Closed timelike curves (CTCs) are trajectories in spacetime that effectively travel backwards in time: a test particle following a CTC can interact with its former self in the past. A widely accepted quantum theory of CTCs was proposed by Deutsch. Here we analyze an alternative quantum formulation of CTCs based on teleportation and postselection, and show that it is inequivalent to Deutsch's. The predictions or retrodictions of our theory can be simulated experimentally: we report the results of an experiment illustrating how in our particular theory the "grandfather paradox" is resolved.
One way to study the physical plausibility of closed timelike curves (CTCs) is to examine their computational power. This has been done for Deutschian CTCs (D-CTCs) and postselection CTCs (P-CTCs), with the result that they allow for the efficient solution of problems in PSPACE and PP, respectively. Since these are extremely powerful complexity classes, which are not expected to be solvable in reality, this can be taken as evidence that these models for CTCs are pathological. This problem is closely related to the nonlinearity of this models, which also allows, for example, cloning quantum states, in the case of D-CTCs, or distinguishing nonorthogonal quantum states, in the case of P-CTCs. In contrast, the process matrix formalism allows one to model indefinite causal structures in a linear way, getting rid of these effects and raising the possibility that its computational power is rather tame. In this paper, we show that process matrices correspond to a linear particular case of P-CTCs, and therefore that its computational power is upperbounded by that of PP. We show, furthermore, a family of processes that can violate causal inequalities but nevertheless can be simulated by a causally ordered quantum circuit with only a constant overhead, showing that indefinite causality is not necessarily hard to simulate.
We consider computation in the presence of closed timelike curves (CTCs), as proposed by Deutsch. We focus on the case in which the CTCs carry classical bits (as opposed to qubits). Previously, Aaronson and Watrous showed that computation with polynomially many CTC bits is equivalent in power to PSPACE. On the other hand, Say and Yakaryilmaz showed that computation with just 1 classical CTC bit gives the power of "postselection", thereby upgrading classical randomized computation (BPP) to the complexity class BPP_path and standard quantum computation (BQP) to the complexity class PP. It is natural to ask whether increasing the number of CTC bits from 1 to 2 (or 3, 4, etc.) leads to increased computational power. We show that the answer is no: randomized computation with logarithmically many CTC bits (i.e., polynomially many CTC states) is equivalent to BPP_path. (Similarly, quantum computation augmented with logarithmically many classical CTC bits is equivalent to PP.) Spoilsports with no interest in time travel may view our results as concerning the robustness of the class BPP_path and the computational complexity of sampling from an implicitly defined Markov chain.