2011
DOI: 10.1103/physrevlett.106.040403
|View full text |Cite
|
Sign up to set email alerts
|

Closed Timelike Curves via Postselection: Theory and Experimental Test of Consistency

Abstract: 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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
176
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 139 publications
(179 citation statements)
references
References 30 publications
2
176
0
Order By: Relevance
“…(16), following the model of closed time-like curves considered in Refs. [33][34][35][36]. It is known that such an artificial rescaling of the probability of postselected outcomes has dramatic computational consequences [37].…”
Section: Is Given By S(a ⊗ B)mentioning
confidence: 99%
“…(16), following the model of closed time-like curves considered in Refs. [33][34][35][36]. It is known that such an artificial rescaling of the probability of postselected outcomes has dramatic computational consequences [37].…”
Section: Is Given By S(a ⊗ B)mentioning
confidence: 99%
“…As we will see, this can produce surprising behavior. Bennett and Schumacher [4] and, independently, Svetlichny [5], offered an alternative model of CTCs, which was further developed by Lloyd et al [6][7][8]. This account simulates CTC interactions by quantum teleportation combined with postselection-hence, P-CTCs.…”
Section: Introductionmentioning
confidence: 99%
“…Following Aaronson's proof [15] that the complexity class Post-BQP (post-selected bounded-error quantum polynomial-time) is equivalent to PP, Lloyd et al [7] observed that quantum computers with access to P-CTCs could compute any problem in PP in polynomial time. The complexity class PP is the class of decision problems that a probabilistic Turing machine, running in polynomial time, accepts with probability at least 1/2 if and only if the answer is 'yes.'…”
Section: Introductionmentioning
confidence: 99%
“…For example, it immediately follows that such a theory can also clone unknown quantum states-and thus behaves more like a classical probability theory where different density operators correspond to different points in the state space, and every point is perfectly distinguishable. 6 There already exist models of gravitational decoherence that satisfy these conditions, 21 and it would be exciting to see if this is true for other attempts to reconcile quantum theory with time travel, [22][23][24] or more general non-linear candidate theories of quantum gravity. 25,26 …”
Section: Discussionmentioning
confidence: 99%