Quantum Error Correction and Complementary Recovery

An operator algebra is recoverable from a physical region precisely when the erased complement reveals no information that fails to commute with that algebra. This information–disturbance equivalence is the mathematical core of complementary recovery. It permits a logical bulk algebra to have representatives on several overlapping boundary regions while its commutant is represented on their complements. Centers and approximation errors must be included explicitly.

Required background. Quantum Information supplies channels, Stinespring dilations, erasure noise, diamond norm, and von Neumann algebras; Gauge Theory and String-Theory Preparation supplies gauge constraints and holographic factorization issues.

Helpful background. Semiclassical Gravity supplies area sectors and $1/N$ errors; Quantum Fields in Curved Spacetime supplies regional effective algebras; Black-Hole Information supplies entanglement wedges and islands.

Logical algebras and erasure channels

Assume a finite-dimensional regulator and an isometry

$$V:\mathcal H_{\mathrm{code}} \longrightarrow \mathcal H_A\otimes\mathcal H_B.$$

Let $\mathcal M\subseteq\mathcal B(\mathcal H_{\mathrm{code}})$ be the logical algebra intended for region $A$, and let $\mathcal M'$ be its commutant. The encoding channels to the two physical regions are

$$\mathcal N_A(\rho)=\operatorname{Tr}_B(V\rho V^\dagger), \qquad \mathcal N_B(\rho)=\operatorname{Tr}_A(V\rho V^\dagger).$$

$\mathcal M$ is exactly reconstructible on $A$ if every $X\in\mathcal M$ has an $X_A$ satisfying

$$(X_A\otimes I_B)V=VX.$$

This Heisenberg condition is equivalent to a Schrödinger recovery channel for all states on the declared code and algebra. It says nothing about operators outside $\mathcal M$.

Thus the code subspace and erasure channel are inseparable parts of the statement. Enlarging $\mathcal H_{\mathrm{code}}$ changes the channel’s distinguishability properties, even when $V$ and the physical bipartition are otherwise unchanged. Changing $\mathcal M$ from a commuting algebra to the full matrix algebra strengthens the information that recovery must preserve.

Exact complementary-recovery theorem

Theorem. Under the finite-dimensional hypotheses above, the algebra $\mathcal M$ is exactly correctable against erasure of $B$ if and only if

$$V^\dagger(I_A\otimes Y_B)V\in\mathcal M'$$

for every physical operator $Y_B$. Equivalently, the complementary channel $\mathcal N_B$ contains no information about the noncommuting degrees of freedom in $\mathcal M$. With the corresponding condition for $\mathcal M'$, the code has complementary recovery: $\mathcal M$ is represented on $A$ and $\mathcal M'$ on $B$. The progression from conventional and subsystem erasure correction to the operator-algebra theorem is developed in Harlow 2017, §§3–5, with the algebraic theorem in §5.1 and its holographic reconstruction application in §5.3; the subsystem-code framework is given in Kribs, Laflamme, Poulin, and Lesosky 2006, §§2–4.

Necessity. Take physical representatives respecting adjoints on the code, as required for a representation of the full algebra. Since $X_A\otimes I_B$ commutes with $I_A\otimes Y_B$, the intertwining relations for $X$ and $X^\dagger$ give

$$\left[X,V^\dagger(I_A\otimes Y_B)V\right]=0.$$

The compressed complementary operator therefore belongs to $\mathcal M'$.

Sufficiency. Conversely, assume every complementary operator compresses into $\mathcal M'$. Matrix elements of $\mathcal N_B$ then depend only on the commutant data. Stinespring uniqueness allows the remaining logical action of $\mathcal M$ to be moved to $A$, producing a representation $X\mapsto X_A$ and a recovery channel. The key idea is not dimension counting but indistinguishability: the erased environment cannot distinguish coherences that $\mathcal M$ must preserve.

For the special case $\mathcal M=\mathcal B(\mathcal H_{\mathrm{code}})$, the commutant consists only of scalar multiples of the identity. The condition then reduces to

$$V^\dagger(I_A\otimes Y_B)V=c(Y_B)I_{\mathrm{code}},$$

the Knill–Laflamme criterion for an erasure: the environment expectation of every $Y_B$ is independent of the logical state, including its coherences. This limit independently checks that the algebraic theorem reproduces ordinary subspace quantum error correction.

Centers and several physical regions

A finite-dimensional von Neumann algebra has a block form

