[Jump to code hierarchy]

Qubit CSS code [1–3]

Alternative Names: Qubit Euclidean code.

Description

An \([[n,k,d]]\) stabilizer code admitting a set of stabilizer generators that are either \(Z\)-type or \(X\)-type Pauli strings. Codes can be defined from two classical codes and/or chain complexes over \(\mathbb{Z}_2\) per the qubit CSS-to-homology correspondence below.

The stabilizer generator matrix is of the form \begin{align} H=\begin{pmatrix}0 & H_{Z}\\ H_{X} & 0 \end{pmatrix}\tag*{$(1)$} \end{align}such that the rows of the two blocks must be orthogonal \begin{align} H_X H_Z^T=0~.\tag*{$(2)$} \end{align}The above condition guarantees that the \(X\)-stabilizer generators, defined in the symplectic representation as rows of \(H_X\), commute with the \(Z\)-stabilizer generators associated with \(H_Z\). A qubit stabilizer code is a qubit CSS code if and only if \(rankH_X + rank H_Z = n-k\) [4; Lemma 7.4].

Encoding is based on two related binary linear codes, an \([n,k_X,\delta_X]\) code \(C_X\) and \([n,k_Z,\delta_Z]\) code \(C_Z\), satisfying \(C_X^\perp \subseteq C_Z\). The resulting CSS code has \(k=k_X+k_Z-n\) logical qubits. The \(H_X\) (\(H_Z\)) block of \(H\) (1) is the parity-check matrix of the code \(C_Z\) (\(C_X\)). The requirement \(C_X^\perp \subseteq C_Z\) guarantees (2) and also implies \(C_Z^\perp \subseteq C_X \). Basis states for the code are, for coset representatives \(\gamma \in C_X/C_Z^\perp\), \begin{align} |\gamma + C_Z^\perp \rangle = \frac{1}{\sqrt{|C_Z^\perp|}} \sum_{\eta \in C_Z^\perp} |\gamma + \eta\rangle.\tag*{$(3)$} \end{align}After a Hadamard transform on every qubit, the same code can be described using superpositions over cosets of \(C_X^\perp\) in \(C_Z\), exchanging the roles of bit-flip and phase-flip protection.

Qubit permutations preserving both \(C_X\) and \(C_Z\) form the permutation automorphism group of a CSS code [5]. A CSS code whose \(X\)- and \(Z\)-type stabilizer spaces are exchanged by a qubit permutation is permutationally self-dual. The code is self-dual when that permutation can be taken to be the identity.

Inequivalent CSS codes up to \(n=14\) qubits have been classified [6].

CSS-to-homology correspondence

Qubit CSS-to-homology correspondence: CSS codes and their properties can be formulated in terms of homology theory, yielding a powerful correspondence between codes and chain complexes, the primary homological structures. There exists a many-to-one mapping from size three chain complexes to CSS codes [7–11] that allows one to extract code properties from topological features of the complexes. Codes constructed in this manner are sometimes called homological CSS codes, but they are equivalent to CSS codes. This mapping of codes to manifolds allows the application of structures from topology to error correction, yielding various QLDPC codes with favorable properties.

A chain complex of size three is given by binary vector spaces \(A_2\), \(A_1\), \(A_0\) and binary matrices \(\partial_{i=1,2}\) (called boundary operators) from \(A_i\) to \(A_{i-1}\) that satisfy \(\partial_1 \partial_2 = 0\). Such a complex is typically denoted as \begin{align} A_2 \xrightarrow{\partial_2} A_1 \xrightarrow{\partial_1} A_0~.\tag*{$(4)$} \end{align}One constructs a CSS code by associating a physical qubit to every basis element of \(A_1\), and defining parity-check matrices \(H_X=\partial_1\) and \(H_Z=\partial_2^T\). That way, the spaces \(A_0\) and \(A_2\) can be associated with \(X\)-type and \(Z\)-type Pauli operators, respectively, and boundary operators determine the Paulis making up the stabilizer generators. The requirement \(\partial_1 \partial_2 = 0\) guarantees that the \(X\)-stabilizer generators associated with \(H_X\) commute with the \(Z\)-stabilizer generators associated with \(H_Z\). The number of encoded logical qubits is equal to the dimension of the first \(\mathbb{Z}_2\)-homology of the chain complex, \(H_1(\partial, \mathbb{Z}_2) = \frac{Ker(\partial_1)}{Im(\partial_2)}\). See [12; Table 3.2] for a Rosetta stone comparing statistical mechanical models, CSS codes, and chain complexes.

Usually, the chain complex (4) used in the construction comes from the chain complex associated with a cellulation of a manifold. When the manifold is a two-dimensional surface, its entire chain is used. Higher-dimensional manifolds allow for longer chain complexes, and one can use the three largest non-trivial vector spaces in its chain.

CSS codes saturate a type of error correction uncertainty relation [2; Thm. 3], which is a special case of an entropic uncertainty relation between a pair of bases [13–15]. The code state \(\sum_{c\in C_{Z}}|c\rangle\) can be expressed in terms of either basis states labeled by the code \(C_{Z}\) or its dual, satisfying, with equality, the relation \begin{align} |C_{Z}||C_{Z}^{\perp}| \geq 2^{n}\,.\tag*{$(5)$} \end{align}

Protection

The quantity \(\min\{\delta_X,\delta_Z\}\) is the CSS code’s pure distance [16], and it is equal to the code distance for a non-degenerate code. To find the code distance of a degenerate CSS code, we have to first remove the codewords of the smaller codes as those codewords correspond to stabilizer generators instead of logical operators. The general formulae are \begin{align} d_{X}&=\min\{ w_H(c) | c \in C_X \setminus C_Z^\perp \} \geq \delta_X \tag*{$(6)$}\\ d_{Z}&=\min\{ w_H(c) | c \in C_Z \setminus C_X^\perp \} \geq \delta_Z \tag*{$(7)$}\\ d&=\min\{d_X,d_Z\}~,\tag*{$(8)$} \end{align}where \(w_H\) is the Hamming weight of a codeword. In the homology correspondence, the code distance is equal to the minimum of the combinatorial (\(D-1\))-systole of the cellulated \(D\)-dimensional manifold and its dual.

