Quantum Errors: Bit-Flip and Phase-Flip
Quantum errors decompose into bit-flips (X), phase-flips (Z), and their combination (Y); correcting these two types suffices for all errors.
The error zoo, reduced to two
Quantum errors seem daunting because a qubit state is continuous — an error could nudge the amplitudes by any small amount. The saving insight is that any single-qubit error is a combination of just three Pauli operations, so correcting bit-flips and phase-flips corrects everything.
The three basic errors
- Bit-flip (X): swaps |0> and |1>, the quantum analogue of a classical flip
- Phase-flip (Z): flips the sign of |1>, with no classical counterpart
- Combined (Y = iXZ): both a bit-flip and a phase-flip
The phase-flip has no classical equivalent and is the genuinely new failure mode. It corrupts the relative phase that quantum algorithms depend on, even when computational-basis probabilities look unchanged.
Digitising continuous errors
A general small error is I plus a bit of X plus a bit of Z plus a bit of Y. When the code's syndrome is measured, this superposition of errors collapses onto one discrete Pauli, which can then be corrected. This discretisation of continuous errors is what makes quantum error correction possible at all — you never need to correct a continuum, only a finite set.
Correcting without cloning
The no-cloning theorem forbids simply copying a qubit for backup. Instead, information is spread across many physical qubits in an entangled code (such as the surface code). Errors are detected by measuring parity checks that reveal that an error occurred, and its type, without measuring — and thus destroying — the logical state itself.
The threshold
Error correction helps only if the physical error rate per gate is below a code-dependent threshold. Above it, adding qubits makes things worse; below it, the logical error rate can be driven arbitrarily low. Reaching and beating this threshold in fidelity is the central goal of fault-tolerant hardware.