A Calderbank–Shor–Steane (CSS) code is a quantum error-correcting code constructed from two classical linear codes that satisfy a containment relation with each other: one classical code corrects bit-flip () errors and the other corrects phase-flip () errors, and the containment condition lets the two be combined without their stabilizer checks interfering. This construction, introduced independently by Calderbank and Shor and by Steane in 1996, turns the well-understood machinery of classical coding theory into a large, tractable family of quantum error-correcting codes — the surface code and most other codes used in current fault-tolerant hardware proposals are CSS codes.
Because a CSS code’s -type and -type stabilizers come from separate classical codes, many operations that would otherwise mix bit-flip and phase-flip protection can be analyzed one type at a time. This structure is also what makes certain logical gates implementable transversally — applying the same physical gate independently to each physical qubit, so a single faulty physical qubit cannot spread an error across the logical qubit. The Eastin–Knill theorem shows that no CSS (or more generally, no quantum) code can support a transversal implementation of every gate needed for universal computation, which is why characterizing exactly which circuits are code-preserving for a given CSS code — beyond the narrower transversal case — remains an active question.
Related papers
- Calderbank and Shor, “Good quantum error-correcting codes exist”, Phys. Rev. A 54, 1098 (1996), and Steane, “Error Correcting Codes in Quantum Theory”, Phys. Rev. Lett. 77, 793 (1996) — the two independent papers that introduced the construction.
- Eastin and Knill, “Restrictions on Transversal Encoded Quantum Gate Sets”, Phys. Rev. Lett. 102, 110502 (2009) — proves no code admits a universal transversal gate set, motivating the broader code-preserving-circuit question.