A CSS code has stabilizer weight \(w\) if the highest weight of any stabilizer generator is \(w\), i.e., any row of \(H_X\) and \(H_Z\) has weight at most \(w\). Strong CSS codes are codes for which there exists a set of \(X\) and \(Z\) stabilizer generators of equal weight. In the context of comparing weight as well as of determining distances for noise models biased toward \(X\)- or \(Z\)-type errors, an extended notation for asymmetric qubit CSS codes is \([[n,k,(d_X,d_Z),w]]\) or \([[n,k,d_X/d_Z,w]]\).

Steane enlargement: An \([[n,2k-n,d]]\) CSS code can be converted to a \([[n,k+k^{\prime}−n,\min(d,\left\lceil 3d^{\prime}/2\right\rceil )]]\) code for particular \(k^{\prime}\) and \(d^{\prime}\) via the Steane enlargement construction [17,18].

Rate

For a channel in which \(X\) and \(Z\) errors occur independently, each with probability \(p\), CSS codes allowing for arbitrarily accurate recovery exist with asymptotic rate \(1-2h(p)\), where \(h\) is the binary entropy function [19,20].

Encoding

Steane Latin-rectangle encoder [21,22].Stabilizer measurement [23].Clusterization, i.e., measurement of a particular cluster state [24].Entanglement purification [25].Reinforcement-learning discovery of logical-state-preparation circuits [26].There is a correspondence between qubit CSS codes and phase-free ZX calculus diagrams [27]. ZX calculus provides a canonical form for the encoding circuit [28].Automated fault-tolerant encoding circuit synthesis [29].

Transversal and Permutation-Based Gates

Transversal CNOT gates preserve the logical subspace, up to \(X\)-type Paulis, iff a qubit stabilizer code is CSS [30,31]. The Paulis are necessary for when the code is stabilized by stabilizers with a minus in front of them, e.g., \(-XXXX\) and \(ZZZZ\).Fold-transversal [32–34] Clifford gates are transversal gates combined with qubit permutations. Some of these can be obtained from automorphism groups of the underlying classical codes [5; Thms. 2-3].Necessary and sufficient conditions for diagonal physical gates on a CSS code to induce logical gates in the Clifford hierarchy have been formulated [37][35; Thm. 9][36; Thm. 5]. There are routines that can determine what diagonal gates in the Clifford hierarchy are realized by a code [38,39].CSS code families with asymptotic rate \(> 1/3\) and distance \(\geq 3\) do not admit logical qubit permutations from physical permutations [40].Transversal Clifford gates that apply the same \(\ell\)-qubit Clifford gate at every qubit position of \(\ell\) codeblocks of a CSS code form \(GL(\ell,2)\) for non-self-dual CSS codes, \(U(\ell,R_8)\) for semi-self-dual CSS codes (i.e., CSS codes whose \(X\)-type stabilizers are contained in the \(Z\)-type stabilizers), and \(Sp(2\ell,2)\) for self-dual CSS codes [41].Diagonal transversal gate groups can be defined using a set of equations [42].Qubit permutations realize only logical CX circuits, forming a subgroup of \(\mathrm{GL}(k,2)\) [43]. They never realize a logical \(S\), CZ, or Hadamard gate [43].Transversal single-qubit Clifford gates on an indecomposable CSS code never realize a logical CX or SWAP gate [43]. Such a code with \(k>1\) admits no addressable logical \(H\), \(SH\), or \(HS\) gate from single-qubit Clifford gates and qubit permutations in a CSS logical basis [43].A product of single-qubit diagonal gates with a qubit permutation is a logical gate only if the diagonal part and the permutation are each logical gates [43].

Gates

Generalized lattice surgery [44].Cohomology invariants give rise to logical gates implemented by constant-depth Clifford circuits for codes admitting a cup product structure [45–48]. For example, a diagonal copy-cup gate in the \(m\)th level of the Clifford hierarchy can be implemented on a code admitting an \(m\)-fold cup product [47].Fault-tolerant CNOT gate using generalized lattice surgery [49].

Decoding

CSS syndrome decoding splits into two classical decoding problems: measuring the \(Z\)-type stabilizers yields the classical syndrome for bit-flip errors with respect to \(C_X\), while measuring the \(X\)-type stabilizers yields the classical syndrome for phase errors with respect to \(C_Z\). In the Hadamard basis, phase-error decoding is ordinary classical syndrome decoding.Coherent decoders allow for measurement-free error correction [50]. One method is table/multi-control decoding [51], which scales exponentially with the number of ancillas used in syndrome measurement. A fault-tolerant measurement-free scheme for low-distance CSS codes is formulated in Ref. [52]. Another method, the Ising-based decoder, utilizes the mapping of the effect of the noise to a statistical mechanical model [19,53] such that the decoding problem maps to preparation of the ground state of an Ising model. See [12; Table 3.2] for a Rosetta stone comparing statistical mechanical models, CSS codes, and chain complexes. Models for bit- and phase-flip noise can be dual to one another [54].Transformer-based decoder [55].MaxSAT decoder [56].

Fault Tolerance

