Stabilizer Codes and Quantum Error Correction
Daniel Gottesman
TL;DR
The work surveys stabilizer codes as the central framework for quantum error correction, detailing the Knill–Laflamme condition, stabilizer/normalizer structure, and multiple code constructions. It develops encoding/decoding networks and fault-tolerant techniques, including transversal gates, measurement-based methods, and concatenation, to enable scalable quantum computation below error thresholds. It also provides bounds (quantum Hamming, GV, MacWilliams, shadow enumerators) and channel-capacity discussions (erasure and depolarizing channels), linking error correction to entanglement purification and channel capacities. The text culminates with extensive code examples (Shor, 5-qubit, CSS, amplitude-damping) and practical insights into fault-tolerant architectures, Toffoli gates, and automorphism-based optimizations, aiming to guide construction of robust quantum computers.
Abstract
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.