$$\mathcal H_{\mathrm{code}} = \bigoplus_\alpha \left(\mathcal H_{a_\alpha}\otimes\mathcal H_{\bar a_\alpha}\right),$$ $$\mathcal M = \bigoplus_\alpha \left(\mathcal B(\mathcal H_{a_\alpha})\otimes I_{\bar a_\alpha}\right).$$

The central projectors onto $\alpha$ blocks lie in both $\mathcal M$ and $\mathcal M'$. In gravity, area or charge sectors can play this role. Complementary recovery does not assign the center exclusively to one side; both sides can represent the same classical sector label without cloning an arbitrary quantum state.

One logical algebra may be recoverable from several physical regions $A_1,A_2,\ldots$ when their complements each erase the relevant information. The physical representatives need not commute globally and need not agree outside the code. In holographic language, overlapping boundary reconstructions are properties of one encoded algebra, not independent interior copies; see Almheiri, Dong, and Harlow 2015, §§2–4.

Approximate recovery and error metrics

For approximate recovery, name the channel norm and the logical output. Let $\mathcal E_{\mathcal M}$ be the trace-preserving conditional expectation onto the finite-dimensional logical algebra: it deletes coherences between central blocks and replaces each unobserved $\bar a_\alpha$ factor by its maximally mixed state, while preserving every expectation in $\mathcal M$. A precise criterion is

$$\inf_{\mathcal R_A} \left\lVert \mathcal E_{\mathcal M}\circ\mathcal R_A\circ\mathcal N_A -\mathcal E_{\mathcal M} \right\rVert_\diamond \le\varepsilon,$$

where $\mathcal R_A$ outputs a state on the code Hilbert space. Both terms are now channels with the same input and output, so the diamond norm is unambiguous and includes an arbitrary reference system. For the full matrix algebra, $\mathcal E_{\mathcal M}$ is the identity and this reduces to ordinary quantum-state recovery. Approximate information–disturbance theorems relate recovery error to leakage into the complement, with constants and square roots depending on the theorem and convention used.

An average fidelity over selected code states is weaker than a diamond-norm bound because it need not control an entangled reference or adversarial superposition. A small $1/N$ relative-entropy discrepancy likewise requires a theorem before it becomes an operator-norm reconstruction error.

Approximate complementary recovery is also directional. A bound for recovery from $A$ controls leakage to $B$ about $\mathcal M$; it does not automatically give the same numerical error for recovering $\mathcal M'$ from $B$. Separate dimensions, centers, and norm conversions can enter. Reporting one symbol $\varepsilon$ for both directions without derivation hides this asymmetry.

Counterexample beyond threshold. If $B$ receives an orthogonal record of the full logical basis, it can distinguish logical states. The complementary condition fails for off-diagonal logical operators, so no recovery from $A$ can preserve arbitrary superpositions. A commuting classical subalgebra may remain recoverable even when the full matrix algebra fails.

Generic quantum-channel proofs are not rederived beyond this finite-dimensional argument, and gravitational dressing remains a separate limitation.

Exercises

Use the code $\lvert0_L\rangle=\lvert00\rangle$, $\lvert1_L\rangle=\lvert11\rangle$. Show that the diagonal algebra generated by logical $Z$ is recoverable from either qubit, but the full logical algebra is not recoverable after erasing either qubit.

Solution

Physical $Z$ on either qubit represents logical $Z$, so every diagonal logical operator is recoverable. The erased qubit records whether the codeword is $0_L$ or $1_L$; its channel is not constant on the full logical state. Tracing it out maps a superposition $a\lvert00\rangle+b\lvert11\rangle$ to a diagonal mixture on the retained qubit and destroys the phase of $ab^*$. Logical $X$ and $Y$ therefore cannot be recovered. This distinguishes complementary recovery of a commuting algebra from correction of a full quantum subsystem.

References

• Almheiri, Dong, and Harlow 2015, Ahmed Almheiri, Xi Dong, and Daniel Harlow, “Bulk Locality and Quantum Error Correction in AdS/CFT,” Journal of High Energy Physics 04 (2015) 163.
• Harlow 2017, Daniel Harlow, “The Ryu–Takayanagi Formula from Quantum Error Correction,” Communications in Mathematical Physics 354 (2017) 865–912.
• Kribs et al. 2006, David W. Kribs, Raymond Laflamme, David Poulin, and Maia Lesosky, “Operator Quantum Error Correction,” Quantum Information & Computation 6 (2006) 382–399.