Steane error correction [57], where fault-tolerance is ensured by preparing ancillary encoded states and extracting syndromes via \(CNOT\) gates.Encoded \(\ket{0}\) and \(\ket{+}\) ancillas for Steane error correction can be prepared by hierarchical Steane-style verification; without code-specific optimizations, a two-level procedure uses at least \((t+1)^2\) noisy ancillas for a distance-\(2t+1\) CSS code [31; Secs. 13.1.2-13.1.3].Steane’s method also yields non-destructive logical Pauli measurement for CSS codes by coupling the data block transversally to encoded \(\ket{0}\) or \(\ket{+}\) ancillas and classically decoding the ancilla measurement results [31].Transversal computational-basis measurement followed by classical decoding is a fault-tolerant gadget for logical measurement of all encoded qubits [31; Sec. 11.4].Fault-tolerant error correction and logical measurements using flag qubits for distance-three cyclic CSS codes [58]. Parallel syndrome extraction for distance-three codes can be done fault-tolerantly using one flag qubit [59]. Distance-preserving flag fault-tolerant error correction can be done using lookup tables for small codes [60].Homomorphic gadgets for fault-tolerant measurement unify Steane and Shor error correction [61].A fault-tolerant error-correction protocol using \(O(d\log d)\) syndrome measurements can be applied to any CSS code with distance \(d \geq \Omega(n^{\alpha})\) for any \(\alpha > 0\) [62].Fault-tolerant measurement-free scheme for low-distance CSS codes [52].Automated fault-tolerant encoding circuit synthesis [29].Fault-tolerant homological measurement of logical Pauli operators [63].Fault-tolerant CNOT gate using generalized lattice surgery [49].Flag-at-origin fault-tolerant preparation of any CSS state, i.e., a stabilizer state whose stabilizer generators are each \(X\)-type or \(Z\)-type [64]. Such a state is prepared by a bipartite CNOT circuit whose controls start in \(\ket{+}\) and whose targets start in \(\ket{0}\) [64; Appx. A]. In this circuit, \(X\) errors propagate only from controls to targets, and \(Z\) errors only from targets to controls. Appending \(X\)-detecting flag gadgets to controls and \(Z\)-detecting flag gadgets to targets, and restarting whenever a flag fires, makes the preparation tolerate up to \(\lfloor d/2 \rfloor\) faults [64]. Each gadget depends only on \(d\) and on the number of CNOT gates acting on its qubit [64].

Code Capacity Threshold

Bounds on code capacity thresholds for various noise models exist in terms of stabilizer generator weights [65,66].Consider a CSS code family with bounded check weights and asymptotic rate \(R\), in which \(\max(d_X,d_Z)\) strictly increases. Its decodable region is the set of error probabilities \(p\) and decoder temperatures \(T=1/K\) at which decoding succeeds with probability approaching one as the family grows. A temperature off the Nishimori line corresponds to a decoder that assumes an incorrect error probability. For \(X\) and \(Z\) errors of equal probability, the coupling \(K_{\max}=1/T_{\max}\) at the upper temperature boundary of this region satisfies \(K_{\max} - K_{\max}^{*} \geq R \ln 2\) [67; Thm. 3]. Here, the Kramers-Wannier dual coupling \(K^{*}\) is defined by \(\tanh K^{*} = e^{-2K}\). At zero rate, this bound is the self-dual point [67].

Realizations

Fully homomorphic encryption [68].Cryptographic applications stemming from the monogamy of entanglement of CSS code and error words [69].

Notes

See Refs. [18,31,70–72] for simple examples of CSS codes.Introduction to Qubit CSS-to-homology correspondence by M. Hastings; see also Refs. [12,73,74].Entanglement purification protocols with qubit CSS codes are related to quantum key distribution (QKD) [75].Qubit CSS codes can be used in quantum repeaters [76].A database of randomly generated CSS codes with estimated \([[n,k,d]]\) parameters for \(n\) up to \(30\), maintained by W. Zeng at this repository.

