Gate Teleportation
A protocol that applies a gate by consuming a pre-prepared entangled resource state and classical feedforward.
The idea
Gate teleportation applies a desired unitary not by executing it directly on the data qubit, but by teleporting the data through a specially prepared entangled resource state that has the gate baked in. Measurement outcomes then determine a Pauli correction that finishes the operation. It extends standard quantum-state teleportation from moving states to applying gates.
Why it exists
Some gates are hard to perform directly but easy to prepare offline in a resource state. The most important case is the T gate in fault-tolerant computing: a noisy T is distilled into a clean magic state ahead of time, and gate teleportation consumes that magic state to apply a protected T on demand. This is the backbone of magic-state distillation architectures.
The T-gate gadget
To apply T to |ψ⟩: prepare the magic state |A⟩ = T|+⟩, apply a CNOT from data to the magic qubit, measure the magic qubit in the Z basis. If the outcome is 1, apply an S correction to the data. The data emerges as T|ψ⟩, with only Clifford operations and a measurement performed live.
# T via magic-state gate teleportation (schematic)
# prepare |A> = T|+>
# cnot(data -> magic)
# m = measure(magic, basis='Z')
# if m == 1: apply S to data
def correction_needed(measurement):
return 'S' if measurement == 1 else 'none'
One-way and measurement-based computing
Gate teleportation is the mechanism behind measurement-based quantum computation, where a large cluster state is prepared once and the entire computation proceeds by adaptive single-qubit measurements. Each measurement teleports the logical state forward while applying a gate, with the measurement basis chosen from earlier outcomes.
Significance
By moving hard gates offline into resource preparation and distillation, gate teleportation lets a fault-tolerant machine keep its live operations within the protected Clifford set. See Clifford+T synthesis and Pauli group.