Gate Teleportation
Teleporting operations, not just states.
Teleportation's corrections are Paulis. Conjugate them by a gate and you get a recipe for applying by consuming a pre-made resource state. That trick (Gottesman & Chuang, 1999) is how fault-tolerant machines perform their hardest gates, how linear optics becomes universal, and why measurements alone can compute.
What you’ll learn
- Derive the gate-teleportation identity and the correction rule .
- Define the Clifford hierarchy and show that gates in , such as and CCZ, teleport with Clifford corrections.
- Derive magic-state injection for the gate and explain its role in fault-tolerant architectures.
- Recognize one-bit teleportation inside measurement-based computing, linear-optics computing and teleportation-based error correction.
- State and prove the no-programming theorem, and explain what port-based teleportation buys.
Teleporting through a gate
Run ordinary teleportation, then apply a gate to Bob's qubit. Because acts on Bob's qubit only, it commutes with everything Alice does, so it may just as well be applied to Bob's half of the Bell pair before the protocol starts. The resource becomes , the Choi state of , which can be prepared offline, tested, and discarded if faulty.
Apply to the teleportation identity .
Push through the Pauli: the by-product becomes .
Bob's correction is . If is a Clifford gate, is again a Pauli, and the correction is as cheap as in ordinary teleportation.
The difficulty of applying has moved offline, into preparing . Online, only Bell measurements and corrections are needed. For two-qubit gates the same works with two Bell pairs: Gottesman and Chuang's original application was a teleported CNOT.
You teleport through , and Alice's outcome means the by-product before conjugation is . What must Bob apply to obtain ?
Show the answer
B.
, so Bob holds . Because is Clifford the correction is a Pauli, here .
The Clifford hierarchy
is diagonal, so it commutes with .
Not a Pauli, but a Clifford (): so .
On the phases combine to . Conjugating a Pauli by CCZ yields a CZ on the other two qubits, which is Clifford; by symmetry the same holds on every qubit, and 's commute with CCZ.
The hierarchy is subtler than its definition suggests. and are groups, but for is not closed under multiplication. Each level is, however, closed under multiplication by Cliffords on either side. Not every unitary lies in some level: a diagonal gate belongs to the hierarchy only when is a rational multiple of whose denominator is a power of 2, such as in or in . The diagonal gates of every level have been fully characterized (Cui, Gottesman & Krishna 2017).
Magic-state injection
For a diagonal gate like , a full Bell pair is overkill. Half of the protocol, one-bit teleportation (Zhou, Leung & Chuang 2000), suffices, consuming one copy of the magic state .
Data qubit first, magic state second.
The CNOT flips the magic qubit in the branch of the data, swapping its two amplitudes there.
Measure the magic qubit in . For , , and . Each outcome has probability ½, and the only correction is the Clifford .
Why this matters: by the Eastin–Knill theorem (2009), no quantum error-correcting code that detects arbitrary single-qubit errors has a universal set of transversal logical gates. Leading fault-tolerant architectures, such as the surface code, therefore implement Clifford operations within the code and import non-Clifford gates by injecting distilled magic states: gate teleportation at the logical level. As of the mid-2020s, producing magic states is among the dominant costs in resource estimates for useful algorithms.
A noisy magic state with error goes through one round of 15-to-1 distillation, . What is , in units of ?
Show the answer
3.5 ×10⁻⁵
. A second round gives , at a cost of noisy inputs per output. The cubic suppression is what makes distillation viable; the multiplicative overhead is what makes it expensive.
Teleportation as computation
One-bit teleportation is also the elementary step of measurement-based quantum computing (Raussendorf & Briegel 2001). Entangle the input qubit 1 with an ancilla qubit 2 in , then measure qubit 1 in a rotated basis:
The CZ is one bond of a cluster state.
The bra leaves , where . Using , outcome gives .
The by-product can be pushed through later steps if the next angle is adapted to . Chaining such steps teleports the logical qubit along the cluster while applying rotations, which generate all single-qubit unitaries; the two-dimensional cluster supplies entangling gates. Single-qubit measurements on a cluster state are therefore universal.
Linear optics. Photons barely interact, so a deterministic CZ between photonic qubits is impossible with linear optics alone. Knill, Laflamme & Milburn (2001) showed that teleporting the gate, through entangled ancilla photons prepared offline and with heralded measurements and feed-forward, yields scalable quantum computing from single photons, linear optics and photodetection; their teleported gates succeed with probability using entangled ancillas of size , and error correction handles the remaining failures. Modern photonic architectures build on the same principle with small entangled resource states and "fusion" measurements.
| Setting | What is teleported | Resource state |
|---|---|---|
| Fault-tolerant QC | , CCZ and other non-Clifford gates (Bravyi–Kitaev 2005) | Distilled magic states |
| Linear optics (KLM 2001) | CZ between photons | Entangled ancilla photons |
| MBQC (Raussendorf–Briegel 2001) | Every gate, via one-bit teleportation chains | Cluster or graph states |
| Teleportation-based error correction (Knill 2005) | Encoded data, corrected while it is teleported | Encoded Bell pairs |
| Distributed QC | A CNOT between distant modules: 1 ebit + 2 cbits suffice, and are optimal (Eisert et al. 2000) | Bell pairs between modules |
Programs as states: limits and frontier
Gate teleportation turns a state into a program: stores . Could one fixed device run any unitary, given its program state? Teleportation gives a probabilistic answer: with probability per qubit Alice's outcome is , no correction is needed, and Bob holds whatever was. A deterministic version is impossible.
Take the inner product of the two defining equations and use . (One first checks that the leftover cannot depend on .)
A matrix whose expectation value is the same in every state is a multiple of the identity.
Port-based teleportation (Ishizaka & Hiroshima 2008) trades entanglement for simplicity. Alice and Bob share maximally entangled pairs, the "ports". Alice measures the input together with her halves and announces a port number ; Bob keeps port and discards the rest, with no correction. The fidelity tends to 1 as . Because no correction is needed, Bob can apply to every port before hearing from Alice, which yields an approximate universal programmable processor. Port-based teleportation is also the key tool for instantaneous non-local computation and for attacks on position-based cryptography (Beigi & König 2011).
Key takeaways
- Teleporting through applies with by-products ; for Clifford they stay Pauli.
- Gates in teleport with corrections in : and CCZ need only Clifford fix-ups.
- Magic-state injection (CNOT, measurement, conditional ) applies using ; with Clifford operations this is universal (Bravyi–Kitaev), sidestepping Eastin–Knill.
- Measurement-based computing, KLM linear optics, teleportation-based error correction and distributed gates are all gate teleportation in disguise.
- Programs as states are limited by the no-programming theorem; port-based teleportation gives approximate universality at a large entanglement cost.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
You teleport through and the by-product before conjugation is , so Bob holds (up to phase) . Which correction gives ?
- (first , then )
Show the answer
B. (first , then )
, so Bob must undo : , a Clifford. That is why gates teleport with Clifford corrections.
Which statement about the Clifford hierarchy is true?
- Every level is a group
- and CCZ lie in , so they can be teleported with Clifford corrections
- Every unitary lies in some finite level
- Conjugating a Pauli by any gate gives a Pauli
Show the answer
B. and CCZ lie in , so they can be teleported with Clifford corrections
and are Clifford, so both gates are in , and teleporting them needs only Clifford corrections.
In the -gate injection gadget, with what probability does the measurement give (so that the correction is needed)?
- It depends on the relative phase of and
- , independent of
Show the answer
D. , independent of
The branch is , whose squared norm is . The outcome reveals nothing about , as it must for a gadget that preserves superpositions.
Why can't a fixed, finite-dimensional device apply an arbitrary unitary exactly and deterministically, given a program state that encodes ?
- Because the data qubit would have to be cloned
- Because program states decohere faster than data states
- Because inequivalent unitaries need mutually orthogonal program states, and there are infinitely many of them
- Because teleportation corrections for non-Clifford gates are themselves non-Clifford
Show the answer
C. Because inequivalent unitaries need mutually orthogonal program states, and there are infinitely many of them
The inner-product argument gives for all , which forces unless . A continuum of unitaries cannot fit into finitely many orthogonal states.
Further reading
- D. Gottesman & I. L. Chuang, "Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations", Nature 402, 390 (1999).
- X. Zhou, D. W. Leung & I. L. Chuang, "Methodology for quantum logic gate construction", Physical Review A 62, 052316 (2000).
- S. Bravyi & A. Kitaev, "Universal quantum computation with ideal Clifford gates and noisy ancillas", Physical Review A 71, 022316 (2005).
- E. Knill, R. Laflamme & G. J. Milburn, "A scheme for efficient quantum computation with linear optics", Nature 409, 46 (2001).
- R. Raussendorf & H. J. Briegel, "A one-way quantum computer", Physical Review Letters 86, 5188 (2001).