Quantum Teleportation is a Universal Computational Primitive

Teleportation mechanism

• Teleportation transfers an input qubit while a two-bit Bell-measurement outcome determines which Pauli correction must be applied to recover the state.The four possible operations are I, X, Y, and Z, with the identity associated with outcome 00.Source: §I · p. 1

Circuit elements

• The circuit uses Bell-basis measurements, classical control wires, and single-qubit corrections to reconstruct the desired two-qubit output.The teleportation circuit distinguishes classical measurement results from qubit wires and assigns the control qubit β and target qubit α in the controlled-not.Source: Figure 1 · p. 2, §I · p. 2

Controlled-not by teleportation

• The controlled-not construction works because Pauli operations before the gate can be propagated through it and replaced by different Pauli corrections afterward.This follows from controlled-not conjugation preserving the Pauli group, including cnot(X ⊗ I) = (X ⊗ X)cnot.Source: §I · p. 2
• A controlled-not gate can be deterministically implemented by teleporting two qubits through an entangled state and applying classically controlled single-qubit corrections.The construction uses prior entanglement and Bell-basis measurements rather than directly applying the controlled-not to the input qubits.Source: §I · p. 2, Figure 2 · p. 2

Entangled resource preparation

• The entangled |χ⟩ resource can be created from two EPR pairs or from two GHZ states, providing alternative preparation routes for the teleportation circuit.Figure 3 presents the two resource constructions, while the text identifies the GHZ-state route explicitly.Source: §I · p. 2, Figure 3 · p. 2

Encoded teleportation

• Any Clifford-group gate can be performed fault-tolerantly by teleporting encoded qubits through an appropriately prepared encoded Bell state.The Clifford group consists of gates that map Pauli operators to Pauli operators under conjugation.Source: §II · pp. 2–3

Ancilla preparation

• The encoded ancilla |Ψn U⟩ is prepared by stabilizer measurements that force operators M_i and N_i to have eigenvalue +1.The procedure starts with n EPR pairs, measures M_i and N_i, and applies Pauli operations as needed to reach the desired eigenspace.Source: §II · pp. 2–3

Fault-tolerance setting

• Fault tolerance restricts error propagation by using transversal operations, which prevent a single faulty gate from creating multiple errors within one code block.Pauli operations and Clifford operations are available on stabilizer codes through appropriate gates and measurements.Source: §II · pp. 2–3

Higher-level gates

• The construction provides a straightforward fault-tolerant method for any gate in C3, including gates such as Toffoli, π/8, and controlled-phase.For U ∈ C3, the teleportation correction induced by Bell measurements is in the Clifford group.Source: §II · p. 3

Encoded teleportation

• The fault-tolerant circuit measures the input against the upper halves of an encoded Bell state, producing a correction R′_xz obtained by conjugating the measurement-dependent Pauli correction through U.Because R′_xz lies in C2 for U ∈ C3, the correction can itself be implemented fault-tolerantly.Source: §II · p. 3

Ancilla preparation

• Fault-tolerant preparation is the main complication when M_i and N_i lack transversal implementations, and the paper defers that case to the Appendix.This complexity is confined to preparing the ancilla states used in teleportation.Source: §II · p. 3

• Nearly complete linear-optical quantum computers may be possible because current optical technology supports Bell measurements, teleportation, GHZ-state preparation, and single-qubit operations.The claim is conditional on having GHZ states available.Source: §III · p. 3
• An infinite family of gates Ck can be performed fault tolerantly through recursive teleportation constructions, including π/2^k rotations relevant to Shor’s factoring algorithm [1].The construction also dramatically simplifies fault-tolerant Toffoli gates relative to previous methods.Source: §III · p. 3
• The entangled resource states required for gates in Ck are exponentially difficult to construct as k increases, though they may be prepared offline.Source: §III · p. 3
• The required entangled states are proposed as generic quantum resources that could potentially be prepared and stored independently of computation.Source: §III · p. 3
• For small k, teleportation constructions can greatly reduce the operations needed to assemble precise gates for quantum algorithms with realistically imperfect gates.Source: §III · pp. 3–4

Measurement problem

• A single-control measurement is not fault tolerant because control errors can spread across a code block and encoded M may itself require difficult measurements.The standard procedure uses a control qubit, controlled-M, a Hadamard, and measurement; errors can corrupt the data or the inferred measurement result.Source: Appendix A · p. 4

Core ideas

• Fault tolerance combines coherent measurement, n-qubit cat states, and recursive application of the procedure to known ancilla states.Coherent correction disentangles the control, cat states distribute control across corresponding physical qubits, and known amplitudes permit recursive construction.Source: Appendix A · p. 4

Cat-state control

• Cat-state control implements a transversal M by applying each physical gate conditionally on the corresponding cat-state qubit, performing M either completely or not at all.This method was used for fault-tolerant Pauli measurements, where transversal implementations are available for stabilizer codes.Source: Appendix A · p. 4, Figure 6 · p. 4

Error control

• Verified cat states, repeated trials, majority voting, and intervening error correction keep a single trial error from propagating beyond one corresponding data qubit.Errors in inner or outer cat states affect corresponding data coordinates, while repetition and verification suppress incorrect majority outcomes.Source: Appendix A · p. 5

Recursive measurement

• Recursive inner measurements require separate verified cat states and must preserve the outer cat-state superposition while implementing controlled operations on the data.The inner procedure is itself controlled by the outer cat state, with decoding and disentanglement steps restoring the intended ancilla structure.Source: Appendix A · pp. 5–6

Failure analysis

• For sufficiently many trials, errors that spoil individual measurements are reduced to comparable failure scales, although some errors can collapse the outer cat-state superposition.A single majority-calculation error affects only one data qubit, while disentanglement failures are nonfatal but motivate repeated measurement.Source: Appendix A · p. 6

Recursive construction

• Recursive nesting of conditioned inner measurements enables ancilla preparation for C3 gates and, with further nesting, gates from C4, C5, and higher levels.The construction measures Clifford operators to create C3 ancillas, then recursively nests the procedure for higher gate hierarchies.Source: Appendix A · p. 6