Knill Error Correction: Teleportation Protocol

• Knill error correction is a teleportation-based quantum error-correction protocol that uses a single round of syndrome extraction with auxiliary logical Bell states.
• The method reduces online measurement complexity by replacing repeated stabilizer measurements with a one-shot transversal Bell measurement and offline decoding.
• In continuous-variable systems, the protocol, known as Knill-type error correction, corrects displacement errors in GKP states, facilitating improved photonic implementations.

Knill error correction is a teleportation-based quantum error-correction protocol in which repeated syndrome measurements are replaced with a single round of measurements and an auxiliary logical Bell state. In the stabilizer-code setting, a data block is refreshed by a transversal Bell measurement against an encoded ancilla, followed by classical decoding and teleportation of the logical state onto a fresh block (Murphy et al., 5 Mar 2026). In the continuous-variable literature, the same teleportation-based pattern is used for Gottesman–Kitaev–Preskill (GKP) states and is commonly called “Knill-type” error correction, where an imperfect GKP Bell pair is used to both transmit and simultaneously correct displacement errors on an input GKP-encoded mode (Marqversen et al., 20 May 2025). The terminology is distinct from the Knill–Laflamme criterion, which gives the necessary and sufficient condition for perfect correctability, but the protocol is embedded in that broader algebraic framework (Lebreuilly et al., 2021).

1. Teleportation architecture in stabilizer and CSS codes

In the circuit-level formulation, the protocol begins with a data block $D$, an $[\![n,k,d]\!]$ stabilizer or CSS code carrying the logical state to be refreshed, and two auxiliary blocks $A,B$, each an $[\![n,k,d]\!]$ copy, prepared offline in a logical Bell state

$$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$

For CSS codes one can instead prepare $|\bar0^{\otimes k}\rangle$ on $A$ and $|\bar+^{\otimes k}\rangle$ on $B$, a variant described as “compressed” Knill EC (Murphy et al., 5 Mar 2026).

Syndrome extraction is performed by a single Bell measurement between $D$ and $[\![n,k,d]\!]$0. A layer of $[\![n,k,d]\!]$1 transversal CNOT gates is applied from each qubit $[\![n,k,d]\!]$2 to $[\![n,k,d]\!]$3; every $[\![n,k,d]\!]$4 is then measured in the $[\![n,k,d]\!]$5 basis and every $[\![n,k,d]\!]$6 in the $[\![n,k,d]\!]$7 basis. The raw outcomes $[\![n,k,d]\!]$8 and $[\![n,k,d]\!]$9 provide $A,B$0 bits from which, for every stabilizer generator $A,B$1, one computes the parity $A,B$2; in fact one recovers the syndrome of the composite Pauli error on $A,B$3 in a single round. The decoder returns a Pauli correction $A,B$4 on $A,B$5, and because $A,B$6 may anticommute with some of the measured local Pauli products $A,B$7 and $A,B$8, the corresponding raw outcomes are locally flipped before the corrected logical measurement outcomes are computed. The corrected logical results determine the logical Pauli frame update on block $A,B$9, completing teleportation of the logical state from $[\![n,k,d]\!]$0 to $[\![n,k,d]\!]$1; the used blocks $[\![n,k,d]\!]$2 are then discarded (Murphy et al., 5 Mar 2026).

The operational point of the construction is that only one round of physical measurements is needed, rather than repeated stabilizer measurements. The trade-off is that the protocol requires auxiliary-state preparation in the form of a logical Bell-state factory, and that factory can absorb high-complexity decoding offline rather than in real time (Murphy et al., 5 Mar 2026).

2. Fault tolerance under locally decaying noise

The analysis in the circuit-level setting assumes locally decaying noise with rate $[\![n,k,d]\!]$3: correlated faults on $[\![n,k,d]\!]$4 locations occur with probability $[\![n,k,d]\!]$5. Under this model, if $[\![n,k,d]\!]$6 each have LD rate $[\![n,k,d]\!]$7, each of the $[\![n,k,d]\!]$8 CNOTs has LD rate $[\![n,k,d]\!]$9, and each single-qubit measurement has LD rate $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$0, then the effective LD rate on $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$1 after the noisy transversal Bell measurement is

$$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$2

A second structural ingredient is the linearity identity $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$3, used to show that all faulty events before and during the Bell measurement simply add to the syndrome as one composite error (Murphy et al., 5 Mar 2026).

The fault-tolerance theorem is phrased relative to a code-capacity decoder $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$4. If there exists $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$5 and a function $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$6 such that for any LD noise on an $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$7 code with rate $$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$8,

$$|\bar\Phi^+\rangle_{AB}=(|\bar0\bar0\rangle+|\bar1\bar1\rangle)^{\otimes k}/2^{k/2}.$$9