Cousins

  • Qubit stabilizer code— Qubit CSS codes are qubit stabilizer codes whose stabilizer groups admit a generating set of pure-\(X\) and pure-\(Z\) Pauli strings. Transversal CNOT gates preserve the logical subspace iff a qubit stabilizer code is CSS [30,31]. Any \([[n,k,d]]\) stabilizer code can be mapped onto a \([[2n,2k,d^{\prime}]]\) two-block CSS code with \(d\leq d^{\prime}\leq 2d\) via symplectic doubling, which preserves geometric locality of a code up to a constant factor. For any non-CSS qubit stabilizer code \(\mathsf{C}\), there exists a CSS code \(\mathsf{C}^{\prime}\) such that \(\mathsf{C} = DQ\mathsf{C}^{\prime}\), where \(D\) is a diagonal Clifford operator, and where \(Q\) is an element of an XP stabilizer group [39; Prop. B.3.1]. There is a holographic relation between qubit CSS codes describing CFTs and qubit stabilizer codes describing path integrals over certain topologies [77].
  • Movassagh-Ouyang Hamiltonian code— Qubit CSS codes encoding one logical qubit are a subset of Movassagh-Ouyang codes.
  • Two-block CSS code— Any \([[n,k,d]]\) stabilizer code can be mapped onto a \([[2n,2k,d^{\prime}]]\) two-block CSS code with \(d\leq d^{\prime}\leq 2d\) via symplectic doubling, which preserves geometric locality of a code up to a constant factor.
  • Linear binary code— The CSS construction uses two related binary linear codes, \(C_X\) and \(C_Z\).
  • Alternant code— Alternant codes used in the CSS construction yield quantum codes that asymptotically achieve the quantum GV bound [78].
  • Random stabilizer code— CSS codes from random weakly self-dual codes \(C\subseteq C^\perp\) attain linear distance at rate \(R\geq 1-2h(d/n)\), where \(h\) is the binary entropy function [1; Sec. 5].
  • Binary quantum Goppa code— Quantum Goppa codes can exceed the quantum GV bound [79].
  • Subsystem qubit stabilizer code— Qubit CSS “seed” codes can be used to produce subsystem qubit stabilizer codes [80].
  • Lattice stabilizer code— The mapping of qubit CSS codes to chain complexes allows the application of structures from topology to error correction. Chain complexes describing some QLDPC codes [81,82], and, more generally, CSS codes [83] can be “lifted” into higher-dimensional manifolds admitting some notion of geometric locality. Qubit CSS codes admit several dualities [84,85]. In particular, a CSS code and two dual classical codes can be organized by the same 2-complex, and gauging [85–94] either classical code yields the same CSS code up to Hadamard [85].
  • Abelian topological code— The mapping of qubit CSS codes to chain complexes allows the application of structures from topology to error correction. Chain complexes describing some QLDPC codes [81,82], and, more generally, CSS codes [83] can be “lifted” into higher-dimensional manifolds admitting some notion of geometric locality. Qubit CSS codes admit several dualities [84,85]. In particular, a CSS code and two dual classical codes can be organized by the same 2-complex, and gauging [85–94] either classical code yields the same CSS code up to Hadamard [85].
  • Conformal-field theory (CFT) code— There is a holographic relation between qubit CSS codes describing CFTs and qubit stabilizer codes describing path integrals over certain topologies [77].
  • Cycle code— Cycle codes, including the Petersen cycle and Hoffman-Singleton cycle codes, feature in magic-state distillation protocols [95; Appx. A.2.1][96; Sec. VII.A].
  • Coxeter code— Coxeter codes can be used to make qubit CSS codes [97].
  • Amplitude-damping (AD) code— An \([[n,k,d_Z=t+1,d_X=2t+1]]\) qubit CSS code protects against \(t\) AD errors [99][98; Sec. 8.7].
  • Concatenated cat code— Stabilizers of CSS codes concatenated with two-component cat codes in their coherent-state basis come directly from the CSS codes via the mapping \(X \to (-1)^{\hat n}\) and \(Z \to \hat a\) [100]. Stabilizers of CSS codes concatenated with two-component cat codes in their cat-state basis come directly from the CSS codes via the mapping \(Z \to (-1)^{\hat n}\) and \(X \to \hat a\). In both cases, one type of noise is handled actively via syndrome extraction and correction, while the other type is handled passively via stabilizing dissipation.
  • Error-corrected sensing code— Qubit CSS codes can be used for sensing whenever the HNLS condition is satisfied, with the quantum Fisher information related to the number of weight-two codewords of the dual code [101].
  • Constant-excitation (CE) code— Qubit CE codes are protected from coherent noise in the form of transversal \(Z\)-rotations because such rotations act identically on all codewords [102,103]. In the case of qubit CSS codes, all codes oblivious to such rotations are CE codes [102,103]. Any \([[n,k,d]]\) CSS code can be made into an \([[mn,k,\geq d]]\) CE code [102]. Concatenating the dual-rail code with an inner \([[n,k,d]]\) qubit stabilizer code yields a degenerate \([[2n,k,d]]\) constant-excitation stabilizer code that avoids coherent phase errors and is equivalent to a Pauli-rotated repetition-concatenated stabilizer code [104]. CSS structure is preserved when the original code is CSS [105].
  • Quantum locally testable code (QLTC)— If a qubit CSS code defined by \(H_{Z}\) and \(H_{X}\) is locally testable with soundness \(\rho\), then the constituent codes \(\ker H_{Z}\) and \(\ker H_{X}\) are locally testable with soundness at least \(\rho/2\). Conversely, constituent codes with soundness \(\rho\) yield a CSS code with soundness \(\rho\) [106; Fact 17].
  • EA qubit stabilizer code— As opposed to CSS codes, EA qubit stabilizer codes can be constructed from any linear binary code.
  • Quantum polar code— Quantum polar codes are CSS codes used in an entanglement generation scheme that generally requires entanglement assistance. They require assistance only to determine positions to store information which optimally protect against both bit and phase noise. Without this assistance, they are just CSS codes constructed out of polar codes. A variant of quantum polar codes exists that does not require entanglement assistance [107].
  • Majorana stabilizer code— Every \([[n,k,d]]_f\) Majorana stabilizer code is associated with a \([[2n,2k,d]]\) qubit CSS code whose \(X\)- and \(Z\)-check supports coincide [108; Lemma 2]. This map assigns one qubit to each Majorana mode and is the Majorana form of symplectic doubling. An odd-length self-dual CSS code can be converted into a complex-fermion code by replacing qubit \(Z\)-type and \(X\)-type operators with \(\gamma\)-type and \(\tilde{\gamma}\)-type Majorana operators, respectively [109].
  • XP stabilizer code— Each XP-regular code can be mapped to a CSS code with the same diagonal logical operators and similar non-diagonal logical operators [110].
  • Union stabilizer (USt) code— An \([[n,2k-n,d]]\) CSS code can be converted to a \([[n,k+k^{\prime}−n,\min(d,\left\lceil 3d^{\prime}/2\right\rceil )]]\) code for particular \(k^{\prime}\) and \(d^{\prime}\) via Steane enlargement. This code can be treated as a union stabilizer code [111].
  • Hermitian qubit code— A Hermitian qubit code that can be put into CSS form via single-qubit Clifford operations remains Hermitian [4].
  • Cluster-state code— A resource cluster state can be constructed out of any qubit CSS code via foliation. Conversely, CSS codes can be constructed out of cluster states [24]. In the fault-complex formalism, foliation of a CSS code is expressed as a homological product of the code’s chain complex with a repetition-code complex [112].
  • Qubit BCH code— Some qubit BCH codes are CSS.
  • Subsystem qubit CSS code— Subsystem qubit CSS codes reduce to (subspace) CSS qubit codes when there is no gauge subsystem.

Primary Hierarchy

