| Five-qubit code | |
|---|---|
| Name | Five-qubit code |
| Other names | BDSW code, Perfect code |
| Type | Quantum error correction |
| Introduced | 1996 |
| Designers | Charles Bennett, David DiVincenzo, John Smolin, William Wootters |
Five-qubit code
The Five-qubit code is the smallest quantum error correction stabilizer code that encodes one logical qubit into five physical qubits and corrects any single-qubit quantum error. It is sometimes called the perfect code or the Bennett–DiVincenzo–Smolin–Wootters code and is central to studies of compact quantum error-correcting codes, fault-tolerant quantum computation, and theoretical limits of quantum information theory.
The Five-qubit code was introduced in seminal work by Charles H. Bennett, David P. DiVincenzo, John A. Smolin, and William K. Wootters in the mid-1990s as an explicit construction saturating the quantum Hamming bound for single-qubit errors. As an error-correcting code with parameters n,k,d = 5,1,3, it achieves minimum distance three with the fewest possible qubits, making it an attractive model for theoreticians studying resource-minimal protection against bit-flip and phase-flip errors. The code informs design choices in quantum computing architectures developed by groups at institutions such as IBM, Google Quantum AI, and academic labs at MIT and Caltech.
The code is naturally expressed in the stabilizer formalism introduced by Daniel Gottesman. Its stabilizer group is generated by four mutually commuting nontrivial Pauli-operator products on five qubits; the common +1 eigenspace of these generators is the two-dimensional subspace encoding one logical qubit. Logical operators X_L and Z_L are represented by weight-five Pauli operators that commute with the stabilizers but anticommute with each other, implementing logical Pauli-X and Pauli-Z on the encoded qubit. Connections to Clifford group operations and CSS code constructions are instructive: while the Five-qubit code is not a CSS code, it sits within the general stabilizer framework and can be manipulated by Clifford gate sequences used in quantum fault tolerance protocols described by researchers such as Peter Shor and Andrew Steane.
Explicit unitary circuits map a single-qubit state and four ancilla qubits into the five-qubit codewords; these circuits use a sequence of CNOTs and single-qubit rotations from the Clifford group. Different decompositions trade off circuit depth and gate count, relevant for noisy intermediate-scale quantum (NISQ) devices like those developed at Rigetti Computing and IonQ. Decoding (syndrome inversion) circuits extract the four-bit syndrome by measuring stabilizer generators using ancilla-assisted syndrome measurement, then apply a corrective Pauli operation conditioned on the classical syndrome. Efficient syndrome extraction schemes leverage ideas from quantum measurement theory and ancilla qubit reuse to minimize gate-induced errors.
Because the code has distance three, it can detect up to two arbitrary single-qubit errors and correct any single-qubit error drawn from the Pauli set {I, X, Y, Z}. The syndrome table maps 15 nontrivial single-qubit Pauli errors to distinct four-bit syndromes, enabling unique correction. The code is "perfect" in the sense that it saturates the quantum Hamming bound for this parameter set. Performance under realistic noise models—such as depolarizing channel, amplitude damping, or correlated noise—has been analyzed in work by E. Knill and others; thresholds derived for concatenated Five-qubit codes inform comparative analyses with other codes like the Steane code and the surface code.
Implementing the Five-qubit code fault-tolerantly requires syndrome extraction and logical gate sets that limit error propagation. Fault-tolerant gadgets for stabilizer measurement can be constructed using verified ancilla preparation and error-detection concatenation. Threshold estimates depend on the noise model and gate set; while the surface code offers higher threshold and locality advantages for two-dimensional architectures studied by groups at Google and Microsoft Quantum, the Five-qubit code remains valuable in theoretical threshold proofs and in concatenated code constructions where compactness reduces overhead. Notable analyses include concatenation schemes formalized in the Aliferis–Gottesman–Preskill framework and threshold calculations by John Preskill's group.
The Five-qubit code has been demonstrated in small-scale experiments on several platforms: trapped ion systems (e.g., groups at University of Innsbruck and NIST), superconducting qubits (research at IBM and academic collaborators), and photonic implementations using linear optics and cluster-state approaches explored by teams at University of Oxford and University of Bristol. Implementations focus on preparing encoded states, performing syndrome extraction, and demonstrating single-error correction or error-detection capabilities. Practical challenges include gate fidelity, crosstalk, and readout errors; nevertheless, the code serves as an important benchmark for multi-qubit control and for prototyping quantum error mitigation and fault-tolerant quantum computing techniques on near-term devices.
Category:Quantum error correction Category:Quantum information theory