then, provided the auxiliary blocks are prepared so that $|\bar0^{\otimes k}\rangle$0, the online step recovers exactly the true logical measurement outcomes with probability at least $|\bar0^{\otimes k}\rangle$1, hence introduces no logical error. Repeated across $|\bar0^{\otimes k}\rangle$2 rounds, the overall failure scales as $|\bar0^{\otimes k}\rangle$3 (Murphy et al., 5 Mar 2026).

This result is technically significant because it reduces the online analysis to a single composite-error decoding problem. A plausible implication is that the difficult part of fault tolerance is shifted away from repeated, time-extended detector processing and into the preparation quality of the auxiliary encoded resource state.

3. Online decoding as a code-capacity problem

The time-constrained online decoder sees only one syndrome round of $|\bar0^{\otimes k}\rangle$4 bits. The composite Pauli error $|\bar0^{\otimes k}\rangle$5 on $|\bar0^{\otimes k}\rangle$6 is treated as if it were a code-capacity error on an $|\bar0^{\otimes k}\rangle$7 code, and its syndrome is fed into the same decoder designed for noiseless syndrome extraction. For surface codes this means running minimum-weight perfect matching on the standard primal/dual graph of size $|\bar0^{\otimes k}\rangle$8 with edge weights $|\bar0^{\otimes k}\rangle$9, where $A$0. For LDPC codes it means running belief propagation, either min-sum or sum-product, with log-likelihood ratios

$A$1

followed optionally by ordered-statistics decoding. No spacetime or marginal detector-graph decoding is required (Murphy et al., 5 Mar 2026).

The numerical benchmarks separate code-capacity thresholds from circuit-level Knill EC thresholds obtained with the same online decoder.

Code family	Code-capacity threshold	Knill EC circuit-level threshold
Lifted-product codes with BP	$A$2	$A$3
Rotated surface codes	$A$4	$A$5

For comparison, repeated-measurement decoding gives no observable threshold for lifted-product codes with overlapping-window BP, while for surface codes MWPM on $A$6 detectors gives $A$7. In all threshold cases, the logical-failure scaling

$A$8

is observed, consistent with minimum-weight error events of weight $A$9 causing logical flips (Murphy et al., 5 Mar 2026).

The classical-control implications are correspondingly direct. One round of $|\bar+^{\otimes k}\rangle$0 measurements per error-correction gadget yields syndrome data size $|\bar+^{\otimes k}\rangle$1 rather than $|\bar+^{\otimes k}\rangle$2; the online decoder is identical to code-capacity mode and can be implemented on FPGA or ASIC hardware with throughputs $|\bar+^{\otimes k}\rangle$3 checks/s; there is no syndrome backlog and no $|\bar+^{\otimes k}\rangle$4 measurement-and-decoding latency per cycle; and only the offline Bell-state factory needs a heavier decoder (Murphy et al., 5 Mar 2026).

4. Relation to the Knill–Laflamme criterion

The algebraic condition underlying correctability is the Knill–Laflamme criterion

$|\bar+^{\otimes k}\rangle$5

or equivalently, in codeword form,

$|\bar+^{\otimes k}\rangle$6

This is the necessary and sufficient condition for perfect correction of a specified error set on a code subspace (Lebreuilly et al., 2021, Bao et al., 2023). In the literature considered here, “Knill error correction” denotes the teleportation-based protocol, whereas “Knill–Laflamme” denotes the correctability criterion.

Several recent constructions illuminate how broadly the Knill–Laflamme structure arises. If a superselection rule decomposes the Hilbert space as $|\bar+^{\otimes k}\rangle$7 and allowed operators cannot change the superselection charge, then codewords chosen from distinct sectors automatically satisfy the off-diagonal part of Knill–Laflamme. The paper on superselection rules uses low-energy QCD as an example, treating proton and neutron states as different superselection sectors and observing that local errors respecting isospin cannot mix them (Bao et al., 2023).

A different formulation appears in spectral geometry. In the spectral-triple framework, a code projector is identified with a low-energy spectral projection of a Dirac-type operator, and locality is defined through the Connes distance. If $|\bar+^{\otimes k}\rangle$8 have diameter at most $|\bar+^{\otimes k}\rangle$9 and $B$0, then

$B$1

which is exactly the Knill–Laflamme condition in geometric form (Kanno et al., 27 Jan 2026).

These results do not redefine Knill error correction as a protocol. They show, rather, that the protocol sits atop a correctability condition that can be enforced by symmetry, topology, or geometry. This suggests that the teleportation-based refresh step is only one operational layer in a larger hierarchy of protected subspaces.

5. Continuous-variable and GKP Knill-type error correction

In the GKP setting, teleportation-based error correction is often called “Knill-type” after E. Knill’s original teleportation-based scheme. The data mode is mode 1, and the two-mode ancilla Bell pair occupies modes 2 and 3. The circuit proceeds by preparing an approximate GKP Bell pair $B$2, entangling the data mode with mode 2 by either a controlled-$B$3 gate $B$4 or a 50:50 beam splitter $B$5, measuring mode 1 in $B$6 with outcome $B$7 and mode 2 in $B$8 with outcome $B$9, and applying the corrective displacement on mode 3,