Parents
CSS codes are a subset of CPC codes [113], with the latter not requiring the two classical codes to be related.
Modular-qudit CSS codes for \(q=2\) are qubit CSS codes.
Galois-qudit CSS codes for \(q=2\) are qubit CSS codes.
Qubit CSS code
Children
A mapping cone code is a qubit CSS code equipped with a direct-sum decomposition of its chain complex into levels, with lower-triangular boundary operator, such that the associated embedded code has naturally isomorphic logical operators.
Permutationally self-dual CSS codes are qubit CSS codes whose stabilizer group is preserved by transversal Hadamard composed with a qubit permutation.
Generalized quantum divisible codes are CSS codes. Any self-dual CSS code of odd distance yields a level-three generalized quantum divisible code when level-lifted [114; Thm. V.6].
Weakly divisible CSS codes are CSS codes whose \(X\)-type stabilizer spaces satisfy a signed divisibility condition [115; Def. I.5].
Multiplicative-coset conditions make the two binary stabilizer generator matrices orthogonal, so they define a qubit CSS code [116].

References

  1. [1]

    A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist”, Physical Review A 54, 1098 (1996) arXiv:quant-ph/9512032 DOI

  2. [2]

    A. M. Steane, “Error Correcting Codes in Quantum Theory”, Physical Review Letters 77, 793 (1996) DOI

  3. [3]

    “Multiple-particle interference and quantum error correction”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452, 2551 (1996) arXiv:quant-ph/9601029 DOI

  4. [4]

    A. Cross and D. Vandeth, “Small Binary Stabilizer Subsystem Codes”, (2025) arXiv:2501.17447

  5. [5]

    M. Grassl and M. Roetteler, “Leveraging automorphisms of quantum codes for fault-tolerant quantum computation”, 2013 IEEE International Symposium on Information Theory 534 (2013) arXiv:1302.1035 DOI

  6. [6]

    J. M. Koh, A. Gong, A. C. Diaconu, D. B. Tan, A. A. Geim, M. J. Gullans, N. Y. Yao, M. D. Lukin, and S. Majidy, “Entangling logical qubits without physical operations”, (2026) arXiv:2601.20927

  7. [7]

    A. Y. Kitaev, “Quantum computations: algorithms and error correction”, Russian Mathematical Surveys 52, 1191 (1997) DOI

  8. [8]

    H. Bombin and M. A. Martin-Delgado, “Homological error correction: Classical and quantum codes”, Journal of Mathematical Physics 48, (2007) arXiv:quant-ph/0605094 DOI

  9. [9]

    S. Bravyi and M. B. Hastings, “Homological Product Codes”, (2013) arXiv:1311.0885

  10. [10]

    N. P. Breuckmann, “PhD thesis: Homological Quantum Codes Beyond the Toric Code”, (2018) arXiv:1802.01520

  11. [11]

    X. Zou and H.-K. Lo, “Algebraic Topology Principles behind Topological Quantum Error Correction”, (2026) arXiv:2505.06082

  12. [12]

    K. Fujii, “Quantum Computation with Topological Codes: from qubit to topological fault-tolerance”, (2015) arXiv:1504.01444

  13. [13]

    I. Białynicki-Birula and J. Mycielski, “Uncertainty relations for information entropy in wave mechanics”, Communications in Mathematical Physics 44, 129 (1975) DOI

  14. [14]

    D. Deutsch, “Uncertainty in Quantum Measurements”, Physical Review Letters 50, 631 (1983) DOI

  15. [15]

    H. Maassen and J. B. M. Uffink, “Generalized entropic uncertainty relations”, Physical Review Letters 60, 1103 (1988) DOI

  16. [16]

    D. Ostrev, D. Orsucci, F. Lázaro, and B. Matuz, “Classical product code constructions for quantum Calderbank-Shor-Steane codes”, Quantum 8, 1420 (2024) arXiv:2209.13474 DOI

  17. [17]

    A. M. Steane, “Enlargement of Calderbank Shor Steane quantum codes”, (1998) arXiv:quant-ph/9802061

  18. [18]

    M. F. Ezerman, “Quantum Error-Control Codes”, Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 657-672 DOI

  19. [19]

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI

  20. [20]

    D. Maurice, J.-P. Tillich, and I. Andriyanova, “A family of quantum codes with performances close to the hashing bound under iterative decoding”, 2013 IEEE International Symposium on Information Theory 907 (2013) DOI

  21. [21]

    A. M. Steane, “Fast fault-tolerant filtering of quantum codewords”, (2004) arXiv:quant-ph/0202036

  22. [22]

    A. Paetznick, “Resource optimization for fault-tolerant quantum computing”, (2014) arXiv:1410.5124

  23. [23]

    J. Łodyga, P. Mazurek, A. Grudka, and M. Horodecki, “Simple scheme for encoding and decoding a qubit in unknown state for various topological codes”, Scientific Reports 5, (2015) arXiv:1404.2495 DOI

  24. [24]

    A. Bolt, G. Duclos-Cianci, D. Poulin, and T. M. Stace, “Foliated Quantum Error-Correcting Codes”, Physical Review Letters 117, (2016) arXiv:1607.02579 DOI

  25. [25]

    W. Dür and H.-J. Briegel, “Entanglement Purification for Quantum Computation”, Physical Review Letters 90, (2003) arXiv:quant-ph/0210069 DOI

  26. [26]

    R. Zen, J. Olle, L. Colmenarez, M. Puviani, M. Müller, and F. Marquardt, “Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning”, Physical Review X 15, (2025) arXiv:2402.17761 DOI

  27. [27]

    A. Kissinger, “Phase-free ZX diagrams are CSS codes (…or how to graphically grok the surface code)”, (2022) arXiv:2204.14038

  28. [28]

    A. B. Khesin and A. Li, “Equivalence Classes of Quantum Error-Correcting Codes”, (2024) arXiv:2406.12083

  29. [29]

    T. Peham, L. Schmid, L. Berent, M. Müller, and R. Wille, “Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes”, PRX Quantum 6, (2025) arXiv:2408.11894 DOI

  30. [30]

    P. W. Shor, “Fault-tolerant quantum computation”, (1997) arXiv:quant-ph/9605011

  31. [31]

    D. Gottesman, Surviving as a Quantum Computer in a Classical World (2024) URL

  32. [32]

    A. Kubica, B. Yoshida, and F. Pastawski, “Unfolding the color code”, New Journal of Physics 17, 083026 (2015) arXiv:1503.02065 DOI

  33. [33]

    J. E. Moussa, “Transversal Clifford gates on folded surface codes”, Physical Review A 94, (2016) arXiv:1603.02286 DOI

  34. [34]

    N. P. Breuckmann and S. Burton, “Fold-Transversal Clifford Gates for Quantum Codes”, Quantum 8, 1372 (2024) arXiv:2202.06647 DOI

  35. [35]

    J. Hu, Q. Liang, and R. Calderbank, “Designing the Quantum Channels Induced by Diagonal Gates”, Quantum 6, 802 (2022) arXiv:2109.13481 DOI

  36. [36]

    J. Hu, Q. Liang, and R. Calderbank, “Divisible Codes for Quantum Computation”, (2022) arXiv:2204.13176

  37. [37]

    E. Camps-Moreno, H. H. López, G. L. Matthews, and E. McMillon, “Toward Quantum CSS-T Codes from Sparse Matrices”, (2024) arXiv:2406.00425

  38. [38]

    M. A. Webster, A. O. Quintavalle, and S. D. Bartlett, “Transversal diagonal logical operators for stabiliser codes”, New Journal of Physics 25, 103018 (2023) arXiv:2303.15615 DOI

  39. [39]

    M. Webster, “The XP Stabilizer Formalism”, PhD thesis, University of Sydney, 2023.

  40. [40]

    J. Guyot and S. Jaques, “On the Addressability Problem on CSS Codes”, Quantum 10, 2145 (2026) arXiv:2502.13889 DOI

  41. [41]

    S. Dasu and S. Burton, “A Classification of Transversal Clifford Gates for Qubit Stabilizer Codes”, (2025) arXiv:2507.10519

  42. [42]

    E. Camps-Moreno, H. H. López, G. L. Matthews, N. Rengaswamy, and R. San-José, “Transversal gates for quantum CSS codes”, (2026) arXiv:2601.21514

  43. [43]

    J. M. Koh, S. Majidy, A. Chakraborty, A. Gong, S. J. S. Tan, and N. Y. Yao, “Achieving the limits of automorphism gates”, (2026) arXiv:2609.19250

  44. [44]

    A. Cowtan and S. Burton, “CSS code surgery as a universal construction”, Quantum 8, 1344 (2024) arXiv:2301.13738 DOI

  45. [45]

    G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown, “Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries”, PRX Quantum 6, (2025) arXiv:2310.16982 DOI

  46. [46]

    T.-C. Lin, “Transversal non-Clifford gates for quantum LDPC codes on sheaves”, (2024) arXiv:2410.14631

  47. [47]

    N. P. Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn, “Cups and Gates I: Cohomology Invariants and Logical Quantum Operations”, Communications in Mathematical Physics 407, (2026) arXiv:2410.16250 DOI

  48. [48]

    P.-S. Hsin, R. Kobayashi, and G. Zhu, “Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry”, (2025) arXiv:2411.15848

  49. [49]

    C. Poirson, J. Roffe, and R. I. Booth, “Engineering CSS surgery: compiling any CNOT in any code”, (2025) arXiv:2505.01370

  50. [50]

    T. Inada, W. Jang, Y. Iiyama, K. Terashi, R. Sawada, J. Tanaka, and S. Asai, “Measurement-Free Ultrafast Quantum Error Correction by Using Multi-Controlled Gates in Higher-Dimensional State Space”, (2021) arXiv:2109.00086

  51. [51]

    G. A. Paz-Silva, G. K. Brennen, and J. Twamley, “Fault Tolerance with Noisy and Slow Measurements and Preparation”, Physical Review Letters 105, (2010) arXiv:1002.1536 DOI

  52. [52]

    S. Heußen, D. F. Locher, and M. Müller, “Measurement-Free Fault-Tolerant Quantum Error Correction in Near-Term Devices”, PRX Quantum 5, (2024) arXiv:2307.13296 DOI

  53. [53]

    A. T. Schmitz, “Thermal Stability of Dynamical Phase Transitions in Higher Dimensional Stabilizer Codes”, (2020) arXiv:2002.11733

  54. [54]

    K. Su, Z. Yang, and C.-M. Jian, “Tapestry of dualities in decohered quantum error correction codes”, Physical Review B 110, (2024) arXiv:2401.17359 DOI

  55. [55]

    Y. Choukroun and L. Wolf, “Deep Quantum Error Correction”, (2023) arXiv:2301.11930

  56. [56]

    M. Noormandipour and T. Haug, “MaxSAT decoders for arbitrary CSS codes”, (2024) arXiv:2410.01673

  57. [57]

    A. M. Steane, “Active Stabilization, Quantum Computation, and Quantum State Synthesis”, Physical Review Letters 78, 2252 (1997) arXiv:quant-ph/9611027 DOI

  58. [58]

    T. Tansuwannont, C. Chamberland, and D. Leung, “Flag fault-tolerant error correction, measurement, and quantum computation for cyclic Calderbank-Shor-Steane codes”, Physical Review A 101, (2020) arXiv:1803.09758 DOI

  59. [59]

    P.-H. Liou and C.-Y. Lai, “Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three”, Physical Review A 107, (2023) arXiv:2208.00581 DOI

  60. [60]

    B. Pato, T. Tansuwannont, S. Huang, and K. R. Brown, “Optimization Tools for Distance-Preserving Flag Fault-Tolerant Error Correction”, PRX Quantum 5, (2024) arXiv:2306.12862 DOI

  61. [61]

    S. Huang, T. Jochym-O’Connor, and T. J. Yoder, “Homomorphic Logical Measurements”, (2022) arXiv:2211.03625

  62. [62]

    N. Delfosse, B. W. Reichardt, and K. M. Svore, “Beyond Single-Shot Fault-Tolerant Quantum Error Correction”, IEEE Transactions on Information Theory 68, 287 (2022) arXiv:2002.05180 DOI

  63. [63]

    B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, “Fault-Tolerant Logical Measurements via Homological Measurement”, Physical Review X 15, (2025) arXiv:2410.02753 DOI

  64. [64]

    D. Forlivesi and D. Amaro, “Flag at origin: a modular fault-tolerant preparation for CSS codes”, (2026) arXiv:2508.14200

  65. [65]

    A. A. Kovalev and L. P. Pryadko, “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling”, Physical Review A 87, (2013) arXiv:1208.2317 DOI

  66. [66]

    I. Dumer, A. A. Kovalev, and L. P. Pryadko, “Thresholds for Correcting Errors, Erasures, and Faulty Syndrome Measurements in Degenerate Quantum Codes”, Physical Review Letters 115, (2015) arXiv:1412.6172 DOI

  67. [67]

    A. A. Kovalev, S. Prabhakar, I. Dumer, and L. P. Pryadko, “Numerical and analytical bounds on threshold error rates for hypergraph-product codes”, Physical Review A 97, (2018) arXiv:1804.01950 DOI

  68. [68]

    G. Alagic, Y. Dulek, C. Schaffner, and F. Speelman, “Quantum Fully Homomorphic Encryption with Verification”, Lecture Notes in Computer Science 438 (2017) arXiv:1708.09156 DOI

  69. [69]

    A. Coladangelo, J. Liu, Q. Liu, and M. Zhandry, “Hidden Cosets and Applications to Unclonable Cryptography”, (2022) arXiv:2107.05692

  70. [70]

    A. M. Steane, “Simple quantum error-correcting codes”, Physical Review A 54, 4741 (1996) arXiv:quant-ph/9605021 DOI

  71. [71]

    M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2012) DOI

  72. [72]

    J. Preskill, Lecture notes on Quantum Computation (1997–2020) URL

  73. [73]

    M. Leslie, “Hypermap-Homology Quantum Codes (Ph.D. thesis)”, (2013) arXiv:1310.5376

  74. [74]

    D. Browne, “Topological Codes and Computation: a lecture course given at the University of Innsbruck”, (2014) URL

  75. [75]

    P. W. Shor and J. Preskill, “Simple Proof of Security of the BB84 Quantum Key Distribution Protocol”, Physical Review Letters 85, 441 (2000) arXiv:quant-ph/0003004 DOI

  76. [76]

    L. Jiang, J. M. Taylor, K. Nemoto, W. J. Munro, R. Van Meter, and M. D. Lukin, “Quantum repeater with encoding”, Physical Review A 79, (2009) arXiv:0809.3629 DOI

  77. [77]

    A. Dymarsky, J. Henriksson, and B. McPeak, “Holographic duality from Howe duality: Chern-Simons gravity as an ensemble of code CFTs”, (2025) arXiv:2504.08724

  78. [78]

    J. Fan, J. Li, Y. Wang, Y. Li, M.-H. Hsieh, and J. Du, “Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically”, IEEE Transactions on Information Theory 69, 262 (2023) DOI

  79. [79]

    A. Niehage, “Nonbinary Quantum Goppa Codes Exceeding the Quantum Gilbert-Varshamov Bound”, Quantum Information Processing 6, 143 (2006) DOI

  80. [80]

    O. Novak and N. Rengaswamy, “GNarsil: Splitting Stabilizers into Gauges”, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 109 (2024) arXiv:2404.18302 DOI

  81. [81]

    M. Freedman and M. B. Hastings, “Building manifolds from quantum codes”, (2021) arXiv:2012.02249

  82. [82]

    T.-C. Lin, A. Wills, and M.-H. Hsieh, “Geometrically Local Quantum and Classical Codes from Subdivision”, (2024) arXiv:2309.16104

  83. [83]

    V. Guemard, “Lifts of quantum CSS codes”, (2024) arXiv:2404.16736

  84. [84]

    M. H. Zarei, “Strong-weak coupling duality between two perturbed quantum many-body systems: Calderbank-Shor-Steane codes and Ising-like systems”, Physical Review B 96, (2017) arXiv:1710.02646 DOI

  85. [85]

    T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes I. Gauging and dualities”, (2023) arXiv:2310.16032

  86. [86]

    M. Levin and Z.-C. Gu, “Braiding statistics approach to symmetry-protected topological phases”, Physical Review B 86, (2012) arXiv:1202.3120 DOI

  87. [87]

    J. Haegeman, K. Van Acoleyen, N. Schuch, J. I. Cirac, and F. Verstraete, “Gauging Quantum States: From Global to Local Symmetries in Many-Body Systems”, Physical Review X 5, (2015) arXiv:1407.1025 DOI

  88. [88]

    S. Vijay, J. Haah, and L. Fu, “Fracton topological order, generalized lattice gauge theory, and duality”, Physical Review B 94, (2016) arXiv:1603.04442 DOI

  89. [89]

    D. J. Williamson, “Fractal symmetries: Ungauging the cubic code”, Physical Review B 94, (2016) arXiv:1603.05182 DOI

  90. [90]

    L. Bhardwaj, D. Gaiotto, and A. Kapustin, “State sum constructions of spin-TFTs and string net constructions of fermionic phases of matter”, Journal of High Energy Physics 2017, (2017) arXiv:1605.01640 DOI

  91. [91]

    A. Kubica and B. Yoshida, “Ungauging quantum error-correcting codes”, (2018) arXiv:1805.01836

  92. [92]

    W. Shirley, K. Slagle, and X. Chen, “Foliated fracton order from gauging subsystem symmetries”, SciPost Physics 6, (2019) arXiv:1806.08679 DOI

  93. [93]

    K. Dolev, V. Calvera, S. S. Cree, and D. J. Williamson, “Gauging the bulk: generalized gauging maps and holographic codes”, Journal of High Energy Physics 2022, (2022) arXiv:2108.11402 DOI

  94. [94]

    D. J. Williamson and T. J. Yoder, “Low-overhead fault-tolerant quantum computation by gauging logical operators”, Nature Physics 22, 598 (2026) arXiv:2410.02213 DOI

  95. [95]

    J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, “Magic state distillation with low space overhead and optimal asymptotic input count”, Quantum 1, 31 (2017) arXiv:1703.07847 DOI

  96. [96]

    Quantum Information and Computation 18, (2018) arXiv:1709.02789 DOI

  97. [97]

    N. J. Coble and A. Barg, “Coxeter codes: extending the Reed–Muller family”, Designs, Codes and Cryptography 94, (2026) arXiv:2502.14746 DOI

  98. [98]

    D. Gottesman, “Stabilizer Codes and Quantum Error Correction”, (1997) arXiv:quant-ph/9705052

  99. [99]

    R. Duan, M. Grassl, Z. Ji, and B. Zeng, “Multi-error-correcting amplitude damping codes”, 2010 IEEE International Symposium on Information Theory 2672 (2010) arXiv:1001.2356 DOI

  100. [100]

    S. P. Jain, J. T. Iosue, A. Barg, and V. V. Albert, “Quantum spherical codes”, Nature Physics 20, 1300 (2024) arXiv:2302.11593 DOI

  101. [101]

    O. Novak and N. Rengaswamy, “Explaining Robust Quantum Metrology by Counting Codewords”, IEEE Transactions on Quantum Engineering 7, 1 (2026) arXiv:2503.15743 DOI

  102. [102]

    J. Hu, Q. Liang, N. Rengaswamy, and R. Calderbank, “CSS Codes that are Oblivious to Coherent Noise”, 2021 IEEE International Symposium on Information Theory (ISIT) 1481 (2021) DOI

  103. [103]

    J. Hu, Q. Liang, N. Rengaswamy, and R. Calderbank, “Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers”, IEEE Transactions on Information Theory 68, 1795 (2022) arXiv:2011.00197 DOI

  104. [104]

    Y. Ouyang, “Avoiding coherent errors with rotated concatenated stabilizer codes”, npj Quantum Information 7, (2021) arXiv:2010.00538 DOI

  105. [105]

    C.-Y. Lai, P.-H. Liou, and Y. Ouyang, “Fault-Tolerant Quantum Error Correction for Constant-Excitation Stabilizer Codes under Coherent Noise”, (2025) arXiv:2507.10395

  106. [106]

    L. Eldar and A. W. Harrow, “Local Hamiltonians Whose Ground States Are Hard to Approximate”, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) 427 (2017) arXiv:1510.02082 DOI

  107. [107]

    J. M. Renes, D. Sutter, F. Dupuis, and R. Renner, “Efficient Quantum Polar Codes Requiring No Preshared Entanglement”, IEEE Transactions on Information Theory 61, 6395 (2015) arXiv:1307.1136 DOI

  108. [108]

    S. Bravyi, B. M. Terhal, and B. Leemhuis, “Majorana fermion codes”, New Journal of Physics 12, 083039 (2010) arXiv:1004.3791 DOI

  109. [109]

    A. Schuckert, E. Crane, A. V. Gorshkov, M. Hafezi, and M. J. Gullans, “Fault-tolerant fermionic quantum computing”, (2025) arXiv:2411.08955

  110. [110]

    M. A. Webster, B. J. Brown, and S. D. Bartlett, “The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases”, Quantum 6, 815 (2022) arXiv:2203.00103 DOI

  111. [111]

    M. Grassl and M. Rotteler, “Non-additive quantum codes from Goethals and Preparata codes”, 2008 IEEE Information Theory Workshop 396 (2008) arXiv:0801.2144 DOI

  112. [112]

    T. Hillmann, G. Dauphinais, I. Tzitrin, and M. Vasmer, “Single-shot and measurement-based quantum error correction via fault complexes”, Physical Review A 112, (2025) arXiv:2410.12963 DOI

  113. [113]

    N. Chancellor, A. Kissinger, S. Zohren, J. Roffe, and D. Horsman, “Graphical structures for design and verification of quantum error correction”, Quantum Science and Technology 8, 045028 (2023) arXiv:1611.08012 DOI

  114. [114]

    J. Haah, “Towers of generalized divisible quantum codes”, Physical Review A 97, (2018) arXiv:1709.08658 DOI

  115. [115]

    S. P. Jain and V. V. Albert, “Transversal Clifford and T -Gate Codes of Short Length and High Distance”, IEEE Journal on Selected Areas in Information Theory 6, 127 (2025) arXiv:2408.12752 DOI

  116. [116]

    K. Okada and K. Kasai, “A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases”, (2026) arXiv:2605.23894

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: qubit_css

Cite as:
“Qubit CSS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/qubit_css, arXiv:2606.11484
BibTeX:
@incollection{eczoo_qubit_css,
title={Qubit CSS code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/qubit_css}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/qubit_css

Cite as:

“Qubit CSS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/qubit_css, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/stabilizer/qubit_css.yml.