Fetching the paper…
Reading the bibliography…
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas.
The gravitational field of a distribution of particles rotating around an axis of symmetry
W. J. van Stockum · 1937
Earlier work this paper cites.
An example of a new type of cosmological solution of Einstein’s field equations of gravitation
K. Gödel · 1949
Earlier work this paper cites.
On relating time and space to size and depth
A. Borodin · 1977
Earlier work this paper cites.
Parallel computation for well-endowed rings and space-bounded probabilistic machines
A. Borodin, S. Cook, and N. Pippenger · 1983
Earlier work this paper cites.
Wormholes, time machines, and the weak energy condition
M. S. Morris, K. S. Thorne, and U. Yurtsever · 1988
Earlier work this paper cites.
Matrix Analysis
R. A. Horn and C. R. Johnson · 1990
Earlier work this paper cites.
Quantum mechanics near closed timelike lines
D. Deutsch · 1991
Cited alongside, same era.
Parallel linear algebra
J. von zur Gathen · 1993
Cited alongside, same era.
Fault-tolerant quantum computation with constant error
D. Aharonov and M. Ben-Or · 1997
Cited alongside, same era.
Space-bounded quantum complexity
J. Watrous · 1999
Cited alongside, same era.
On the problem of equilibration and the computation of correlation functions on a quantum computer
B. Terhal and D. DiVincenzo · 2000
Cited alongside, same era.
Computers with closed timelike curves can solve hard problems
T. Brun · 2003
Cited alongside, same era.
Quantum computational complexity in the presence of closed timelike curves
D. Bacon · 2004
Later among the works it cites.
NP-complete problems and physical reality
S. Aaronson · 2005
Later among the works it cites.
Quantum information and the PCP theorem
R. Raz · 2005
Later among the works it cites.
QMA/qpoly is contained in PSPACE/poly: de-Merlinizing quantum protocols
S. Aaronson · 2006
Later among the works it cites.
Complexity Theory: A Modern Approach
S. Arora and B. Barak · 2008
Closest in time.
Quantum computational complexity
J. Watrous · 2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…