$D$0

It is an exact result that both choices of entangling gate implement the same overall map

$D$1

where the GKP projection $D$2 is entirely determined by the two-mode ancilla state $D$3 (Marqversen et al., 20 May 2025).

Two ancilla constructions are distinguished. In the “standard” qubit-style circuit, one starts from $D$4, applies the Fourier gate on mode 2, and then $D$5. In the “qunaught” circuit, one prepares two single-mode qunaught states $D$6 and entangles them on a 50:50 beam splitter $D$7 (Marqversen et al., 20 May 2025).

The performance difference is explicit at the variance level. For the qunaught-prepared Bell state, one has

$D$8

independent of the input spike width $D$9. For the standard qubit-style Bell state,

$[\![n,k,d]\!]$00

and

$[\![n,k,d]\!]$01

Thus the corrected state is asymmetric; $[\![n,k,d]\!]$02 and $[\![n,k,d]\!]$03, and in most regimes $[\![n,k,d]\!]$04, implying a net loss of total GKP squeezing (Marqversen et al., 20 May 2025).

The paper’s comparison of entangling gates is therefore not merely formal. Although controlled-$[\![n,k,d]\!]$05 and beam-splitter implementations are mathematically equivalent for ideal GKP states, for realistic finite-squeezing states the beam splitter plus qunaught ancillas is strictly superior, yielding isotropic residual noise with $[\![n,k,d]\!]$06. The same study further states that both Knill and Steane schemes require $[\![n,k,d]\!]$07 of GKP squeezing for concatenation with a surface-code qubit level, but Knill-qunaught relaxes this requirement on the data ancillas and is the simplest photonic implementation because no inline squeezing or controlled-$[\![n,k,d]\!]$08 gates are required (Marqversen et al., 20 May 2025).

6. Generalizations, adjacent frameworks, and common misconceptions

A recurrent misconception is to conflate the teleportation protocol with the algebraic theorem. The protocol called Knill error correction is a one-shot syndrome-extraction and teleportation procedure; the Knill–Laflamme theorem is the statement that a code corrects an error set iff the overlaps $[\![n,k,d]\!]$09 are scalar on the code. Several recent results broaden the latter statement without changing the former protocol (Lebreuilly et al., 2021).

In autonomous quantum error correction, the standard Knill–Laflamme criterion is generalized to an expanded hierarchy of errors generated by Lindblad jumps and no-jump backaction terms up to order $[\![n,k,d]\!]$10. The main theorem states that Knill–Laflamme on the set $[\![n,k,d]\!]$11 is equivalent to the existence of an engineered Lindbladian that protects the code up to order $[\![n,k,d]\!]$12, with effective logical decoherence rate $[\![n,k,d]\!]$13, and that this protection can be combined with generalized error-transparent Hamiltonians (Lebreuilly et al., 2021).

For dimension-changing noise, the same inner-product condition extends to non-square Kraus operators. In the single-qudit insertion/deletion setting, the theorem states that a code is correctable for a channel $[\![n,k,d]\!]$14, even when $[\![n,k,d]\!]$15, iff there exist scalars $[\![n,k,d]\!]$16 such that

$[\![n,k,d]\!]$17

Within this framework, single-qudit deletion and single-qudit insertion are equivalent error types under Knill–Laflamme (Shibayama, 13 Jan 2025).

Probabilistic quantum error correction replaces the deterministic equation $[\![n,k,d]\!]$18 by

$[\![n,k,d]\!]$19

The generalized Knill–Laflamme-style conditions are phrased in terms of $[\![n,k,d]\!]$20, and the formalism admits non-isometric, mixed-state encodings. The same paper shows that for $[\![n,k,d]\!]$21, the set of probabilistically correctable channels is strictly larger than the set of perfectly correctable channels; for $[\![n,k,d]\!]$22 and $[\![n,k,d]\!]$23, $[\![n,k,d]\!]$24 (Kukulski et al., 2022).

A further abstraction replaces scalar overlaps by overlaps with commuting unitaries. For families of isoclinic subspaces, the generalized condition

$[\![n,k,d]\!]$25

reduces to ordinary Knill–Laflamme when $[\![n,k,d]\!]$26, and for stabilizer codes the nontrivial case $[\![n,k,d]\!]$27 captures logical operators (Kribs et al., 15 Mar 2025).

Taken together, these developments indicate that Knill error correction, in the narrow sense, is a specific teleportation-based recovery gadget. The surrounding Knill–Laflamme ecosystem now includes circuit-level one-shot decoding, continuous-variable teleportation with GKP Bell pairs, autonomous dissipative protection, probabilistic recovery, dimension-changing errors, and geometric or isoclinic reformulations of correctability.