Skip to main content
Sandbox Physics

FR09-C · A state spread over five sites

Boundary Quantum Error Correction

How much of an encoded quantum state can be erased and still recovered? This five-qubit code recovers an arbitrary input after any two known erasures. The surviving three sites preserve both populations and relative phase. If only two sites survive, their state carries no information about the input.

Erase sites around a five-qubit encoding and compare the recovered state with the input. Change the input phase to test whether the quantum information survives.

Interactive modelBoundary Quantum Error Correction
Recovery fidelity1.001.00
Surviving sites33
Recovered purity1.001.00
Erasure-condition residual00

Exact finite-code calculation

Compare all three state components

Gold is the input; teal is the recovered state. The three Pauli expectation values specify a qubit, including its relative phase.

Recovered density matrix and recovery conditionρrecovered=(0.7040.343−0.301i0.343+0.301i0.296)\rho_{\rm recovered}=\begin{pmatrix}0.704&0.343-0.301i\\0.343+0.301i&0.296\end{pmatrix}

Ae†Af=cefIA_e^\dagger A_f=c_{ef}I

The residual measures the largest failure of this erasure-correction condition for the displayed channel. Zero allows one recovery map to preserve every logical state, including entanglement with an external reference.

Physics tutorial

Boundary Quantum Error Correction

BackgroundAn unknown qubit has both populations and a relative phase. Encoding spreads that information over a larger state. A small part can reveal nothing even when the larger state remembers everything.

Why it mattersThis five-qubit code is the building block of a finite tensor-network model of holographic encoding. Losing a known site gives a precise test of what the remaining sites contain.

Start with the essentials

Focus question
How much of an encoded quantum state can be erased and still recovered?
One-sentence intuition
Three surviving sites jointly preserve the logical qubit, although any pair alone contains no information about it.

Core mathematical model

An isometric encoding

V∣ψ⟩=cos⁡ϑ2∣0L⟩+eiφsin⁡ϑ2∣1L⟩V†V=I\begin{aligned}V|\psi\rangle&=\cos\frac{\vartheta}{2}|0_L\rangle\\&\quad+e^{i\varphi}\sin\frac{\vartheta}{2}|1_L\rangle\\V^\dagger V&=I\end{aligned}

The two logical codewords are orthonormal five-qubit states. The polar angle sets the populations; the azimuth sets the relative phase.

Erase by tracing out a site

NE(ρ)=Tr⁡E(VρV†)=∑eAeρAe†\begin{aligned}\mathcal N_E(\rho)&=\operatorname{Tr}_E(V\rho V^\dagger)\\&=\sum_e A_e\rho A_e^\dagger\end{aligned}

The erased outcomes are summed over without conditioning on a measurement. Recovery receives only this reduced density matrix and the list of lost positions.

Test the whole logical subspace

Ae†Af=cefIρout=RE(NE(∣ψ⟩⟨ψ∣))F=⟨ψ∣ρout∣ψ⟩\begin{aligned}A_e^\dagger A_f&=c_{ef}I\\\rho_{\rm out}&=\mathcal R_E(\mathcal N_E(|\psi\rangle\langle\psi|))\\F&=\langle\psi|\rho_{\rm out}|\psi\rangle\end{aligned}

The first condition tests whether the erased subsystem can distinguish logical states. When it holds, a recovery channel preserves every input and its entanglement with a reference. Fidelity compares the displayed recovered state with the chosen pure input.

Common difficulties

The information is shared across sites

Typical misconceptionEach site holds a spare copy of the input.

Better mental modelAny one or two sites have an input-independent state. The logical information is in joint correlations. Two disjoint groups of three sites cannot fit into a five-site code, so the recovery regions cannot make two independent copies.

Known erasure differs from unknown damage

Typical misconceptionRecovering two erased sites means any two unknown errors can also be corrected.

Better mental modelErasure tells the decoder which positions are missing. This distance-three code corrects two known erasures or one arbitrary unknown single-qubit error.

Run the experiment

  1. 01

    Start with two lost sites

    Predict whether the relative phase survives. Choose Two sites lost, then drag the gold dial.

    What to observe: All three recovered components follow the input. The survivors preserve a superposition as well as a basis state.
  2. 02

    Lose one more

    Choose Too little survives, then move both input sliders.

    What to observe: The input bars move, but every recovered component stays zero. With only two sites, the recovery returns the maximally mixed logical state and fidelity is one half.
  3. 03

    Try another erased pair

    Reset. Click the erased sites to restore them, then erase a different pair. Save a simulation record.

    What to observe: Every pair gives exact recovery. The file contains the encoded complex amplitudes, surviving density matrix and recovered result for that input.

Related experiments and articles

Holography and quantum gravity · Reading path

From AdS signals to entanglement geometry and quantum recovery

Articles on this path that use this experiment, followed by the other experiments they suggest.

  1. ArticleWhy half of a pure quantum state can look random
  2. ArticleRecovering a superposition after two qubits are lost
  3. ArticleRead a holography paper through a small calculable model
  4. LabAdS Interval EntanglementRecalculate an analytic slice
FeedbackSomething broken, confusing, or missing on this page?Tell us
What kind of feedback?

Sent with this page’s address, its Lab ID, the site language and your device type. Please leave out personal details. Feedback is kept for up to 12 months.Privacy policy