What That 'Time Machine' Paper You Scrolled Past Actually Says

> One-sentence summary: A Cornell + MIT team published a PRL paper that rigorously characterizes the communication capacity limits of the "postselected closed timelike curve" (P-CTC) model using information theory. It is elegant mathematical physics, not an engineering blueprint. Lottery numbers? They can't be sent.

Introduction: When You See "Time Machine" on Your Feed

An image has recently gone viral across platforms — a paper in PRL (Physical Review Letters, a top physics journal) with "Retrocausal Capacity" right in the title. The captions usually read: "The moment human science rewrites history," "Top journal proves history can be rewritten by the future," "Build a time machine yourself in ten minutes."

As someone who reads papers, my first reaction was: PRL editors would not accept that kind of submission. Opening the paper, sure enough: the paper does something very hardcore, but between it and the time machine you're imagining lies the distance of a mathematics department.

The goal of this post is simple: explain what the paper actually does, what it does not do, and why it deserves PRL.

1. What Is P-CTC: From Einstein to Quantum Teleportation

To understand this paper, you must first understand Postselected Closed Timelike Curve (P-CTC).

1.1 Closed Timelike Curves: A "Time Loop" Allowed by General Relativity

In 1949, Kurt Gödel discovered something astonishing: Einstein's field equations allow a special spacetime structure — closed timelike curves (CTCs). Simply put, a worldline loops through spacetime back into its own past.

This isn't science fiction. It is a mathematical solution of Einstein's equations. The Gödel universe, a rotating cosmological model, is filled with CTCs.

The problem CTCs bring is direct: the grandfather paradox. If you travel back and kill your grandfather, you're never born; if you're never born, who killed him? A logical contradiction.

1.2 Two Resolution Schemes

Physicists have proposed two main approaches to avoid paradoxes:

Scheme 1: Deutsch's CTC (D-CTC)

Proposed by David Deutsch (father of quantum computing) in 1991. Core idea: systems in the CTC converge to a self-consistent quantum state. If you try to kill your grandfather, physics prevents it somehow — the gun jams, you hit the wrong person — the outcome must be self-consistent.

D-CTC's problems: it permits quantum cloning (copying arbitrary quantum states), violating a fundamental theorem of quantum mechanics. And it is computationally too powerful — it can solve any problem in the complexity class PP, which strikes physicists as "too sweet."

Scheme 2: P-CTC (Postselected CTC)

