Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1504.05911 · Foundations of Physics

Simulations of Closed Timelike Curves

Todd A. Brun, Mark M. Wilde

Published Jan 24, 2017• 10 citations
arXivHTMLPDF
DOI
10.1007/s10701-017-0066-7

Related papers

Experimental simulation of closed timelike curves

Martin Ringbauer, Matthew A. Broome, Casey R. Myers +2 more

arXiv:1501.05014•Nature Communications•Jun 19, 2014•49 citations

Quantum mechanics near closed timelike curves

Lachlan G. Bishop

•Aug 9, 2024•4 citations

Quantum mechanical closed timelike curves from indefinite causal orders

Nikola Paunković, Marko Vojinović

•Oct 26, 2026•0 citations

Mixedness and entanglement in the presence of localized closed timelike curves

Eylee Jung, DaeKil Park

arXiv:1506.02333•Quantum Information Processing•Mar 30, 2016•2 citations

Quantum computational complexity in the presence of closed timelike curves

Dave Bacon

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 $\mathit{NP}$-complete problems with only a polynomial number of quantum gates.

arXiv:quant-ph/0309189•Physical Review A•Sep 13, 2004•79 citations

Time-Ordered Perturbations

WORLD SCIENTIFIC eBooks•Jun 1, 2022•0 citations
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\mathit{NP}NP-complete problems with only a polynomial number of quantum gates.