Deutsch Circuits with Negative Time Delays & Paradox Resolution




Deutsch’s Computational Circuits with Negative Time Delays

1) Context: Computation with Closed Timelike Curves (CTCs)

Deutsch (1991) proposed a quantum–mechanical model of computation in which circuits can include
closed timelike curves (CTCs) – effectively, wires that feed outputs back to earlier inputs.
Consistency is imposed by a quantum fixed–point condition so that “time travel” does not yield contradictions.

2) Negative Time Delays (Backwards-in-Time Wires)

In a normal circuit, gates act in time order. Deutsch allows a wire with a negative time delay that sends an output at time t_2 to an earlier input at time t_1 with t_1 < t_2:

    \[ \text{Output at time } t_2 \;\longrightarrow\; \text{Input at time } t_1 \quad (t_1 < t_2). \]

Let \rho_{\mathrm{CTC}} be the CTC system’s state and \rho_{\mathrm{CR}} the chronology–respecting (forward–going) system’s state.
If U is the joint unitary that couples them, Deutsch’s self–consistency condition is

    \[ \rho_{\mathrm{CTC}} = \operatorname{Tr}_{\mathrm{CR}} \!\left[ U\, \big(\rho_{\mathrm{CR}}\otimes \rho_{\mathrm{CTC}}\big)\, U^\dagger \right]. \]

In words: the state that emerges from the CTC interaction must equal the state that (earlier) entered the past.

3) Classical Grandfather Paradox vs. Quantum Resolution

Classically, a one–bit circuit that flips its own past value via a NOT gate has no self–consistent assignment:
input 0 implies output 1 (contradiction) and vice versa. In the quantum model, mixed states can resolve this:
the maximally mixed qubit

    \[ \rho_{\mathrm{CTC}} \;=\; \frac{1}{2} \begin{pmatrix} 1 & 0\\[2pt] 0 & 1 \end{pmatrix} \;=\; \frac{\mathbb{I}}{2} \]

is invariant under a Pauli–X (NOT) and can satisfy the fixed–point equation—so no contradiction arises.

4) Computational Power with CTC Access

Because the output must be a fixed point of a global, nonlinear map induced by the CTC interaction,
the model can “jump” to self–consistent solutions. Subsequent results show that classical or quantum
computers with CTCs can decide exactly PSPACE in polynomial time.

5) Time–Travel Paradox Analogues

  • Grandfather paradox → resolved by fixed–point mixed states.
  • Bootstrap/information paradox → information appears “from nowhere,” stabilized by self–consistency.
  • Decision paradoxes → solutions are fixed points of a global noncausal map.

6) Summary Table

Concept Classical Circuit Deutsch Quantum Circuit
Time ordering Strictly forward Negative time delays allowed
Feedback Causal via memory/state Literal backward-in-time qubit
Paradoxes Contradictions Resolved by mixed-state fixed points
Computational power Turing-limited PSPACE in polytime (with CTC)
Time travel model Impossible CTC with self-consistency

7) Explicit Circuit Example (NOT on a Negative-Delay Wire)

7.1 Circuit Sketch (ASCII)

CR:   |0⟩ ── H ──■──────── H ── (trace out CR)
                 │
CTC:  ρ_in ◄─────X────── X ─────►  ρ_out
         ^       (CNOT)   (NOT)         |
         |_______________________________|
                 negative time delay

Here the chronology–respecting (CR) line flows forward; the CTC line loops back to the past (negative delay).
We apply a CNOT with CR as control and CTC as target, followed by a NOT X on the CTC line before it loops back.

7.2 Unitary and Induced Map

Let the CR system be initialized to \rho_{\mathrm{CR}} = \lvert +\rangle\!\langle +\rvert with
\lvert +\rangle = \tfrac{1}{\sqrt{2}}(\lvert 0\rangle + \lvert 1\rangle).
Define

    \[ U \;=\; \big(I_{\mathrm{CR}}\otimes X_{\mathrm{CTC}}\big)\;\mathrm{CNOT}_{\mathrm{CR}\rightarrow \mathrm{CTC}}. \]

Deutsch’s condition becomes

    \[ \rho_{\mathrm{CTC}} \;=\; \operatorname{Tr}_{\mathrm{CR}} \!\left[ U\, \big(\rho_{\mathrm{CR}}\otimes \rho_{\mathrm{CTC}}\big)\, U^\dagger \right]. \]

A direct calculation shows that tracing out the CR induces the affine map

    \[ \Phi(\rho) \;=\; \tfrac{1}{2}\,\rho \;+\; \tfrac{1}{2}\,X\rho X, \quad\text{so}\quad \rho_{\mathrm{CTC}} \;=\; \Phi\!\big(\rho_{\mathrm{CTC}}\big). \]

7.3 Solving the Fixed-Point Equation

Write a general qubit state

    \[ \rho \;=\; \begin{pmatrix} p & r\\[2pt] r^* & 1-p \end{pmatrix}. \]

Conjugation by X yields

    \[ X\rho X \;=\; \begin{pmatrix} 1-p & r^*\\[2pt] r & p \end{pmatrix}. \]

Therefore

    \[ \Phi(\rho) = \tfrac{1}{2} \begin{pmatrix} p + (1-p) & r + r^*\\[2pt] r^* + r & (1-p) + p \end{pmatrix} = \begin{pmatrix} \tfrac{1}{2} & \mathrm{Re}(r)\\[2pt] \mathrm{Re}(r) & \tfrac{1}{2} \end{pmatrix}. \]

Self–consistency \rho=\Phi(\rho) implies p=\tfrac{1}{2} and r\in\mathbb{R}. Thus the fixed–point family is

    \[ \rho_{\mathrm{CTC}} \;=\; \begin{pmatrix} \tfrac{1}{2} & r\\[2pt] r & \tfrac{1}{2} \end{pmatrix}, \qquad -\tfrac{1}{2} \le r \le \tfrac{1}{2}. \]

Deutsch’s maximum–entropy rule selects the unique maximally mixed solution

    \[ \rho_{\mathrm{CTC}} \;=\; \frac{\mathbb{I}}{2}. \]

7.4 Interpretation

  • The NOT on the CTC wire encodes “I flip my own past state.”
  • The loop enforces \rho_{\mathrm{out}}=\rho_{\mathrm{in}} on the CTC system.
  • The induced map has self–consistent fixed points; picking \mathbb{I}/2 resolves the paradox.

References

  • Deutsch, D. (1991). Quantum mechanics near closed timelike lines. Phys. Rev. D 44, 3197–3217.
  • Aaronson, S., & Watrous, J. (2009). Closed timelike curves make quantum and classical computing equivalent. Proc. R. Soc. A 465, 631–647.
Rendering tip: If your environment does not auto-render LaTeX, keep the
equations exactly between \dots (inline) and

    \[ \dots \]

(display) as shown,
or include MathJax (already linked above).