An alternative proposed by Seth Lloyd (MIT, one of this paper's authors) and colleagues in 2009–2011. The core intuition comes from something you already know: quantum teleportation.

Standard quantum teleportation: 1. Alice and Bob share a Bell state (maximally entangled pair) 2. Alice performs a joint measurement on her unknown state and her entangled particle 3. Alice sends the measurement result (2 classical bits) to Bob 4. Bob applies the corresponding unitary to recover the unknown state

Note step 3 — classical communication is essential. Without it, Bob's state is completely random, carrying no information.

But what if... we keep only one particular measurement outcome?

The core idea of P-CTC: postselection — keep only the data from one specific Bell measurement result, discard the rest. In that case, Bob doesn't need Alice's classical message; his particle "knows" Alice's unknown state the instant the measurement occurs.

This looks like information traveling from the future to the past — because Bob "possesses" the state's information before Alice's measurement.

1.3 The Mathematics of P-CTC

Mathematically, P-CTC is equivalent to a nonlinear quantum channel:

where \(C = \text{Tr}_A[U_{SA}]\) is the partial trace of the interaction unitary \(U\) over the CTC system.

The key feature is nonlinearity — the denominator depends on the input state \(\rho\). This nonlinearity is exactly why P-CTC can "bypass" the grandfather paradox: the denominators corresponding to paradox-generating outcomes are zero, and those probabilities are renormalized to zero.

This is the quantum version of the Novikov self-consistency principle: only logically self-consistent histories have nonzero probability.

2. The New Contributions of This PRL Paper

With the P-CTC background in place, here is what the paper actually does.

2.1 Problem Setting

The paper asks an information-theoretic question:

> If a P-CTC channel (a communication channel from the future to the past) exists, what is the maximum rate at which information can be transmitted through it?

This is not a philosophical question. Information theory has rigorous tools — Shannon capacity, Holevo capacity, etc. This paper points those weapons at P-CTC.

2.2 Three Main Results

Result 1: Complete characterization of one-shot capacity

The paper rigorously computes the one-shot classical capacity and one-shot quantum capacity of the P-CTC channel. "One-shot" means sending a message once, not in the asymptotic limit (n → ∞ channel uses).

In standard information theory, one-shot capacities are usually hard to compute. P-CTC's nonlinearity actually makes the problem tractable — P-CTC lets you exploit entanglement and postselection in a single interaction.

Result 2: Elegant asymptotic capacity formulas

In the asymptotic limit (unlimited channel uses), the paper proves:

• Classical asymptotic capacity = the average of the channel's max-information
• Quantum asymptotic capacity = the sum of the channel's max-information and regularized Dooblin information

These quantities (max-information and Dooblin information) already existed in information theory but lacked clear operational interpretations. The paper gives them a new physical meaning: they are the communication capacities of the P-CTC channel.

A beautiful mathematical result.

Result 3: Generalization to all completely positive maps

The paper further generalizes the results to all completely positive maps, not just quantum channels. This gives the framework broader potential applications, including black-hole final-state models.

2.3 Why This Is Hardcore

The hard part isn't the "time travel" gimmick but:

1. Information theory × quantum gravity: applying information-theoretic tools to extreme spacetime structures like CTCs 2. Mathematical rigor: P-CTC is nonlinear quantum mechanics; standard quantum information theory's linearity assumption fails, requiring new tools 3. Black-hole connection: the paper explicitly notes the results apply to various black-hole final-state models — a frontier of quantum gravity research

3. How Far Is This from a "Time Machine"?

Now the question you care about most: can this paper let us build a time machine?

3.1 Theoretical Level

P-CTC is a mathematical model, not physical reality. It assumes:

• Closed timelike curves exist (allowed by general relativity, but no observational evidence)
• Postselection can be implemented perfectly (keeping only specific measurement outcomes — in practice, extremely low success probability)

Even if P-CTC is mathematically self-consistent, its relation to the real physical world remains unknown. General relativity allows CTC solutions, but a quantum gravity theory (which we don't yet have) might forbid them.

3.2 Experimental Level

This paper has zero experiments. Purely theoretical derivations.

That said, P-CTC has an interesting property: it can be simulated within ordinary quantum mechanics, because the process it describes (postselected quantum teleportation) can be done in a lab. You just need many repetitions, keeping only the rare "correct" outcomes.

Indeed, experimental teams have simulated P-CTC behavior with superconducting qubits (2023-era work, arXiv:2501.16335). But note: this simulates the mathematical structure of P-CTC; it does not build a time machine.

3.3 Limits on Information Transmission

Even if P-CTC exists, transmissible information is severely limited:

You cannot send lottery numbers. Why? The postselection mechanism filters out information that creates logical contradictions. If you tried to send "next week's winning numbers" back to buy a ticket, that would cause a causal paradox (you buy the winning numbers → the outcome changes → the numbers are wrong → what you bought was wrong). P-CTC's nonlinearity renormalizes that outcome's probability to zero.

What can be sent? Only information that does not break self-consistency. Specifically, the paper proves information transmission is bounded by max-information and Dooblin information — quantities typically far below standard channel capacities.

The paper's own words: "This imposes information-theoretic limits on transmitting messages via postselected-teleportation-like mechanisms."

4. The Paper's Real Value

Strip away the "time machine" novelty filter, and the paper's real value lies on three levels:

4.1 Information Theory: New Interpretations of Old Concepts

Max-information and Dooblin information existed in information theory, but their physical meaning was unclear. This paper proves that in the P-CTC framework, these quantities directly correspond to communication capacities — a beautiful operational interpretation.

Analogy: entropy was defined in statistical mechanics for centuries, but only when Shannon connected it to information did people truly "understand" it. This paper does something similar for max-information.

4.2 Quantum Gravity: Connecting the Black Hole Information Paradox

The paper explicitly notes its results generalize to black-hole final-state models — a core problem in quantum gravity today.

The black hole information paradox: where does information that falls into a black hole go? If black holes evaporate completely, information seems lost, violating quantum mechanics' unitarity. "Final-state models" are one proposed resolution: evaporation has a specific final state, with information encoded somehow in Hawking radiation.

P-CTC's mathematical structure is deeply connected to certain final-state models. This paper's information-theoretic results may provide new tools for the black hole information problem.

4.3 Causal Structure: Time from an Information-Theoretic View

The deepest value may be philosophical. The paper uses the rigorous language of information theory to probe an ancient question: is the arrow of time fundamental?

If retrocausal communication has nonzero information-theoretic capacity, then "cause precedes effect" may not be an absolute law but a statistical regularity emerging under specific conditions — deeply connected to research on the thermodynamic arrow of time (the direction of entropy increase).

5. Facing the Hype Honestly

Let me say it directly: packaging this paper as "build your own time machine" is standard science-content-farm practice. The logic chain:

1. The title contains "retrocausal" 2. The paper studies a mathematical model of "time travel" 3. It's published in PRL (a top journal) 4. → Therefore "time machines are proven"

Every step is flawed:

• "Retrocausal" refers to an information-theoretic framework, not an engineered device
• "Time travel" is a theoretical possibility allowed by general relativity, not an experimental reality
• PRL published mathematical physics, not a patent

People who actually read the paper won't read "time machine" out of the title. They'll see:

> "We study the capacity of a quantum channel for retrocausal communication... We completely characterize the one-shot retrocausal quantum and classical capacities..."

This is an information theory paper whose subject is the capacity of a quantum channel. P-CTC merely provides a theoretical backdrop.

6. Conclusion

This paper does something hardcore: rigorously characterizes the communication capacity limits of the P-CTC model using information theory, proves the operational significance of max-information and Dooblin information, and extends the results to black-hole final-state models.

What it does not do:

• Prove time travel is physically feasible
• Propose any buildable device
• Overturn causality
• Let you send lottery numbers

Its value lies in mathematical elegance and physical depth — fusing tools from information theory, quantum mechanics, and general relativity in one paper to answer a precise question.

If you're interested in "time machines," read science fiction. If you're interested in "the nature of information," read this paper.

---

Paper: *Retrocausal Capacity of a Quantum Channel* Authors: Kaiyuan Ji, Seth Lloyd, Mark M. Wilde Institutions: Cornell University, MIT Journal: Physical Review Letters (PRL) Date: April 17, 2026 DOI: 10.1103/PhysRevLett.136.160202

Further background reading:

• Lloyd et al. (2011), *Quantum mechanics of time travel through post-selected teleportation*, Phys. Rev. D 84, 025007
• Bennett & Schumacher (unpublished), original idea of postselected quantum teleportation
• Brun & Wilde (2012), *Perfect state distinguishability and computational speedups with postselected closed timelike curves*