Three-qubit bit-flip syndrome table 2026-10-14
Measure the commuting stabilizer generators and in that order. Use error syndrome bit for eigenvalue and bit for eigenvalue . For the Pauli X gate on physical qubit , every row holds for arbitrary normalized . This ordered parity-check convention follows [ref]
https://www.preskill.caltech.edu/ph229/notes/chap7.pdf. Preskill, §7.1
:| Error | State before recovery | eigenvalues | Error syndrome | Recovery |
|---|---|---|---|---|
Each pair of computational basis words within a row has the same two parities. Consequently the projective measurement reveals the row without distinguishing its two amplitudes. For example, becomes under . Both checks give with probability one, and applying restores both coefficients exactly, including the relative phase .
One implementation uses two quantum ancillas initialized to . Two controlled-NOT gates from data qubits 1 and 2 to the first quantum ancilla write their parity; two more from data qubits 2 and 3 to the second quantum ancilla write the other parity. Measuring only the quantum ancillas in the computational basis gives . Measuring the individual data qubits instead would reveal the encoded computational basis value and destroy the unknown quantum superposition. The existing coherent syndrome extraction for the three-qubit repetition code uses the alternative ordered checks , so its bit labels differ from this table.
The recovery also handles coherent errors. Put . Their images of the code are mutually orthogonal, giving , the Knill--Laflamme condition for this family. For any linear combination , its component in sector is . Measuring that error syndrome has probability on the normalized erroneous state, and recovery returns . More generally one recovery quantum channel corrects every noise quantum channel whose Kraus operators belong to this span. The assumption concerns the whole jointly correctable family; it does not extend to the span of arbitrary single-site Pauli errors. [ref]
https://www.preskill.caltech.edu/ph229/notes/chap7.pdf. Preskill, §7.2: correction of an error span
.A fully computed coherent example is the unitary operator . At it givesThe error syndromes and occur with probabilities and , independently of . Doing nothing for and applying for restores the same logical qubit in both branches; the scalar in the second branch is an irrelevant global phase. This is an example of linearity of coherent quantum error correction, rather than an assumption that the original error was a classical random bit flip.
Two-outcome LOCC dilution of a Bell pair Created 2026-10-14 Updated 2026-10-20
Let and . Starting from the Bell state , Alice applies the measurement in quantum mechanics with Kraus operators displayed above. Completeness follows from . Each outcome has probability . The normalized outputs are and . Communicating the outcome allows both parties to apply a Pauli X gate in the second branch, making both outputs equal to the first. Thus this LOCC protocol deterministically converts one Bell pair into any two-qubit pure state with these Schmidt coefficients, after appropriate local unitary operations. It includes the product state endpoint without postselection.
Two-qubit diffusion circuit 2026-10-25
The inversion about the mean for four computational-basis states can be implemented using Hadamard gates, Pauli X gates and one controlled-NOT gate, up to global phase. Let and . Since , one has and therefore . This gives an exact quantum circuit representative of the four-entry Grover search algorithm diffusion step modulo its irrelevant overall minus sign.
