Here is a list of quantum stabilizer codes. For a list of CSS codes, see list of CSS codes.
| Code | Description |
|---|---|
| 2D bosonization code | A mapping between a 2D lattice of qubits and a 2D lattice quadratic Hamiltonian of Majorana modes. This family also includes a super-compact fermionic encoding with a qubit-to-fermion ratio of \(1.25\) [1; Table I]. |
| 2D color code | Color code defined on a two-dimensional planar graph. Each face hosts two stabilizer generators, a Pauli-\(X\) and a Pauli-\(Z\) string acting on all the qubits of the face. |
| 2D hyperbolic surface code | Hyperbolic surface codes based on a tessellation of a closed 2D manifold with a hyperbolic geometry (i.e., non-Euclidean geometry, e.g., saddle surfaces when defined on a 2D plane). |
| 2D lattice stabilizer code | Lattice stabilizer code in two spatial dimensions. |
| 3D bosonization code | A mapping that maps a 3D lattice quadratic Hamiltonian of Majorana modes into a lattice of qubits which realize a \(\mathbb{Z}_2\) gauge theory with a particular Gauss law. |
| 3D color code | Color code defined on a four-valent four-colorable tiling of 3D space. Logical dimension is determined by the genus of the underlying surface (for closed surfaces) and types of boundaries (for open surfaces). |
| 3D fermionic surface code | A non-CSS 3D Kitaev surface code that realizes \(\mathbb{Z}_2\) gauge theory with an emergent fermion, i.e., the fermionic-charge bosonic-loop (FcBl) phase [2]. The model can be defined on a cubic lattice in several ways [3; Eq. (D45-46)]. Realizations on other lattices also exist [4], and the phase of this code also exists in the 3D Kitaev honeycomb model [5]. |
| 3D lattice stabilizer code | Lattice stabilizer code in three spatial dimensions. Qubit codes are conjectured to admit either fracton phases or abelian topological phases that are equivalent to multiple copies of the 3D surface code and/or the 3D fermionic surface code via a local constant-depth Clifford circuit [3]. |
| 3D surface code | A generalization of the Kitaev surface code defined on a 3D lattice. |
| Abelian LP code | An LP code for Abelian group \(G\). The case of \(G\) being a cyclic group is a GB code (a.k.a. a quasi-cyclic LP code) [6; Sec. III.E]. A particular family with \(G=\mathbb{Z}_{\ell}\) yields codes with constant rate and nearly constant distance. |
| Abelian TQD stabilizer code | Modular-qudit stabilizer code whose codewords realize 2D modular gapped Abelian topological order. The corresponding anyon theory is defined by an Abelian group and a Type-III group cocycle that can be decomposed as a product of Type-I and Type-II group cocycles; see [7; Sec. IV.A]. Abelian TQDs realize all modular gapped Abelian topological orders [7]. Many Abelian TQD code Hamiltonians were originally formulated as commuting-projector models [8]. |
| Abelian quantum-double stabilizer code | Modular-qudit stabilizer code whose codewords realize 2D modular gapped Abelian topological order with trivial cocycle. The corresponding anyon theory is defined by an Abelian group. All such codes can be realized by a stack of modular-qudit surface codes because all Abelian groups are Kronecker products of cyclic groups. |
| Analog cluster-state code | A code based on a continuous-variable (CV), or analog, cluster state. Such a state can be used to perform MBQC of logical modes, which substitutes the temporal dimension necessary for decoding a conventional code with a spatial dimension. The exact analog cluster state is non-normalizable, so approximate constructions have to be considered. |
| Analog repetition code | An \([[n,1]]_{\mathbb{R}}\) analog stabilizer version of the quantum repetition code, encoding the position states of one mode into an odd number of \(n\) modes. |
| Analog stabilizer code | An oscillator-into-oscillator stabilizer code encoding \(k\) logical modes into \(n\) physical modes. An \(((n,k,d))_{\mathbb{R}}\) analog stabilizer code is denoted as \([[n,k,d]]_{\mathbb{R}}\), where \(d\) is the code's distance. Any analog stabilizer state can be thought of as a pure Gaussian state that has been infinitely squeezed on all modes [9]. |
| Analog surface code | An analog CSS version of the Kitaev surface code realizing a phase of 2D \(\mathbb{R}\) gauge theory. |
| Approximate secret-sharing code | A family of \( [[n,k,d]]_q \) CSS codes approximately correcting errors on up to \(\lfloor (n-1)/2 \rfloor\) qubits, i.e., with approximate distance approaching the no-cloning bound \(n/2\). Constructed using a non-degenerate CSS code, such as a polynomial quantum code, and a classical authentication scheme. The code can be viewed as an \(t\)-error tolerant secret sharing scheme. Since the code yields a small logical subspace using large registers that contain both classical and quantum information, it is not useful for practical error correction problems, but instead demonstrates the power of approximate quantum error correction. |
| Auxiliary qubit mapping (AQM) code | A concatenation of the JW transformation code with a qubit stabilizer code. |
| BB5 code | A BB code defined by weight-five measurements designed for long chains of trapped ions. Examples include \([[30,4,5]]\) and \([[48,4,7]]\) codes, |
| Balanced product (BP) code | Family of CSS quantum codes based on products of two classical codes which share common symmetries. The balanced product can be understood as taking the usual tensor/hypergraph product and then factoring out the symmetries factored. This reduces the overall number of physical qubits \(n\), while, under certain circumstances, leaving the number of encoded qubits \(k\) and the code distance \(d\) invariant. This leads to a more favourable encoding rate \(k/n\) and normalized distance \(d/n\) compared to the tensor/hypergraph product. |
| Ball color code | A color code defined on a \(D\)-dimensional colex. This family includes hypercube color codes (color codes defined on balls constructed from hyperoctahedra) and 3D ball color codes (color codes defined on duals of certain Archimedean solids). |
| Ball-Verstraete-Cirac (BVC) code | A 2D fermion-into-qubit encoding that builds upon the JW transformation encoding by eliminating the weight-\(O(n)\) \(X\)-type string at the expense introducing additional qubits. See [1; Sec. IV.B] for details. |
| Bicycle code | A CSS code whose stabilizer generator matrix blocks are \(H_{X}=H_{Z}=(A|A^T)\), where \(A\) is a circulant matrix. The fact that \(A\) commutes with its transpose ensures that the CSS condition is satisfied. Bicycle codes are the first QLDPC codes. |
| Bivariate bicycle (BB) code | One of several Abelian 2BGA codes which admit time-optimal syndrome measurement circuits that can be implemented in a two-layer architecture, a generalization of the square-lattice architecture optimal for the surface codes. |
| Bosonic CSS code | Bosonic stabilizer code admitting a set of stabilizer generators that are either position or momentum displacements. |
| Bosonic stabilizer code | Bosonic code whose codespace is defined as the common \(+1\) eigenspace of a group of mutually commuting displacement operators. Displacements form the stabilizers of the code, and have continuous eigenvalues, in contrast with the discrete set of eigenvalues of qubit stabilizers. As a result, exact codewords are non-normalizable, so approximate constructions have to be considered. Stabilizer groups are any locally compact Abelian subgroups of \(\mathbb{R}^n\), can themselves contain discrete or continuous subgroups, and can admit logical qudit and/or oscillator logical subspaces. |
| Bosonization code | A mapping that maps a \(D\)-dimensional lattice quadratic Hamiltonian of Majorana modes into a lattice of qubits. The resulting qubit code can realize various topological phases, depending on the initial Majorana-mode Hamiltonian and its symmetries. |
| Branching MERA code | Qubit stabilizer code whose encoding circuit corresponds to a branching MERA tensor network [10]. |
| Bravyi-Kitaev superfast (BKSF) code | An single error-detecting fermion-into-qubit encoding defined on 2D qubit lattice whose stabilizers are associated with loops in the lattice. The code can be generalized to a single error-correcting code (i.e., with distance three) on graphs of degree \(\geq 6\) [11]. |
| Bravyi-Kitaev transformation (BKT) code | A fermion-into-qubit encoding that maps Majorana operators into Pauli strings of weight \(\lceil \log (n+1) \rceil\). The code can be reformulated in terms of Fenwick trees [12], and the Pauli-string weight can be further optimized to yield the segmented Bravyi-Kitaev (SBK) transformation code [13] (see also Ref. [14]). |
| Brown-Fawzi Clifford-circuit code | An \([[n,k]]\) stabilizer code whose encoder is a random Clifford circuit of depth of order \(O(\log^3 n)\). |
| CSS-T code | A CSS code for which a physical transversal \(T\) gate is either the identity (up to a global phase) or a logical gate. CSS-T codes are constructed from a pair of linear binary codes via the CSS construction, with the pair satisfying certain conditions [15]. |
| Calderbank-Shor-Steane (CSS) stabilizer code | A stabilizer code admitting a set of stabilizer generators that are either \(Z\)-type or \(X\)-type operators. The two sets of stabilizer generators can often, but not always, be related to parts of a chain complex over the appropriate ring or field. |
| Camara-Ollivier-Tillich code | A Hermitian qubit QLDPC code whose stabilizer generator matrix is constructed using two nested subgroups of \(GF(4)^n\). |
| Chamon model code | A foliated type-I fracton non-CSS code defined on a cubic lattice using one weight-eight stabilizer generator acting on the eight vertices of each cube in the lattice [3; Eq. (D38)]. |
| Checkerboard model code | A foliated type-I fracton code defined on a cubic lattice that admits weight-eight \(X\)- and \(Z\)-type stabilizer generators on the eight vertices of each cube in the lattice. |
| Chiral semion Walker-Wang model code | A 3D lattice modular-qudit stabilizer code with qudit dimension \(q=4\) whose low-energy excitations on boundaries realize the chiral semion topological order. The model admits 2D chiral semion topological order at one of its surfaces [16,17]. The corresponding phase can also be realized via a non-stabilizer Hamiltonian [18]. |
| Classical-product code | A CSS code constructed by separately constructing the \(X\) and \(Z\) check matrices using product constructions from classical codes. A particular \([[512,174,8]]\) code performed well [19] against erasure and depolarizing noise when compared to other notable CSS codes, such as the asymptotically good quantum Tanner codes. These codes have been generalized to the intersecting subset code family [20]. |
| Clifford-deformed surface code (CDSC) | A generally non-CSS derivative of the surface code defined by applying a constant-depth Clifford circuit to the original (CSS) surface code. Unlike the surface code, CDSCs include codes whose thresholds and subthreshold performance are enhanced under noise biased towards dephasing. Examples of CDSCs include the XY code, XZZX code, and random CDSCs. |
| Cluster-state code | A code based on a cluster state and often used in measurement-based quantum computation (MBQC) [21,22] (a.k.a. one-way quantum processing), which substitutes the temporal dimension necessary for decoding a conventional code with a spatial dimension. This is done by encoding the computation into the features of the cluster state''s graph. |
| Coherent-parity-check (CPC) code | A qubit stabilizer code for which two binary linear codes are used to directly construct encoding and decoding circuits against \(X\)- and \(Z\)-type errors, respectively, via ZX calculus [23,24]. CPC codes can be obtained from numerical search [25]. |
| Color code | Member of a family of qubit CSS codes defined on particular \(D\)-dimensional graphs. |
| Compactified \(\mathbb{R}\) gauge theory code | An integer-homology bosonic CSS code realizing 2D \(U(1)\) gauge theory on bosonic modes. The code can be obtained from the analog surface code by condensing certain anyons [26]. This results in a pinning of each mode to the space of periodic functions, which make up a physical rotor, and can be thought of as compactification of the 2D \(\mathbb{R}\) gauge theory phase realized by the analog surface code. |
| Concatenated GKP code | A concatenated code whose outer code is a GKP code. In other words, a bosonic code that can be thought of as a concatenation of an arbitrary inner code and another bosonic outer code. Most examples encode physical qubits of an inner stabilizer code into the square-lattice GKP code. |
| Concatenated Steane code | A member of the family of \([[7^m,1,3^m]]\) CSS codes, each of which is a recursive level-\(m\) concatenation of the Steane code. This family is one of the first to admit a concatenated threshold [27–31]. |
| Crystalline-circuit qubit code | Code dynamically generated by unitary Clifford circuits defined on a lattice with some crystalline symmetry. A notable example is the circuit defined on a rotated square lattice with vertices corresponding to iSWAP gates and edges decorated by \(R_X[\pi/2]\), a single-qubit rotation by \(\pi/2\) around the \(X\)-axis. This circuit is invariant under space-time translations by a unit cell \((T, a)\) and all transformations of the square lattice point group \(D_4\). |
| Cubic honeycomb color code | 3D color code defined on a four-colorable bitruncated cubic honeycomb uniform tiling. |
| Derby-Klassen (DK) code | A fermion-into-qubit code defined on regular tilings with maximum degree 4 whose stabilizers are associated with loops in the tiling. The code outperforms several other encodings in terms of encoding rate [32; Table I]. It has been extended for models with several modes per site [33]. |
| Dinur-Hsieh-Lin-Vidick (DHLV) code | A family of asymptotically good QLDPC codes which are related to expander LP codes in that the roles of the check operators and physical qubits are exchanged. |
| Dinur-Lin-Vidick (DLV) code | Member of a family of quantum locally testable codes constructed using cubical chain complexes, which are \(t\)-order extensions of the complexes underlying expander codes (\(t=1\)) and expander lifted-product codes (\(t=2\)). |
| Distance-balanced code | Galois-qudit CSS code constructed from a CSS code and a classical code using a distance-balancing procedure based on a generalized homological product. The initial code is said to be unbalanced, i.e., tailored to noise biased toward either bit- or phase-flip errors, and the procedure can result in a code that is treats both types of errors on a more equal footing. The original distance-balancing procedure [34], later generalized [35; Thm. 4.2], can yield QLDPC codes [34; Thm. 1]. |
| Double-semion stabilizer code | A 2D lattice modular-qudit stabilizer code with qudit dimension \(q=4\) that is characterized by the 2D double semion topological phase. The code can be obtained from the \(\mathbb{Z}_4\) surface code by condensing the anyon \(e^2 m^2\) [36]. Originally formulated as the ground-state space of a Hamiltonian with non-commuting terms [37], which can be extended to other spatial dimensions [38], and later as a commuting-projector code [8,39]. |
| Expander LP code | Family of \(G\)-lifted product codes constructed using two random classical Tanner codes defined on expander graphs [40]. For certain parameters, this construction yields the first asymptotically good QLDPC codes. Classical codes resulting from this construction are one of the first two families of \(c^3\)-LTCs. |
| Fermion-into-qubit code | Qubit stabilizer code encoding a logical fermionic Hilbert space into a physical space of \(n\) qubits. Such codes are primarily intended for simulating fermionic systems on quantum computers, and some of them have error-detecting, correcting, and transmuting properties. |
| Fiber-bundle code | A CSS code constructed by combining one code as the base and another as the fiber of a fiber bundle. In particular, taking a random LDPC code as the base and a cyclic repetition code as the fiber yields, after distance balancing, a QLDPC code with distance of order \(\Omega(n^{3/5}\text{polylog}(n))\) and rate of order \(\Omega(n^{-2/5}\text{polylog}(n))\) is obtained. |
| Fibonacci fractal spin-liquid code | A fractal type-I fracton CSS code defined on a cubic lattice [3; Eq. (D23)]. |
| Finite-geometry (FG) QLDPC code | CSS code constructed from linear binary codes whose parity-check or generator matrices are incidence matrices of points, hyperplanes, or other structures in finite geometries. These codes can be interpreted as quantum versions of FG-LDPC codes, but some of them [41,42] are not strictly QLDPC. |
| Five-qubit perfect code | Five-qubit cyclic stabilizer code that is the smallest qubit stabilizer code to correct a single-qubit error. |
| Five-rotor code | Extension of the five-qubit stabilizer code to the integer alphabet, i.e., the angular momentum states of a planar rotor. The code is \(U(1)\)-covariant and ideal codewords are not normalizable. |
| Folded quantum RS (FQRS) code | CSS code on \(q^m\)-dimensional Galois-qudits that is constructed from folded RS (FRS) codes (i.e., an RS code whose coordinates have been grouped together) via the Galois-qudit CSS construction. This code is used to construct Singleton-bound approaching approximate quantum codes. |
| Four-rotor code | \([[4,2,2]]_{\mathbb Z}\) CSS rotor code that is an extension of the four-qubit code to the integer alphabet, i.e., the angular momentum states of a planar rotor. |
| Fractal surface code | Kitaev surface code on a fractal geometry, which is obtained by removing qubits from the surface code on a cubic lattice. A related construction, the fractal product code, is a hypergraph product of two classical codes defined on a Sierpinski carpet graph [43]. The underlying classical codes form classical self-correcting memories [44–46]. |
| Fracton stabilizer code | A 3D translationally invariant modular-qudit stabilizer code whose codewords make up the ground-state space of a Hamiltonian in a fracton phase. Unlike topological phases, whose excitations can move in any direction, fracton phases are characterized by excitations whose movement is restricted. |
| Freedman-Meyer-Luo code | Hyperbolic surface code constructed using cellulation of a Riemannian Manifold \(M\) exhibiting systolic freedom [47]. Codes derived from such manifolds can achieve distances scaling better than \(\sqrt{n}\), something that is impossible using closed 2D surfaces or 2D surfaces with boundaries [48]. Improved codes are obtained by studying a weak family of Riemann metrics on closed 4-dimensional manifolds \(S^2\otimes S^2\) with the \(Z_2\)-homology. |
| Frobenius code | A cyclic prime-qudit stabilizer code whose length \(n\) divides \(p^t + 1\) for some positive integer \(t\). |
| Fusion-based quantum computing (FBQC) code | Code whose codewords are resource states used in an FBQC scheme. Related to a cluster state via Hadamard transformations. |
| GKP CV-cluster-state code | Cluster-state code can consists of a generalized analog cluster state that is initialized in GKP (resource) states for some of its physical modes. Alternatively, it can be thought of as an oscillator-into-oscillator GKP code whose encoding consists of initializing \(k\) modes in momentum states (or, in the normalizable case, squeezed vacua), \(n-k\) modes in (normalizable) GKP states, and applying a Gaussian circuit consisting of two-body \(e^{i V_{jk} \hat{x}_j \hat{x}_k }\) for some angles \(V_{jk}\). Provides a way to perform fault-tolerant MBQC, with the required number \(n-k\) of GKP-encoded physical modes determined by the particular protocol [49–52]. |
| GKP-surface code | A concatenated code whose outer code is a GKP code and whose inner code is a toric surface code [53], rotated surface code [51,54–57], or XZZX surface code [58]. |
| Galois-qudit BCH code | True Galois-qudit stabilizer code constructed from BCH codes via either the Hermitian construction or the Galois-qudit CSS construction. Parameters can be improved by applying Steane enlargement [59], e.g., as in Ref. [60]. |
| Galois-qudit CSS code | An \([[n,k,d]]_q \) Galois-qudit true stabilizer code admitting a set of stabilizer generators that are either \(Z\)-type or \(X\)-type Galois-qudit Pauli strings. Codes can be defined from chain complexes over \(GF(q)\) via an extension of qubit CSS-to-homology correspondence to Galois qudits. |
| Galois-qudit GRS code | True \(q\)-Galois-qudit stabilizer code constructed from GRS codes via either the Hermitian construction [61–63] or the Galois-qudit CSS construction [64,65]. |
| Galois-qudit HGP code | A member of a family of Galois-qudit CSS codes whose stabilizer generator matrix is obtained from a hypergraph product of two classical linear \(q\)-ary codes. |
| Galois-qudit RS code | An \([[n,k,n-k+1]]_q\) (with \(q>n\)) Galois-qudit CSS code constructed using two RS codes over \(GF(q)\). |
| Galois-qudit color code | Extension of the color code to 2D lattices of Galois qudits. |
| Galois-qudit expander code | Galois-qudit CSS code constructed from a hypergraph product of expander codes. |
| Galois-qudit quantum RM code | True \(q\)-Galois-qudit stabilizer code constructed from generalized Reed-Muller (GRM) codes via the Hermitian construction, the Galois-qudit CSS construction, or directly from their parity-check matrices [66; Sec. 4.2]. |
| Galois-qudit stabilizer code | An \(((n,K,d))_q\) Galois-qudit code whose logical subspace is the joint eigenspace of commuting Galois-qudit Pauli operators forming the code's stabilizer group \(\mathsf{S}\). Traditionally, the logical subspace is the joint \(+1\) eigenspace, and the stabilizer group does not contain \(e^{i \phi} I\) for any \(\phi \neq 0\). The distance \(d\) is the minimum weight of a Galois-qudit Pauli string that implements a nontrivial logical operation in the code. |
| Galois-qudit surface code | Extension of the surface code to 2D lattices of Galois qudits. |
| Generalized Shor code | Qubit CSS code constructed by concatenating two classical codes in a way the generalizes the Shor and quantum parity codes. |
| Generalized bicycle (GB) code | A quasi-cyclic Galois-qudit CSS code constructed using a generalized version of the bicycle ansatz [67] from a pair of equivalent index-two quasi-cyclic linear codes. Equivalently, the codes can constructed via the lifted-product construction for \(G\) being a cyclic group [6; Sec. III.E]. |
| Generalized homological-product CSS code | CSS code whose properties are determined from an underlying chain complex, which often consists of some type of product of other chain complexes. |
| Generalized homological-product code | Stabilizer code whose properties are determined from an underlying chain complex, which often consists of some type of product of other chain complexes. The Qubit CSS-to-homology correspondence yields an interpretation of codes in terms of manifolds, thus allowing for the use of various products from topology in constructing codes. |
| Generalized homological-product qubit CSS code | Qubit CSS code whose properties are determined from an underlying chain complex, which often consists of some type of product of other chain complexes. |
| Generalized quantum Tanner code | An extension of quantum Tanner codes to codes constructed from two commuting regular graphs with the same vertex set. This allows for code construction using finite sets and Schreier graphs, yielding a broader family of square complexes. |
| Generalized quantum divisible code | A level-\(\nu\) generalized quantum divisible code is a CSS code whose \(X\)-type stabilizers, in the symplectic representation, have zero norm and form a \((\nu,t)\)-null matrix (defined below) with respect to some odd-integer vector \(t\) [68; Def. V.1]. Such codes admit gates at the \(\nu\)th level of the Clifford hierarchy. Such codes can also be level-lifted [68; Theorem V.6], \(\nu\to\nu+1\), which recursively yields towers of generalized divisible codes from a particular ground code. |
| Golden code | Variant of the Guth-Lubotzky hyperbolic surface code that uses regular tessellations for 4-dimensional hyperbolic space. |
| Good QLDPC code | Also called asymptotically good QLDPC codes. A family of QLDPC codes \([[n_i,k_i,d_i]]\) whose asymptotic rate \(\lim_{i\to\infty} k_i/n_i\) and asymptotic distance \(\lim_{i\to\infty} d_i/n_i\) are both positive. |
| Gottesman-Kitaev-Preskill (GKP) code | Quantum lattice code for a non-degenerate lattice, thereby admitting a finite-dimensional logical subspace. Codes on \(n\) modes can be constructed from lattices with \(2n\)-dimensional full-rank Gram matrices \(A\). Any GKP code can be generated from a Gram matrix in standard form via a Gaussian unitary transformation [69; Corr. 1]. |
| Graph quantum code | A stabilizer code on tensor products of \(G\)-valued qudits for Abelian \(G\) whose encoding isometry is defined using a graph [70; Eqs. (4-5)]. An analytical form of the codewords exists in terms of the adjacency matrix of the graph and bicharacters of the Abelian group [70]; see [71; Eq. (1)]. A graph quantum code for \(G=\mathbb{Z}_2\) contains a cluster state as one of its codewords and reduces to a cluster state when its logical dimension is one [72]. |
| Guth-Lubotzky code | Hyperbolic surface code based on cellulations of certain four-dimensional manifolds. The manifolds are shown to have good homology and systolic properties for the purposes of code construction, with corresponding codes exhibiting linear rate. |
| Haah cubic code (CC) | A 3D lattice stabilizer code on a length-\(L\) cubic lattice with one or two qubits per site. Admits two types of stabilizer generators with support on each cube of the lattice. In the non-CSS case, these two are related by spatial inversion. For CSS codes, we require that the product of all corner operators is the identity. We lastly require that there are no non-trival string operators, meaning that single-site operators are a phase, and any period one logical operator \(l \in \mathsf{S}^{\perp}\) is just a phase. |
| Hayden-Nezami-Salton-Sanders bosonic code | An \([[n,1]]_{\mathbb{R}}\) analog CSS code defined using homological structures associated with an \(n-1\) simplex. Relevant to the study of spacetime replication of quantum information [73]. |
| Hemicubic code | Homological code constructed out of cubes in high dimensions. The hemicubic code family has asymptotically diminishing soundness that scales as order \(\Omega(1/\log n)\), locality of stabilizer generators scaling as order \(O(\log n)\), and distance of order \(\Theta(\sqrt{n})\). |
| Heptagon holographic code | Holographic tensor-network code constructed out of a network of encoding isometries of the Steane code. Depending on how the isometry tensors are contracted, there is a zero-rate and a finite-rate code family. |
| Hermitian Galois-qudit code | An \([[n,k,d]]_q\) true Galois-qudit stabilizer code constructed from a Hermitian self-orthogonal linear code over \(GF(q^2)\) using the one-to-one correspondence between the Galois-qudit Pauli matrices and elements of the Galois field \(GF(q^2)\). |
| Hermitian qubit code | An \([[n,k,d]]\) stabilizer code constructed from a Hermitian self-orthogonal linear quaternary code using the \(GF(4)\) representation. |
| Hexagonal GKP code | Single-mode GKP qudit-into-oscillator code based on the triangular lattice. Offers the best error correction against displacement noise in a single mode due to the optimal packing of the underlying lattice. |
| Hierarchical code | Member of a family of \([[n,k,d]]\) qubit stabilizer codes resulting from a concatenation of a constant-rate QLDPC code with a rotated surface code. Concatenation allows for syndrome extraction to be performed on a 2D geometry while maintining a threshold at the expense of a logarithmically vanishing rate. The growing syndrome extraction circuit depth allows known bounds in the literature to be weakened [74,75]. |
| High-dimensional expander (HDX) code | CSS code constructed from a Ramanujan quantum code and an asymptotically good classical LDPC code using distance balancing. Ramanujan quantum codes are defined using Ramanujan complexes which are simplicial complexes that generalise Ramanujan graphs [76,77]. Combining the quantum code obtained from a Ramanujan complex and a good classical LDPC code, which can be thought of as coming from a 1-dimensional chain complex, yields a new quantum code that is defined on a 2-dimensional chain complex. This 2-dimensional chain complex is obtained by the co-complex of the product of the 2 co-complexes. The length, dimension and distance of the new quantum code depend on the input codes. |
| Homological code | CSS-type extension of the Kitaev surface code to arbitrary manifolds. The version on a Euclidean manifold of some fixed dimension is called the \(D\)-dimensional "surface" or \(D\)-dimensional toric code. |
| Homological product code | CSS code formulated using the tensor product of two chain complexes of length one or greater (see Qubit CSS-to-homology correspondence). |
| Homological rotor code | A homological quantum rotor code is an extension of analog stabilizer codes to rotors. The code is stabilized by a continuous group of rotor \(X\)-type and \(Z\)-type generalized Pauli operators. Codes are formulated using an extension of the qubit CSS-to-homology correspondence to rotors. The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension, i.e., encoding logical qudits instead of only logical rotors. Such finite-dimensional encodings are not possible with analog stabilizer codes. |
| Honeycomb (6.6.6) color code | 2D color code defined on a patch of the 6.6.6 (honeycomb) tiling. |
| Hsieh-Halasz (HH) code | Member of one of two families of fracton codes, named HH-I and HH-II, defined on a cubic lattice with two qubits per site. HH-I (HH-II) is a CSS (non-CSS) stabilizer code family, with the former identified as a foliated type-I fracton code [3]. |
| Hsieh-Halasz-Balents (HHB) code | Member of one of two families of fracton codes, named HHB model A and B, defined on a cubic lattice with two qubits per site. Both are expected to be foliated type-I fracton codes [3; Eqs. (D42-D43)]. |
| Hurwitz surface code | Homological code constructed on triangulations of Hurwitz surfaces. |
| Hyperbolic color code | An extension of the color code construction to hyperbolic manifolds. As opposed to there being only three types of uniform three-valent and three-colorable lattice tilings in the 2D Euclidean plane, there is an infinite number of admissible hyperbolic tilings in the 2D hyperbolic plane [78]. Certain double covers of hyperbolic tilings also yield admissible tilings [79]. Other admissible hyperbolic tilings can be obtained via a fattening procedure [80]; see also a construction based on the more general quantum pin codes [81]. |
| Hyperbolic surface code | An extension of the Kitaev surface code construction to hyperbolic manifolds. Given a cellulation of a manifold, qubits are put on \(i\)-dimensional faces, \(X\)-type stabilizers are associated with \((i-1)\)-faces, while \(Z\)-type stabilizers are associated with \(i+1\)-faces. |
| Hypergraph product (HGP) code | A member of a family of CSS codes whose stabilizer generator matrix is obtained from a hypergraph product of two classical linear binary codes. Codes from hypergraph products in higher dimension are called higher-dimensional HGP codes [82]. |
| Hyperinvariant tensor-network (HTN) code | Holographic tensor-network error-detecting code constructed out of a hyperinvariant tensor network [83], i.e., a MERA-like network admitting a hyperbolic geometry. The network is defined using two layers A and B, with constituent tensors satisfying isometry conditions (a.k.a. multitensor constraints). |
| Hypersphere product code | Homological code based on products of hyperspheres. The hypersphere product code family has asymptotically diminishing soundness that scales as order \(O(1/\log (n)^2)\), locality of stabilizer generators scaling as order \(O(\log n/ \log\log n)\), and distance of order \(\Theta(\sqrt{n})\). |
| Integer-homology bosonic CSS code | A bosonic stabilizer code whose physical modes have been restricted, via a single GKP stabilizer, from the space of functions on the real line to the space of periodic functions. This restriction effectively realizes a rotor on each physical mode, allowing one to construct homological rotor codes out of displacement stabilizer groups. The stabilizer group is continuous, but contains discrete components in the form of the single-mode GKP stabilizers. The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension. |
| Jordan-Wigner transformation code | A mapping between qubit Pauli strings and Majorana operators that can be thought of as a trivial \([[n,n,1]]\) code. The mapping is best described as converting a chain of \(n\) qubits into a chain of \(2n\) Majorana modes (i.e., \(n\) fermionic modes). It maps Majorana operators into Pauli strings of weight \(O(n)\). |
| Kitaev chain code | An \([[n,1,1]]_{f}\) Majorana stabilizer code forming the ground-state of the Kitaev Majorana chain (a.k.a. Kitaev Majorana wire) in its fermionic topological phase, which is unitarily equivalent to the 1D quantum Ising model in the symmetry-breaking phase via the Jordan-Wigner transformation. The code is usually defined using the algebra of two anti-commuting Majorana operators called Majorana zero modes (MZMs) or Majorana edge modes (MEMs). It can be thought of as the Majorana stabilizer analogue of the quantum repetition code, and it encodes a logical fermion because its logical Majorana operator has odd weight [84]. |
| Kitaev current-mirror qubit code | Member of the family of \([[2n,(0,2),(2,n)]]_{\mathbb{Z}}\) homological rotor codes storing a logical qubit on a thin Möbius strip. The ideal code can be obtained from a Josephson-junction [85] system [86]. |
| Kitaev surface code | A family of Abelian topological CSS stabilizer codes whose generators are few-body \(X\)-type and \(Z\)-type Pauli strings associated to the stars and plaquettes, respectively, of a cellulation of a two-dimensional surface (with a qubit located at each edge of the cellulation). Codewords correspond to ground states of the surface code Hamiltonian, and error operators create or annihilate pairs of anyonic charges or vortices. |
| La-cross code | Code constructed using a hypergraph product of two copies of a cyclic LDPC code. The construction uses cyclic LDPC codes with generating polynomials \(1+x+x^k\) for some \(k\). Using a length-\(n\) seed code yields an \([[2n^2,2k^2]]\) family for periodic boundary conditions and an \([[(n-k)^2+n^2,k^2]]\) family for open boundary conditions. |
| Lattice stabilizer code | A geometrically local stabilizer code with sites organized on a lattice modeled by the additive group \(\mathbb{Z}^D\) for spatial dimension \(D\). On an infinite lattice, its stabilizer group is generated by few-site Pauli-type operators and their translations, in which case the code is called translationally invariant stabilizer code. Boundary conditions have to be imposed on the lattice in order to obtain finite-dimensional versions. Lattice defects and boundaries between different codes can also be introduced. |
| Layer code | Member of a family of 3D lattice CSS codes with stabilizer generator weights \(\leq 6\) that are obtained by coupling layers of 2D surface code according to the Tanner graph of a QLDPC code. Geometric locality is maintained because, instead of being concatenated, each pair of parallel surface-code squares are fused (or quasi-concatenated) with perpendicular surface-code squares via lattice surgery. |
| Lift-connected surface (LCS) code | Member of one of several families of lifted-product codes that consist of sparsely interconnected stacks of surface codes. |
| Lifted-product (LP) code | Galois-qudit code that utilizes the notion of a lifted product in its construction. Lifted products of certain classical Tanner codes are the first (asymptotically) good QLDPC codes. |
| Log-depth geometrically local Clifford-circuit code | A random \([[n,k]]\) stabilizer code whose encoder is a random Clifford circuit of depth of order \(O(\log n)\) on a 1D Euclidean geometry. |
| Long-range enhanced surface code (LRESC) | Code constructed using a hypergraph product of two copies of a concatenated LDPC-repetition seed code. This family interpolates between surface codes and hypergraph codes since the hypergraph product of two repetition codes yields the planar surface code. The construction uses small \([3,2,2]\) and \([6,2,4]\) LDPC codes concatenated with \([4,1,4]\) and \([2,1,2]\) repetition codes, respectively. An example using a \([5,2,3]\) code is also presented. |
| Loop toric code | A generalization of the Kitaev surface code defined on a 4D lattice. The code is called a \((2,2)\) toric code because it admits 2D membrane \(Z\)-type and \(X\)-type logical operators. Both types of operators create 1D (i.e., loop) excitations at their edges. The code serves as a self-correcting quantum memory [87,88]. |
| Lossless expander balanced-product code | QLDPC code constructed by taking the balanced product of lossless expander graphs. Using one part of a quantum-code chain complex constructed with one-sided loss expanders [89] yields a \(c^3\)-LTC [90]. Using two-sided expanders, which are only conjectured to exist, yields an asymptotically good QLDPC code family [91]. |
| Majorana box qubit | A Majorana stabilizer code which forms a fixed-parity subspace of the ground-state subspace of one or more Kitaev Majorana chain Hamiltonians. The \([[n,1,2]]_{f}\) Majorana box qubit forms the even-fermion-parity ground-state subspace of two parallel Kitaev Majorana chains in their fermionic topological phase. Its \([[2,1,2]]_{f}\) version is called the tetron Majorana code. An \([[3,2,2]]_{f}\) extension using three Kitaev chains and housing two logical qubits of the same parity is called the hexon Majorana code. Similarly, octon, decon, and dodecon are codes defined by the positive-parity subspace of \(4\), \(5\), and \(6\) fermionic modes, respectively [92]. |
| Majorana checkerboard code | A Majorana analogue of the X-cube model defined on a cubic lattice. The code admits weight-eight Majorana stabilizer generators on the eight vertices of each cube of a checkerboard sublattice. |
| Majorana color code | Majorana analogue of the color code defined on a 2D tricolorable lattice and constructed out of Majorana box qubit codes or other small Majorana stabilizer codes placed on patches of the lattice. |
| Majorana loop stabilizer code (MLSC) | An single error-correcting fermion-into-qubit encoding defined on a 2D qubit lattice whose stabilizers are associated with loops in the lattice. |
| Majorana stabilizer code | A stabilizer code whose stabilizers are products of an even number of Majorana fermion operators, analogous to Pauli strings for a traditional stabilizer code and referred to as Majorana stabilizers. The codespace is the mutual \(+1\) eigenspace of all Majorana stabilizers. |
| Majorana surface code | Majorana analogue of the surface code defined on a 2D lattice and constructed out of Majorana box qubit codes placed on patches of the lattice. |
| Matching code | Member of a class of qubit stabilizer codes based on the Abelian phase of the Kitaev honeycomb model. |
| Modular-qudit CSS code | An \(((n,K,d))_q\) modular-qudit 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 the ring \(\mathbb{Z}_q\) via an extension of qubit CSS-to-homology correspondence to modular qudits [93]. The homology group of the logical operators has a torsion component because the chain complexes are defined over a ring, which yields codes whose logical dimension is not a power of \(q\). |
| Modular-qudit GKP code | Modular-qudit analogue of the GKP code. Encodes a qudit into a larger qudit and protects against Pauli shifts up to some maximum value. |
| Modular-qudit cluster-state code | A code based on a modular-qudit cluster state. |
| Modular-qudit color code | Extension of the color code to lattices of modular qudits. Codes are defined analogous to qubit color codes on suitable lattices of any spatial dimension, but a directionality is required in order to make the modular-qudit stabilizer commute. This can be done by puncturing a hyperspherical lattice [94] or constructing a star-bipartition; see [95; Sec. III]. Logical dimension is determined by the genus of the underlying surface (for closed surfaces), types of boundaries (for open surfaces), and/or any twist defects present. |
| Modular-qudit shift-resistant code | Monolithic code encoding a qubit into a single modular qudit and protecting against either \(Z\)-type or \(X\)-type modular-qudit Pauli shifts. |
| Modular-qudit stabilizer code | An \(((n,K,d))_q\) modular-qudit code whose logical subspace is the joint eigenspace of commuting qudit Pauli operators forming the code's stabilizer group \(\mathsf{S}\). Traditionally, the logical subspace is the joint \(+1\) eigenspace, and the stabilizer group does not contain \(e^{i \phi} I\) for any \(\phi \neq 0\). The distance \(d\) is the minimum weight of a qudit Pauli string that implements a nontrivial logical operation in the code. |
| Modular-qudit surface code | Extension of the surface code to prime-dimensional [96,97] and more general modular qudits [98]. Stabilizer generators are few-body \(X\)-type and \(Z\)-type Pauli strings associated to the stars and plaquettes, respectively, of a tessellation of a two-dimensional surface. Since qudits have more than one \(X\) and \(Z\)-type operator, various sets of stabilizer generators can be defined. Ground-state degeneracy and the associated phase depends on the qudit dimension and the stabilizer generators. |
| NTRU-GKP code | Multi-mode GKP code whose underlying lattice is utilized in variations of the NTRU cryptosystem [99]. Randomized constructions yield constant-rate GKP code families whose largest decodable displacement length scales as \(O(\sqrt{n})\) with high probability. |
| Oscillator-into-oscillator GKP code | Multimode GKP code with an infinite-dimensional logical space. Can be obtained by considering an \(n\)-mode GKP code with a finite-dimensional logical space, removing stabilizers such that the logical space becomes infinite dimensional, and applying a Gaussian circuit. |
| Pastawski-Yoshida-Harlow-Preskill (HaPPY) code | Holographic code constructed out of a network of hexagonal perfect tensors that tesselates hyperbolic space. The code serves as a minimal model for several aspects of the AdS/CFT holographic duality [100] and potentially a dF/CFT duality [101]. It has been generalized to higher dimensions [102] and to include gauge-like degrees of freedom on the links of the tensor network [103,104]. All boundary global symmetries must be dual to bulk gauge symmetries, and vice versa [105]. |
| Prime-qudit RM code | Modular-qudit stabilizer code constructed from generalized Reed-Muller (GRM) codes or their duals via the modular-qudit CSS construction. An odd-prime-qudit CSS code family constructed from first-order punctured GRM codes transversally implements a diagonal gate at any level of the qudit Clifford hierarchy [106,107]. |
| Prime-qudit RS code | Prime-qudit CSS code constructed using two RS codes. |
| Prime-qudit triorthogonal code | An \(m \times n\) matrix over \(GF(p)=\mathbb{Z}_p\) is triorthogonal if its rows \(r_1, \ldots, r_m\) satisfy \(|r_i \cdot r_j| = 0\) and \(|r_i \cdot r_j \cdot r_k| = 0\) modulo \(p\), where addition and multiplication are done on \(GF(p)\). The triorthogonal prime-qudit CSS code associated with the matrix is constructed by mapping nonzero entries in self-orhogonal rows to \(X\) operators, and \(Z\) operators for each row in the orthogonal complement [108,109]. |
| Projective-plane surface code | A family of Kitaev surface codes on the non-orientable 2-dimensional compact manifold \(\mathbb{R}P^2\) (in contrast to a genus-\(g\) surface). Whereas genus-\(g\) surface codes require \(2g\) logical qubits, qubit codes on \(\mathbb{R}P^2\) are made from a single logical qubit. |
| Purity-testing stabilizer code | A qubit stabilizer code that is constructed from a normal rational curve and that is relevant to testing the purity of an entangled Bell state stabilized by two parties [110]. |
| Quantum AG code | A Galois-qudit CSS code constructed using two linear AG codes. |
| Quantum Gabidulin code | A Galois-qudit stabilizer code over \(n\) Galois qudits of dimension \(q = 2^n \) that is useful in protecting against faults in qubit Clifford circuits acting on stacked quantum memories. This code can be treated as a code on an \(n\times n\) qubit stacked memory by decomposing each Galois qudit into a Kronecker product of \(n\) qubits; see [111,113–115][112; Sec. 5.3]. |
| Quantum Goppa code | A Galois-qudit CSS code constructed using two Goppa codes. |
| Quantum LDPC (QLDPC) code | Member of a family of \([[n,k,d]]\) stabilizer codes for which the number of sites participating in each stabilizer generator and the number of stabilizer generators that each site participates in are both bounded by a constant \(w\) as \(n\to\infty\). The code can be denoted by \([[n,k,d,w]]\) or, for \(q\)-dimensional Galois-qudit QLDPC codes, \([[n,k,d]]_{(w,q)}\). Sometimes, the two parameters are explicitly stated: each site of an an \((l,w)\)-regular QLDPC code is acted on by \(\leq l\) generators of weight \(\leq w\). For finite size codes, the notation QLDPC codes can correct many stochastic errors far beyond the distance, which may not scale as favorably. Together with more accurate, faster, and easier-to-parallelize measurements than those of general stabilizer codes, this property makes QLDPC codes interesting in practice. |
| Quantum Reed-Muller code | A CSS code formed from a classical Reed-Muller (RM) code or its punctured/shortened versions. Such codes often admit transversal logical gates in the Clifford hierarchy. |
| Quantum Tamo-Barg (QTB) code | A member of a family of Galois-qudit CSS codes whose underlying classical codes consist of Tamo-Barg codes together with specific low-weight codewords. Folded versions of QTB codes, or FQTB codes, defined on qudits whose dimension depends on \(n\) yield explicit examples of QLRCs of arbitrary locality \(r\) [116; Thm. 2]. |
| Quantum Tanner code | Member of a family of QLDPC codes based on two compatible classical Tanner codes defined on a two-dimensional Cayley complex, a complex constructed from Cayley graphs of groups. For certain choices of codes and complex, the resulting codes have asymptotically good parameters. This construction has been generalized to Schreier graphs [117]. |
| Quantum check-product code | CSS code constructed from an extension of check product (between two classical codes) to a product between a classical and a quantum code. |
| Quantum convolutional code | One-dimensional translationally invariant qubit stabilizer code whose whose stabilizer group can be partitioned into constant-size subsets of constant support and of constant overlap between neighboring sets. Initially formulated as a quantum analogue of convolutional codes, which were designed to protect a continuous and never-ending stream of information. Precise formulations sometimes begin with a finite-dimensional lattice, with the intent to take the thermodynamic limit; logical dimension can be infinite as well. |
| Quantum data-syndrome (QDS) code | Stabilizer code designed to correct both data qubit errors and syndrome measurement errors simultaneously due to extra redundancy in its stabilizer generators. |
| Quantum divisible code | A level-\(\nu\) quantum divisible code is a CSS code whose \(X\)-type stabilizers form a \(\nu\)-even linear binary code in the symplectic representation and which admits a transversal gate at the \(\nu\)th level of the Clifford hierarchy. A CSS code is doubly even (triply even) if all \(X\)-type stabilizers have weight divisible by four (eight), i.e., if they form a doubly even (triply even) linear binary code. |
| Quantum duadic code | True Galois-qudit stabilizer code constructed from \(q\)-ary duadic codes via the Hermitian construction or the Galois-qudit CSS construction. |
| Quantum expander code | CSS code constructed from a hypergraph product of bipartite expander graphs [40] with bounded left and right vertex degrees. For every bipartite graph there is an associated matrix (the parity check matrix) with columns indexed by the left vertices, rows indexed by the right vertices, and 1 entries whenever a left and right vertex are connected. This matrix can serve as the parity check matrix of a classical code. Two bipartite expander graphs can be used to construct a quantum CSS code (the quantum expander code) by using the parity check matrix of one as \(X\) checks, and the parity check matrix of the other as \(Z\) checks. |
| Quantum irregular convolutional code (QIRCC) | Quantum convolutional code whose stabilizer group consists of different constant-size subsets. |
| Quantum lattice code | Bosonic stabilizer code on \(n\) bosonic modes whose stabilizer group is an infinite countable group of oscillator displacement operators which implement lattice translations in phase space. |
| Quantum low-weight check (QLWC) code | Member of a family of \([[n,k,d]]\) stabilizer codes for which the number of sites participating in each stabilizer generator is bounded by a constant as \(n\to\infty\). |
| Quantum multi-dimensional parity-check (QMDPC) code | High-rate low-distance CSS code whose qubits lie on a \(D\)-dimensional rectangle, with \(X\)-type stabilizer generators defined on each \(D-1\)-dimensional rectangle. The \(Z\)-type stabilizer generators are defined via permutations in order to commute with the \(X\)-type generators. |
| Quantum parity code (QPC) | A \([[m_1 m_2,1,\min(m_1,m_2)]]\) CSS code family obtained from concatenating an \(m_1\)-qubit phase-flip repetition code with an \(m_2\)-qubit bit-flip repetition code. |
| Quantum pin code | Member of a family of CSS codes that encompasses both quantum Reed-Muller and color codes and that is defined using intersections of pinned sets. |
| Quantum quadratic-residue (QR) code | Galois-qudit \([[n,1]]_q\) pure self-dual CSS code constructed from a dual-containing QR code via the Galois-qudit CSS construction. For \(q\) not divisible by \(n\), its distance satisfies \(d^2-d+1 \geq n\) when \(n \equiv 3\) modulo 4 [118; Thm. 40] and \(d \geq \sqrt{n}\) when \(n\equiv 1\) modulo 4 [118; Thm. 41]. |
| Quantum rainbow code | A CSS code whose qubits are associated with vertices of a simplex graph with \(m+1\) colors. |
| Quantum repetition code | Encodes \(1\) qubit into \(n\) qubits according to \(|0\rangle\to|\phi_0\rangle^{\otimes n}\) and \(|1\rangle\to|\phi_1\rangle^{\otimes n}\). The code is called a bit-flip code when \(|\phi_i\rangle = |i\rangle\), and a phase-flip code when \(|\phi_0\rangle = |+\rangle\) and \(|\phi_1\rangle = |-\rangle\). |
| Quantum spatially coupled (SC-QLDPC) code | QLDPC code whose stabilizer generator matrix resembles the parity-check matrix of SC-LDPC codes. There exist CSS [119] and stabilizer constructions [120]. In either case, the stabilizer generator matrix is constructed by "spatially" coupling sub-matrix blocks in chain-like fashion (or, more generally, in grid-like fashion) to yield a band matrix. The sub-matrix blocks have to satisfy certain conditions amongst themselves so that the resulting band matrix is a stabilizer generator matrix. Matrices corresponding to translationally invariant chains are called time-variant, and otherwise are called time-invariant. |
| Quantum synchronizable code | A qubit stabilizer code designed to protect against synchronization errors (a.k.a. misalignment), which are errors that misalign the code block in a larger block by one or more locations. |
| Quantum tensor-product code | CSS code constructed from a tensor code. In some cases, only one of the classical codes forming the tensor code needs to be self-orthogonal. |
| Quantum turbo code | A quantum version of the turbo code, obtained from an interleaved serial quantum concatenation [121; Def. 30] of quantum convolutional codes. |
| Quantum twisted code | Hermitian code arising constructed from twisted BCH codes. |
| Quasi-cyclic QLDPC (QC-QLDPC) code | A QLDPC code such that cyclic shifts of the subsystems by \(\ell\geq 1\) leave the codespace invariant. Such codes have circulant stabilizer generator matrices [122,123]. |
| Quasi-hyperbolic color code | An extension of the color code construction to quasi-hyperbolic manifolds, e.g., a product of a 2D hyperbolic surface and a circle. |
| Qubit BCH code | Qubit stabilizer code constructed from a self-orthogonal binary BCH code via the CSS construction, from a Hermitian self-orthogonal quaternary BCH code via the Hermitian construction, or by taking a Euclidean self-orthogonal BCH code over \(GF(2^m)\), converting it to a binary code, and applying the CSS construction. |
| Qubit CSS code | 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. |
| Qubit stabilizer code | An \(((n,2^k,d))\) qubit stabilizer code is denoted as \([[n,k]]\) or \([[n,k,d]]\), where \(d\) is the code's distance. Logical subspace is the joint eigenspace of commuting Pauli operators forming the code's stabilizer group \(\mathsf{S}\). Traditionally, the logical subspace is the joint \(+1\) eigenspace of a set of \(2^{n-k}\) commuting Pauli operators which do not contain \(-I\). The distance is the minimum weight of a Pauli string that implements a nontrivial logical operation in the code. |
| Qudit 3D surface code | A generalization of the 3D surface code to modular qudits. |
| Qudit X-cube model code | Generalization of the X-cube model code to modular qudits. |
| Qudit cubic code | Generalization of the Haah cubic code to modular qudits. |
| Random stabilizer code | An \(n\)-qubit, modular-qudit, or Galois-qudit stabilizer code whose construction is non-deterministic. Since stabilizer encoders are Clifford circuits, such codes can be thought of as arising from random Clifford circuits. |
| Raussendorf-Bravyi-Harrington (RBH) cluster-state code | A three-dimensional cluster-state code defined on the bcc lattice (i.e., a cubic lattice with qubits on edges and faces). |
| Rotated surface code | Variant of the surface code defined on a square lattice that has been rotated 45 degrees such that qubits are on vertices, and both \(X\)- and \(Z\)-type check operators occupy plaquettes in an alternating checkerboard pattern. |
| Rotor GKP code | GKP code protecting against small angular position and momentum shifts of a planar rotor. |
| Rotor cluster-state code | Rotor analogue of the qubit and analog cluster-state codes. The exact rotor cluster state is non-normalizable, so approximate constructions have to be considered. Defined from an real-valued weighed adjacency matrix of a graph [9]. |
| Rotor stabilizer code | Rotor code whose codespace is defined as the common \(+1\) eigenspace of a group of mutually commuting rotor generalized Pauli operators. The stabilizer group can be either discrete or continuous, corresponding to modular or linear constraints on angular positions and momenta. Both cases can yield finite or infinite logical dimension. Exact codewords are non-normalizable, so approximate constructions have to be considered. |
| Sierpinsky fractal spin-liquid (SFSL) code | A fractal type-I fracton CSS code defined on a cubic lattice [3; Eq. (D22)]. The code admits an excitation-moving operator shaped like a Sierpinski triangle [3; Fig. 2]. |
| Singleton-bound approaching AQECC | Approximate quantum code of rate \(R\) that can tolerate adversarial errors nearly saturating the quantum Singleton bound of \((1-R)/2\). The formulation of such codes relies on a notion of quantum list decoding [124,125]. Sampling a description of this code can be done with an efficient randomized algorithm with \(2^{-\Omega(n)}\) failure probability. |
| Six-qubit-tensor holographic code | Holographic tensor-network code constructed out of a network of encoding isometries of the \([[6,1,3]]\) six-qubit stabilizer code. The structure of the isometry is similar to that of the heptagon holographic code since both isometries are rank-six tensors, but the isometry in this case is neither a perfect tensor nor a planar-perfect tensor. |
| Skew-cyclic CSS code | A member of a family of Galois-qudit CSS codes constructed from skew-cyclic classical codes over rings [126; Thm. 5.8]. See related study [127] that uses cyclic codes over rings. |
| Small-distance qubit stabilizer code | A qubit stabilizer code that either detects or corrects errors on at most two subsystems, i.e., have distance \(\leq 5\). |
| Spacetime circuit code | Qubit stabilizer code used to correct faults in Clifford circuits, i.e., circuits up made of Clifford gates and Pauli measurements. The code utilizes redundancy in the measurement outcomes of a circuit to correct circuit faults, which correspond to Pauli errors of the code. |
| Square homological product code | Homological product code whose underlying quantum-code boundary operators are square matrices (see Qubit CSS-to-homology correspondence). |
| Square-lattice GKP code | Single-mode GKP qudit-into-oscillator CSS code based on the rectangular lattice. Its stabilizer generators are oscillator displacement operators \(\hat{S}_q(2\alpha)=e^{-2i\alpha \hat{p}}\) and \(\hat{S}_p(2\beta)=e^{2i\beta \hat{x}}\). To ensure \(\hat{S}_q(2\alpha)\) and \(\hat{S}_p(2\beta)\) generate a stabilizer group that is Abelian, there is a constraint that \(\alpha\beta=2q\pi\) where \(q\) is an integer denoting the logical dimension. |
| Square-lattice cluster-state code | A code based on the cluster state on a square lattice that was used in the the first proposal for MBQC [21,22]. |
| Square-octagon (4.8.8) color code | 2D color code defined on a patch of the 4.8.8 (square-octagon) tiling, which itself is obtained by applying a fattening procedure to the square lattice [80]. |
| Stabilizer code | A code whose logical subspace is the joint eigenspace (usually with eigenvalue \(+1\)) of a set of commuting unitary Pauli-type operators forming the code's stabilizer group. They can be block codes defined of tensor-product spaces of qubits or qudits, or non-block codes defined on single sufficiently large Hilbert spaces such as bosonic modes or group spaces. |
| Stellated color code | A non-CSS color code on a lattice patch with a single twist defect at the center of the patch. |
| Surface-code-fragment (SCF) holographic code | Holographic tensor-network code constructed out of a network of encoding isometries of the \([[5,1,2]]\) rotated surface code. The structure of the isometry is similar to that of the HaPPY code since both isometries are rank-six tensors. In the case of the SCF holographic code, the isometry is only a planar-perfect tensor (as opposed to a perfect tensor). |
| Tensor-product HDX code | Code constructed in a similar way as the HDX code, but utilizing tensor products of multiple Ramanujan complexes and then applying distance balancing. These improve the asymptotic code distance over the HDX codes from \(\sqrt{n}\log n\) to \(\sqrt{n}~\text{polylog}(n)\). The utility of such tensor products comes from the fact that one of the Ramanujan complexes is a collective cosystolic expander as opposed to just a cosystolic expander. |
| Ternary-tree fermion-into-qubit code | A fermion-into-qubit encoding defined on ternary trees that maps Majorana operators into Pauli strings of weight \(\lceil \log_3 (2n+1) \rceil\). |
| Tetrahedral color code | 3D color code defined on select tetrahedra of a 3D tiling. Qubits are placed on the vertices, edges, triangles, and in the center of each tetrahedron. The code has both string-like and sheet-like logical operators [128]. |
| Tetron code | A \([[2,1,2]]_{f}\) Majorana box qubit, encoding two fixed-fermion states into the four-dimensional ground-state space of two Kitaev chains, each of length two. The code encodes a logical qubit into four Majorana modes (i.e., two physical fermions), allowing it to be concatenated with various qubit codes such as surface codes and color codes. Embedding each physical qubit into two fermions via the tetron code is useful for exactly solving the Kitaev honeycomb model Hamiltonian [129] and other qubit Hamiltonians on certain graphs [130,131]. |
| Three-fermion (3F) Walker-Wang model code | A 3D lattice stabilizer code whose low-energy excitations on boundaries realize a 3D time-reversal SPT order [132] and that can be used as a resource state for fault-tolerant MBQC [133]. The anyons at the boundary of the lattice are described by the 3F anyon theory. |
| Three-rotor code | \([[3,1,2]]_{\mathbb Z}\) rotor code that is an extension of the \([[3,1,2]]_3\) qutrit CSS code to the integer alphabet, i.e., the angular momentum states of a planar rotor. |
| Toric code | Version of the Kitaev surface code on the two-dimensional torus, encoding two logical qubits. Being the first manifestation of the surface code, "toric code" is often an alternative name for the general construction. Twisted toric code [134; Fig. 8] refers to the construction on a torus with twisted (a.k.a. shifted) boundary conditions. |
| Transverse-field Ising model (TFIM) code | A 1D translationally invariant stabilizer code whose encoding is a constant-depth circuit of nearest-neighbor gates on alternating even and odd bonds that consist of transverse-field Ising Hamiltonian interactions. The code allows for perfect state transfer of arbitrary distance using local operations and classical communications (LOCC). |
| Tree cluster-state code | Code obtained from a cluster state on a tree graph (e.g., a star graph [135,136]) that has been proposed in the context of quantum repeater and MBQC architectures. |
| Triangular surface code | A surface code with weight-four stabilizer generators defined on a honeycomb tiling that are examples of twist-defect surface code with a single twist defect at the center of the patch. The codes use about \(25\%\) fewer physical per logical qubit for a given distance compared to the surface code. |
| Triorthogonal code | Qubit CSS code whose \(X\)-type logicals and stabilizer generators form a triorthogonal matrix (defined below) in the symplectic representation. |
| True Galois-qudit stabilizer code | A \([[n,k,d]]_q\) stabilizer code whose stabilizer's Galois symplectic representation forms a linear subspace. In other words, the set of \(q\)-ary vectors representing the stabilizer group is closed under both addition and multiplication by elements of \(GF(q)\). In contrast, Galois-qudit stabilizer codes admit sets of vectors that are closed under addition only. |
| Truncated trihexagonal (4.6.12) color code | 2D color code defined on a patch of the 4.6.12 (truncated trihexagonal or square-hexagon-dodecagon) tiling. |
| Twist-defect color code | A non-CSS extension of the 2D color code whose non-CSS stabilizer generators are associated with twist defects of the associated lattice. |
| Twist-defect surface code | A non-CSS extension of the 2D surface-code construction whose non-CSS stabilizer generators are associated with twist defects of the associated lattice. A related construction [137] doubles the number of qubits in the lattice via symplectic doubling. |
| Twisted XZZX toric code | A cyclic code that can be thought of as the XZZX toric code with shifted (a.k.a twisted) boundary conditions. Admits a set of stabilizer generators that are cyclic shifts of a particular weight-four \(XZZX\) Pauli string. For example, a seven-qubit \([[7,1,3]]\) variant has stabilizers generated by cyclic shifts of \(XZIZXII\) [138]. Codes encode either one or two logical qubits, depending on qubit geometry, and perform well against biased noise [139]. |
| Two-block CSS code | Galois-qudit CSS code whose stabilizer generator matrices \(H_X=(A_1,B_1)\) and \(H_Z=(B^T_2,-A^T_2)\), are constructed from four matrices satisfying \(A_1 B_2 - B_1 A_2 = 0\). In the case the two pairs are equal, we have \(H_X=(A,B)\) and \(H_Z=(B^T,-A^T)\), constructed from a pair of square commuting matrices \(A\) and \(B\). |
| Two-block group-algebra (2BGA) codes | 2BGA codes are the smallest LP codes LP\((a,b)\), constructed from a pair of group algebra elements \(a,b\in \mathbb{F}_q[G]\), where \(G\) is a finite group, and \(\mathbb{F}_q\) is a Galois field. For a group of order \(\ell\), we get a 2BGA code of length \(n=2\ell\). A 2BGA code for an Abelian group is called an Abelian 2BGA code. A construction of such codes in terms of Kronecker products of circulant matrices was introduced in [140]. |
| Two-foliated fracton code | A type-I fracton code obtained by gauging [141–143,143] a topological phase with subsystem symmetry. |
| Type-II fractal spin-liquid code | A type-II fracton prime-qudit CSS code defined on a cubic lattice [3; Eqs. (D9-D10)]. |
| Union-Jack color code | 2D color code defined on a patch of the Tetrakis square tiling (a.k.a. the Union Jack lattice). |
| X-cube model code | A foliated type-I fracton code supporting a subextensive number of logical qubits. Variants include the membrane-coupled [144], twice-foliated [145], and several generalized [146] X-cube models. |
| XY surface code | Non-CSS derivative of the surface code whose generators are \(XXXX\) and \(YYYY\), obtained by mapping \(Z \to Y\) in the surface code. |
| XYZ color code | Non-CSS variant of the 6.6.6 color code whose generators are \(XZXZXZ\) and \(ZYZYZY\) Pauli strings associated to each hexagonal in the hexagonal (6.6.6) tiling. A further variation called the domain wall color code admits generators of the form \(XXXZZZ\) and \(ZZZXXX\) [147]. |
| XYZ product code | A non-CSS QLDPC code constructed from a particular hypergraph product of three linear binary codes. The idea is that rather than taking a product of only two classical codes to produce a CSS code, a third classical code is considered, acting with Pauli-\(Y\) operators. When the underlying classical codes are 1D (e.g., repetition codes), the XYZ product yields a 3D code. Higher dimensional versions have been constructed [148]. |
| XYZ\(^2\) hexagonal stabilizer code | An instance of the matching code based on the Kitaev honeycomb model. It is described on a honeycomb tiling with \(XYZXYZ\) stabilizers on each hexagonal plaquette. Each vertical pair of qubits has an \(XX\), \(YY\), or \(ZZ\) link stabilizer depending on the orientation of the plaquette stabilizers. |
| XZZX surface code | Non-CSS variant of the rotated surface code whose generators are \(XZZX\) Pauli strings associated, clock-wise, to the vertices of each face of a two-dimensional lattice (with a qubit located at each vertex of the tessellation). |
| Yoked surface code | Member of a family of \([[n,k,d]]\) qubit CSS codes resulting from a concatenation of a QMDPC code with a rotated surface code. Concatenation does not impose additional connectivity constraints and can as much as triple the number of logical qubits per physical qubit when compared to the original surface code. Concatenation with 1D (2D) QMDPC yields codes with twice (four times) the distance. The stabilizer generators of the outer QMDPC code are referred to as yokes in this context. |
| Zero-pi qubit code | A \([[2,(0,2),(2,1)]]_{\mathbb{Z}}\) homological rotor code on the smallest tiling of the projective plane \(\mathbb{R}P^2\). The ideal code can be obtained from a four-rotor Josephson-junction [85] system after a choice of grounding [86]. |
| \((1,3)\) 4D toric code | A generalization of the Kitaev surface code defined on a 4D lattice. The code is called a \((1,3)\) toric code because it admits 1D \(Z\)-type and 3D \(X\)-type logical operators. |
| \((5,1,2)\)-convolutional code | Family of quantum convolutional codes that are 1D lattice generalizations of the five-qubit perfect code, with the former''s lattice-translation symmetry being the extension of the latter''s cyclic permutation symmetry. |
| \(D\)-dimensional twisted toric code | Extension of the Kitaev toric code to higher-dimensional lattices with regular or shifted (a.k.a. twisted) boundary conditions. Such boundary conditions yields quibit geometries that are tori \(\mathbb{R}^D/\Lambda\), where \(\Lambda\) is an arbitrary \(D\)-dimensional lattice. Picking a hypercubic lattice yields the ordinary \(D\)-dimensional toric code. It is conjectured that appropriate twisted boundary conditions yield multi-dimensional toric code families with linear distance and logarithmic-weight stabilizer generators [149]. |
| \(D_4\) hyper-diamond GKP code | Two-mode GKP qudit-into-oscillator code based on the \(D_4\) hyper-diamond lattice. |
| \(U(1)_{2n} \times U(1)_{-2m}\) Chern-Simons GKP code | A non-CSS multimode GKP code defined on a 2D mode lattice that encodes a qudit logical space and whose excitations are characterized by the \(U(1)_{2n} \times U(1)_{-2m}\) Chern-Simons theory. The code can be obtained from the analog surface code by condensing certain anyons [26]. |
| \([[10,1,2]]\) CSS code | Smallest stabilizer code to implement a logical \(T\) gate via application of physical \(T\), \(T^{\dagger}\), and \(CCZ\) gates. |
| \([[10,1,4]]_{G}\) tenfold code | A \([[10,1,4]]_{G}\) group code for finite Abelian \(G\). The code is defined using a graph that is closely related to the \([[5,1,3]]\) code. |
| \([[11,1,5]]\) quantum dodecacode | Eleven-qubit pure stabilizer code that is the smallest qubit stabilizer code to correct two-qubit errors. |
| \([[11,1,5]]_3\) qutrit Golay code | An \([[11,1,5]]_3\) constructed from the ternary Golay code via the CSS construction. The code's stabilizer generator matrix blocks \(H_{X}\) and \(H_{Z}\) are both the generator matrix of the ternary Golay code. |
| \([[12,2,2]]\) CSS code | CSS code that admits a logical \(CS\) gate via application of physical \(T\) and \(T^{\dagger}\) gates. |
| \([[12,2,4]]\) carbon code | Twelve-qubit CSS code resulting from the concatenation of the \([[4,2,2]]\) code and the \(C_6\) code that has simplified fault-tolerant state preparation circuits for the \(00\) and \(++\) states. |
| \([[13,1,5]]\) cyclic code | Thirteen-qubit twisted surface code for which there is a set of stabilizer generators consisting of cyclic permutations of the \(XZZX\)-type Pauli string \(XIZZIXIIIIIII\). The code can be thought of as a small twisted XZZX code [150; Exam. 11 and Fig. 3]. |
| \([[14,3,3]]\) Rhombic dodecahedron surface code | A \([[14,3,3]]\) twist-defect surface code whose qubits lie on the vertices of a rhombic dodecahedron. Its non-CSS nature is due to twist defects [151] stemming from the geometry of the polytope. |
| \([[144,12,12]]\) gross code | A BB code which requires less physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance. The gross code is equivalent to 8 copies of the surface code via a constant-depth Clifford circuit, and is an element of a larger family of 2D stabilizer codes [152]. The name stems from the fact that a gross is a dozen dozen. |
| \([[15, 7, 3]]\) quantum Hamming code | Self-dual quantum Hamming code that admits permutation-based CZ logical gates. The code is constructed using the CSS construction from the \([15,11,3]\) Hamming code and its \([15,4,8]\) dual code. |
| \([[15,1,3]]\) quantum Reed-Muller code | \([[15,1,3]]\) CSS code that is most easily thought of as a tetrahedral 3D color code. |
| \([[16,4,3]]\) dodecahedral code | A \([[16,4,3]]\) qubit stabilizer code defined whose encoder-respecting form is the graph of vertices of a dodecahedron [153]. |
| \([[16,6,4]]\) Tesseract color code | A (self-dual CSS) 4D color code defined on a tesseract, with stabilizer generators of both types supported on each cube. A \([[16,4,2,4]]\) tesseract subsystem code can be obtained from this code by using two logical qubits as gauge qubits [154]. |
| \([[17,1,5]]\) 4.8.8 color code | Seventeen-qubit doubly even 2D color code that admits a transversal implementation of the logical Clifford group. |
| \([[23, 1, 7]]\) Quantum Golay code | A \([[23, 1, 7]]\) self-dual CSS code with eleven stabilizer generators of each type, and with each generator being weight eight. |
| \([[2^D,D,2]]\) hypercube quantum code | Member of a family of codes defined by placing qubits on a \(D\)-dimensional hypercube, \(Z\)-stabilizers on all two-dimensional faces, and an \(X\)-stabilizer on all vertices. These codes realize gates at the \((D-1)\)-st level of the Clifford hierarchy. It can be generalized to a \([[4^D,D,4]]\) error-correcting family [155]. Various other concatenations give families with increasing distance (see cousins). |
| \([[2^r+r, 2^r-r-2, 3]]\) Ring CPC code | A family of \([[2^r+r, 2^r-r-2, 3]]\) CPC codes for \(r \geq 3\) whose matrices are based on the shortened version of the \([2^r-1,2^r-r-1,3]\) Hamming code. See [156; Thm. 4] for their stabilizer generator matrix. |
| \([[2^r, 2^r-r-2, 3]]\) Gottesman code | A family of non-CSS stabilizer codes of distance \(3\) that saturate the asymptotic quantum Hamming bound. |
| \([[2^r-1, 2^r-2r-1, 3]]\) quantum Hamming code | Member of a family of self-dual CCS codes constructed from \([2^r-1,2^r-r-1,3]=C_X=C_Z\) Hamming codes and their duals the simplex codes. The code's stabilizer generator matrix blocks \(H_{X}\) and \(H_{Z}\) are both the generator matrix for a simplex code. The weight of each stabilizer generator is \(2^{r-1}\). |
| \([[2^r-1, 2^r-2r-1, 3]]_p\) quantum Hamming code | A family of CSS codes extending quantum Hamming codes to prime qudits of dimension \(p\) by expressing the qubit code stabilizers in local-dimension-invariant (LDI) form [157]. |
| \([[2^r-1,1,3]]\) simplex code | Member of color-code code family constructed with a punctured first-order RM\((1,m=r)\) \([2^r-1,r+1,2^{r-1}-1]\) code and its even subcode for \(r \geq 3\). Each code transversally implements a diagonal gate at the \((r-1)\)st level of the Clifford hierarchy [158,159]. Each code is a color code defined on a simplex in \(r-1\) dimensions [94,160], where qubits are placed on the vertices, edges, and faces as well as on the simplex itself. |
| \([[2^{2r-1}-1,1,2^r-1]]\) quantum punctured Reed-Muller code | Member of CSS code family constructed with a punctured self-dual RM \([2^r-1,2^{r-1},\sqrt{2}^{r-1}-1]\) code and its even subcode for \(r \geq 2\). |
| \([[2^{m-1},2^{m-1}-m-1,4]]_{f}\) Hamming Majorana code | A member of the \([[2^{m-1},2^{m-1}-m-1,4]]_{f}\) family of Majorana stabilizer codes for \(m \geq 3\) that is closely related to the Hamming code. The logical subspace of the \([[8,3,4]]_{f}\) Hamming Majorana code is a Cartan subspace of the \(E_8\) Lie algebra [161]. |
| \([[2m,2m-2,2]]\) error-detecting code | Self-complementary CSS code for \(m\geq 2\) with generators \(\{XX\cdots X, ZZ\cdots Z\} \) acting on all \(2m\) physical qubits. The code is constructed via the CSS construction from an SPC code and a repetition code [162; Sec. III]. This is the highest-rate distance-two code when an even number of qubits is used [163]. |
| \([[3,1,2]]_3\) Three-qutrit code | A \([[3,1,2]]_3\) prime-qudit CSS code that is the smallest qutrit stabilizer code to detect a single-qutrit error. with stabilizer generators \(ZZZ\) and \(XXX\). The code defines a quantum secret-sharing scheme and serves as a minimal model for the AdS/CFT holographic duality. It is also the smallest non-trivial instance of a quantum maximum distance separable code (QMDS), saturating the quantum Singleton bound. |
| \([[30,8,3]]\) Bring code | A \([[30,8,3]]\) hyperbolic surface code on a quotient of the \(\{5,5\}\) hyperbolic tiling called Bring's curve. Its qubits and stabilizer generators lie on the vertices of the small stellated dodecahedron. Admits a set of weight-five stabilizer generators. |
| \([[3k + 8, k, 2]]\) triorthogonal code | Member of the \([[3k + 8, k, 2]]\) family (for even \(k\)) of triorthogonal and quantum divisible codes that admit a transversal \(T\) gate and are relevant for magic-state distillation. |
| \([[4,2,2]]\) Four-qubit code | Four-qubit CSS stabilizer code is the smallest qubit stabilizer code to detect a single-qubit error. |
| \([[49,1,5]]\) triorthogonal code | Triorthogonal and quantum divisible code which is the smallest distance-five stabilizer code to admit a transversal \(T\) gate [164–166]. Its \(X\)-type stabilizers form a triply even linear binary code in the symplectic representation. |
| \([[5,1,2]]\) rotated surface code | Rotated surface code on one rung of a ladder, with one qubit on the rung, and four qubits surrounding it. |
| \([[5,1,3]]_q\) Galois-qudit code | True stabilizer code that generalizes the five-qubit perfect code to Galois qudits of prime-power dimension \(q=p^m\). It has \(4(m-1)\) stabilizer generators expressed as \(X_{\gamma} Z_{\gamma} Z_{-\gamma} X_{-\gamma} I\) and its cyclic permutations, with \(\gamma\) iterating over basis elements of \(GF(q)\) over \(GF(p)\). |
| \([[5,1,3]]_{\mathbb{R}}\) Braunstein five-mode code | An analog stabilizer version of the five-qubit perfect code, encoding one mode into five and correcting arbitrary errors on any one mode. |
| \([[5,1,3]]_{\mathbb{Z}_q}\) modular-qudit code | Modular-qudit stabilizer code that generalizes the five-qubit perfect code using properties of the multiplicative group \(\mathbb{Z}_q\) [167]; see also [168; Thm. 13]. It has four stabilizer generators consisting of \(X Z Z^\dagger X^\dagger I\) and its cyclic permutations. |
| \([[54,6,5]]\) five-covered icosahedral code | A \([[54,6,5]]\) qubit stabilizer code defined whose encoder-respecting form is the graph of a five-cover of the icosahedron [153]. |
| \([[6,1,3]]\) Six-qubit stabilizer code | One of two six-qubit distance-three codes that are unique up to equivalence [163], with the other code a trivial extension of the five-qubit code [169]. The code admits fault-tolerant syndrome extraction using only one ancilla per stabilizer generator measurement. |
| \([[6,1,3]]_{f}\) Vijay-Fu Majorana code | A Majorana stabilizer code encoding a logical fermion into six physical fermions. This code is the shortest code correcting single fermion-parity flips [170]. |
| \([[6,2,2]]\) \(C_6\) code | Error-detecting self-dual CSS code used in concatenation schemes for fault-tolerant quantum computation. A set of stabilizer generators is \(IIXXXX\) and \(XXIIXX\), together with the same two \(Z\)-type generators. |
| \([[6,2,3]]_{q}\) code | Six-qudit MDS error-detecting code defined for Galois-qudit dimension \(q=3\) [171], \(q=2^2\) [172], and \(q \geq 5\) [118,171]. This code cannot exist for qubits (\(q=2\)). |
| \([[6,4,2]]\) error-detecting code | Error-detecting six-qubit code with rate \(2/3\) whose codewords are cat/GHZ states. A set of stabilizer generators is \(XXXXXX\) and \(ZZZZZZ\). It is the unique code for its parameters, up to equivalence [163; Tab. III]. Concatenations of this code with itself yield the \([[6^r,4^r,2^r]]\) level-\(r\) many-hypercube code [173]. |
| \([[6k+2,3k,2]]\) Campbell-Howard code | Family of \([[6k+2,3k,2]]\) qubit stabilizer codes with quasi-transversal \(CZZ^{\otimes k}\) gates that are relevant to magic-state distillation. |
| \([[6r,2r,2]]\) Ganti-Onunkwo-Young code | A member of the family of \([[6r,2r,2]]\) CSS codes designed to suppress errors in adiabatic quantum computation. All but two of its stabilizer generators are weight-two (two-body), and the remaining two are weight-\(4r\). |
| \([[7,1,3]]\) Steane code | A \([[7,1,3]]\) self-dual CSS code that is the smallest qubit CSS code to correct a single-qubit error [169]. The code is constructed using the classical binary \([7,4,3]\) Hamming code for protecting against both \(X\) and \(Z\) errors. |
| \([[7,1,3]]\) bare code | A \([[7,1,3]]\) code that admits fault-tolerant syndrome extraction using only one ancilla per stabilizer generator measurement. |
| \([[7,1,3]]\) twist-defect surface code | A \([[7,1,3]]\) code (different from the Steane code) that is a small example of a twist-defect surface code. |
| \([[7,3,3]]_{q}\) code | Seven-qudit MDS error-detecting code defined for Galois-qudit dimension \(q=3\) [171] and \(q \geq 7\) [118,171]. This code cannot exist for qubits (\(q=2\)). |
| \([[8, 3, 3]]\) Eight-qubit Gottesman code | Eight-qubit non-degenerate code that can be obtained from a modified CSS construction using the \([8,4,4]\) extended Hamming code and a \([8,7,2]\) even-weight code [174]. The modification introduces signs between the codewords. |
| \([[8,2,2]]\) hyperbolic color code | An \([[8,2,2]]\) hyperbolic color code defined on the projective plane. |
| \([[8,3,2]]\) Smallest interesting color code | Smallest 3D color code whose physical qubits lie on vertices of a cube and which admits a (weakly) transversal \(CCZ\) gate. |
| \([[9,1,3]]\) Shor code | Nine-qubit CSS code that is the first quantum error-correcting code. |
| \([[9,1,3]]\) Surface-17 code | A \([[9,1,3]]\) rotated surface code named for the sum of its 9 data qubits and 8 syndrome qubits. It uses the smallest number of qubits to perform fault-tolerant error correction on a surface code with parallel syndrome extraction. |
| \([[9,1,3]]_{\mathbb{R}}\) Lloyd-Slotine code | An analog stabilizer version of Shor's nine-qubit code, encoding one mode into nine and correcting arbitrary errors on any one mode. |
| \([[9,1,3]]_{\mathbb{Z}_q}\) modular-qudit code | Modular-qudit CSS code that generalizes the \([[9,1,3]]\) Shor code using properties of the multiplicative group \(\mathbb{Z}_q\). |
| \([[9,1,5]]_3\) quantum Glynn code | Nine-qutrit pure Hermitian code that is the smallest qutrit stabilizer code to correct two-qutrit errors. |
| \([[9m-k,k,2]]_3\) triorthogonal code | Member of the \([[9m-k,k,2]]_3\) family of triorthogonal qutrit codes (for \(k\leq 3m-2\)) that admit a transversal diagonal gate in the third level of the qudit Clifford hierarchy and that are relevant for magic-state distillation. |
| \([[k+4,k,2]]\) H code | Family of \([[k+4,k,2]]\) self-dual CSS codes (for even \(k\)) with transversal Hadamard gates that are relevant to magic state distillation. The four stablizer generators are \(X_1X_2X_3X_4\), \(Z_1Z_2Z_3Z_4\), \(X_1X_2X_5X_6...X_{k+4}\), and \(Z_1Z_2Z_5Z_6...Z_{k+4}\).' |
| \([[m 2^m / (m+1), 2^m / (m+1), 2\lfloor m/4 \rfloor + 1]]\) Khesin-Lu-Shor code | A family of \([[m 2^m / (m+1), 2^m / (m+1),]]\) qubit CSS codes derived from the Hamming code. Their encoder-respecting form is the graph of a hypercube in \(m = 2^r - 1\) dimensions, and input nodes in the graph are codewords of the \([2^r-1,2^r-r-1,3]\) Hamming code [153]. |
| \(k\)-orthogonal code | Qubit stabilizer code whose \(X\)-type logicals and generators form a \(k\)-orthogonal matrix (defined below) in the symplectic representation. In other words, the overlap between any \(k\) \(X\)-type code-preserving Paulis (including the identity) is even. The original definition is for qubit CSS codes [95], but it can be extended to more general qubit stabilizer codes [175; Def. 1]. This entry is formulated for qubits, but an extension exists for modular qudits [95]. |
References
- [1]
- Y.-A. Chen and Y. Xu, “Equivalence between Fermion-to-Qubit Mappings in two Spatial Dimensions”, PRX Quantum 4, (2023) arXiv:2201.05153 DOI
- [2]
- L. Fidkowski, J. Haah, and M. B. Hastings, “Gravitational anomaly of (3+1) -dimensional Z2 toric code with fermionic charges and fermionic loop self-statistics”, Physical Review B 106, (2022) arXiv:2110.14654 DOI
- [3]
- A. Dua, I. H. Kim, M. Cheng, and D. J. Williamson, “Sorting topological stabilizer models in three dimensions”, Physical Review B 100, (2019) arXiv:1908.08049 DOI
- [4]
- S. Ryu, “Three-dimensional topological phase on the diamond lattice”, Physical Review B 79, (2009) arXiv:0811.2036 DOI
- [5]
- S. Mandal and N. Surendran, “Exactly solvable Kitaev model in three dimensions”, Physical Review B 79, (2009) arXiv:0801.0229 DOI
- [6]
- P. Panteleev and G. Kalachev, “Quantum LDPC Codes With Almost Linear Minimum Distance”, IEEE Transactions on Information Theory 68, 213 (2022) arXiv:2012.04068 DOI
- [7]
- T. D. Ellison, Y.-A. Chen, A. Dua, W. Shirley, N. Tantivasadakarn, and D. J. Williamson, “Pauli Stabilizer Models of Twisted Quantum Doubles”, PRX Quantum 3, (2022) arXiv:2112.11394 DOI
- [8]
- J. C. Magdalena de la Fuente, N. Tarantino, and J. Eisert, “Non-Pauli topological stabilizer codes from twisted quantum doubles”, Quantum 5, 398 (2021) arXiv:2001.11516 DOI
- [9]
- J. I. Kwon, A. J. Brady, and V. V. Albert, “Most continuous-variable cluster states are too entangled to be useless”, (2025) arXiv:2503.15698
- [10]
- G. Evenbly and G. Vidal, “Class of Highly Entangled Many-Body States that can be Efficiently Simulated”, Physical Review Letters 112, (2014) arXiv:1210.1895 DOI
- [11]
- K. Setia, S. Bravyi, A. Mezzacapo, and J. D. Whitfield, “Superfast encodings for fermionic quantum simulation”, Physical Review Research 1, (2019) arXiv:1810.05274 DOI
- [12]
- P. M. Fenwick, “A new data structure for cumulative frequency tables”, Software: Practice and Experience 24, 327 (1994) DOI
- [13]
- V. Havlíček, M. Troyer, and J. D. Whitfield, “Operator locality in the quantum simulation of fermionic models”, Physical Review A 95, (2017) arXiv:1701.07072 DOI
- [14]
- A. Y. Vlasov, “Clifford Algebras, Spin Groups and Qubit Trees”, Quanta 11, 97 (2022) arXiv:1904.09912 DOI
- [15]
- E. Camps-Moreno, H. H. López, G. L. Matthews, D. Ruano, R. San-José, and I. Soprunov, “An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance”, Quantum Information Processing 23, (2024) arXiv:2312.17518 DOI
- [16]
- J. Haah, “Clifford quantum cellular automata: Trivial group in 2D and Witt group in 3D”, Journal of Mathematical Physics 62, (2021) arXiv:1907.02075 DOI
- [17]
- W. Shirley, Y.-A. Chen, A. Dua, T. D. Ellison, N. Tantivasadakarn, and D. J. Williamson, “Three-Dimensional Quantum Cellular Automata from Chiral Semion Surface Topological Order and beyond”, PRX Quantum 3, (2022) arXiv:2202.05442 DOI
- [18]
- C. W. von Keyserlingk, F. J. Burnell, and S. H. Simon, “Three-dimensional topological lattice models with surface anyons”, Physical Review B 87, (2013) arXiv:1208.5128 DOI
- [19]
- 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
- [20]
- D. Ostrev, “Quantum LDPC Codes From Intersecting Subsets”, IEEE Transactions on Information Theory 70, 5692 (2024) arXiv:2306.06056 DOI
- [21]
- R. Raussendorf, D. Browne, and H. Briegel, “The one-way quantum computer--a non-network model of quantum computation”, Journal of Modern Optics 49, 1299 (2002) arXiv:quant-ph/0108118 DOI
- [22]
- R. Raussendorf and H. J. Briegel, “A One-Way Quantum Computer”, Physical Review Letters 86, 5188 (2001) DOI
- [23]
- B. Coecke and R. Duncan, “Interacting Quantum Observables”, Automata, Languages and Programming 298 DOI
- [24]
- B. Coecke and R. Duncan, “Interacting quantum observables: categorical algebra and diagrammatics”, New Journal of Physics 13, 043016 (2011) arXiv:0906.4725 DOI
- [25]
- J. Roffe, D. Headley, N. Chancellor, D. Horsman, and V. Kendon, “Protecting quantum memories using coherent parity check codes”, Quantum Science and Technology 3, 035010 (2018) arXiv:1709.01866 DOI
- [26]
- J. C. M. de la Fuente, T. D. Ellison, M. Cheng, and D. J. Williamson, “Topological stabilizer models on continuous variables”, (2025) arXiv:2411.04993
- [27]
- E. Knill, R. Laflamme, and W. H. Zurek, “Resilient quantum computation: error models and thresholds”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454, 365 (1998) arXiv:quant-ph/9702058 DOI
- [28]
- A. M. Steane, “Efficient fault-tolerant quantum computing”, Nature 399, 124 (1999) arXiv:quant-ph/9809054 DOI
- [29]
- A. M. Steane, “Overhead and noise threshold of fault-tolerant quantum error correction”, Physical Review A 68, (2003) arXiv:quant-ph/0207119 DOI
- [30]
- K. M. Svore, B. M. Terhal, and D. P. DiVincenzo, “Local fault-tolerant quantum computation”, Physical Review A 72, (2005) arXiv:quant-ph/0410047 DOI
- [31]
- K. M. Svore, D. P. DiVincenzo, and B. M. Terhal, “Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice Architecture”, (2006) arXiv:quant-ph/0604090
- [32]
- C. Derby, J. Klassen, J. Bausch, and T. Cubitt, “Compact fermion to qubit mappings”, Physical Review B 104, (2021) arXiv:2003.06939 DOI
- [33]
- L. Clinton, T. Cubitt, B. Flynn, F. M. Gambetta, J. Klassen, A. Montanaro, S. Piddock, R. A. Santos, and E. Sheridan, “Towards near-term quantum simulation of materials”, Nature Communications 15, (2024) arXiv:2205.15256 DOI
- [34]
- M. B. Hastings, “Weight Reduction for Quantum Codes”, (2016) arXiv:1611.03790
- [35]
- S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the \(\sqrt{n}\) distance barrier using high dimensional expanders”, (2020) arXiv:2004.07935
- [36]
- T. D. Ellison, Y.-A. Chen, A. Dua, W. Shirley, N. Tantivasadakarn, and D. J. Williamson, “Pauli topological subsystem codes from Abelian anyon theories”, Quantum 7, 1137 (2023) arXiv:2211.03798 DOI
- [37]
- M. A. Levin and X.-G. Wen, “String-net condensation: A physical mechanism for topological phases”, Physical Review B 71, (2005) arXiv:cond-mat/0404617 DOI
- [38]
- M. H. Freedman and M. B. Hastings, “Double Semions in Arbitrary Dimension”, Communications in Mathematical Physics 347, 389 (2016) arXiv:1507.05676 DOI
- [39]
- G. Dauphinais, L. Ortiz, S. Varona, and M. A. Martin-Delgado, “Quantum error correction with the semion code”, New Journal of Physics 21, 053035 (2019) arXiv:1810.08204 DOI
- [40]
- S. Hoory, N. Linial, and A. Wigderson, “Expander graphs and their applications”, Bulletin of the American Mathematical Society 43, 439 (2006) DOI
- [41]
- J. Farinholt, “Quantum LDPC Codes Constructed from Point-Line Subsets of the Finite Projective Plane”, (2012) arXiv:1207.0732
- [42]
- B. Audoux and A. Couvreur, “On tensor products of CSS Codes”, (2018) arXiv:1512.07081
- [43]
- C. G. Brell, “A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)”, New Journal of Physics 18, 013050 (2016) arXiv:1411.7046 DOI
- [44]
- A. Vezzani, “Spontaneous magnetization of the Ising model on the Sierpinski carpet fractal, a rigorous result”, Journal of Physics A: Mathematical and General 36, 1593 (2003) arXiv:cond-mat/0212497 DOI
- [45]
- R. Campari and D. Cassi, “Generalization of the Peierls-Griffiths theorem for the Ising model on graphs”, Physical Review E 81, (2010) arXiv:1002.1227 DOI
- [46]
- M. Shinoda, “Existence of phase transition of percolation on Sierpiński carpet lattices”, Journal of Applied Probability 39, 1 (2002) DOI
- [47]
- M. H. Freedman, “Z\({}_{\text{2}}\)–Systolic-Freedom”, Geometry & Topology Monographs 113 (1999) DOI
- [48]
- E. Fetaya, “Bounding the distance of quantum surface codes”, Journal of Mathematical Physics 53, (2012) DOI
- [49]
- N. C. Menicucci, “Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States”, Physical Review Letters 112, (2014) arXiv:1310.7596 DOI
- [50]
- J. E. Bourassa et al., “Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer”, Quantum 5, 392 (2021) arXiv:2010.02905 DOI
- [51]
- K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, “High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction”, Physical Review X 8, (2018) arXiv:1712.00294 DOI
- [52]
- I. Tzitrin, T. Matsuura, R. N. Alexander, G. Dauphinais, J. E. Bourassa, K. K. Sabapathy, N. C. Menicucci, and I. Dhand, “Fault-Tolerant Quantum Computation with Static Linear Optics”, PRX Quantum 2, (2021) arXiv:2104.03241 DOI
- [53]
- C. Vuillot, H. Asasi, Y. Wang, L. P. Pryadko, and B. M. Terhal, “Quantum error correction with the toric Gottesman-Kitaev-Preskill code”, Physical Review A 99, (2019) arXiv:1810.00047 DOI
- [54]
- K. Noh and C. Chamberland, “Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code”, Physical Review A 101, (2020) arXiv:1908.03579 DOI
- [55]
- M. V. Larsen, C. Chamberland, K. Noh, J. S. Neergaard-Nielsen, and U. L. Andersen, “Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture”, PRX Quantum 2, (2021) arXiv:2101.03014 DOI
- [56]
- K. Noh, C. Chamberland, and F. G. S. L. Brandão, “Low-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code”, PRX Quantum 3, (2022) arXiv:2103.06994 DOI
- [57]
- M. Lin, C. Chamberland, and K. Noh, “Closest Lattice Point Decoding for Multimode Gottesman-Kitaev-Preskill Codes”, PRX Quantum 4, (2023) arXiv:2303.04702 DOI
- [58]
- J. Zhang, Y.-C. Wu, and G.-P. Guo, “Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code”, Physical Review A 107, (2023) arXiv:2207.04383 DOI
- [59]
- G. G. La Guardia and R. Palazzo Jr., “Constructions of new families of nonbinary CSS codes”, Discrete Mathematics 310, 2935 (2010) DOI
- [60]
- G. G. La Guardia, “Constructions of new families of nonbinary quantum codes”, Physical Review A 80, (2009) DOI
- [61]
- L. Jin and C. Xing, “A Construction of New Quantum MDS Codes”, (2020) arXiv:1311.3009
- [62]
- X. Liu, L. Yu, and H. Liu, “New quantum codes from Hermitian dual-containing codes”, International Journal of Quantum Information 17, 1950006 (2019) DOI
- [63]
- L. Jin, S. Ling, J. Luo, and C. Xing, “Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes”, IEEE Transactions on Information Theory 56, 4735 (2010) DOI
- [64]
- D. Aharonov and M. Ben-Or, “Fault-Tolerant Quantum Computation With Constant Error Rate”, (1999) arXiv:quant-ph/9906129
- [65]
- Z. Li, L.-J. Xing, and X.-M. Wang, “Quantum generalized Reed-Solomon codes: Unified framework for quantum maximum-distance-separable codes”, Physical Review A 77, (2008) arXiv:0812.4514 DOI
- [66]
- C.-Y. Lai and C.-C. Lu, “A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices”, IEEE Transactions on Information Theory 57, 7163 (2011) arXiv:0712.0103 DOI
- [67]
- D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-Graph Codes for Quantum Error Correction”, IEEE Transactions on Information Theory 50, 2315 (2004) arXiv:quant-ph/0304161 DOI
- [68]
- J. Haah, “Towers of generalized divisible quantum codes”, Physical Review A 97, (2018) arXiv:1709.08658 DOI
- [69]
- J. Conrad, The Fabulous World of GKP Codes, Freie Universität Berlin, 2024 arXiv:2412.02442 DOI
- [70]
- D. Schlingemann and R. F. Werner, “Quantum error-correcting codes associated with graphs”, Physical Review A 65, (2001) arXiv:quant-ph/0012111 DOI
- [71]
- M. Grassl, A. Klappenecker, and M. Rotteler, “Graphs, quadratic forms, and quantum codes”, Proceedings IEEE International Symposium on Information Theory, 45 arXiv:quant-ph/0703112 DOI
- [72]
- Y. Hwang and J. Heo, “On the relation between a graph code and a graph state”, (2015) arXiv:1511.05647
- [73]
- P. Hayden and A. May, “Summoning information in spacetime, or where and when can a qubit be?”, Journal of Physics A: Mathematical and Theoretical 49, 175304 (2016) arXiv:1210.0913 DOI
- [74]
- N. Delfosse, M. E. Beverland, and M. A. Tremblay, “Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes”, (2021) arXiv:2109.14599
- [75]
- N. Baspin, O. Fawzi, and A. Shayeghi, “A lower bound on the overhead of quantum error correction in low dimensions”, (2023) arXiv:2302.04317
- [76]
- A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan graphs”, Combinatorica 8, 261 (1988) DOI
- [77]
- G. Davidoff, P. Sarnak, and A. Valette, Elementary Number Theory, Group Theory and Ramanujan Graphs (Cambridge University Press, 2001) DOI
- [78]
- E. B. da Silva and W. S. Soares Jr, “Hyperbolic quantum color codes”, (2018) arXiv:1804.06382
- [79]
- N. Delfosse, “Tradeoffs for reliable quantum information storage in surface codes and color codes”, 2013 IEEE International Symposium on Information Theory 917 (2013) arXiv:1301.6588 DOI
- [80]
- H. Bombin and M. A. Martin-Delgado, “Exact topological quantum order inD=3and beyond: Branyons and brane-net condensates”, Physical Review B 75, (2007) arXiv:cond-mat/0607736 DOI
- [81]
- C. Vuillot and N. P. Breuckmann, “Quantum Pin Codes”, IEEE Transactions on Information Theory 68, 5955 (2022) arXiv:1906.11394 DOI
- [82]
- W. Zeng and L. P. Pryadko, “Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates”, Physical Review Letters 122, (2019) arXiv:1810.01519 DOI
- [83]
- G. Evenbly, “Hyperinvariant Tensor Networks and Holography”, Physical Review Letters 119, (2017) arXiv:1704.04229 DOI
- [84]
- A. Schuckert, E. Crane, A. V. Gorshkov, M. Hafezi, and M. J. Gullans, “Fermion-qubit fault-tolerant quantum computing”, (2024) arXiv:2411.08955
- [85]
- S. M. Girvin, “Circuit QED: superconducting qubits coupled to microwave photons”, Quantum Machines: Measurement and Control of Engineered Quantum Systems 113 (2014) DOI
- [86]
- C. Vuillot, A. Ciani, and B. M. Terhal, “Homological Quantum Rotor Codes: Logical Qubits from Torsion”, Communications in Mathematical Physics 405, (2024) arXiv:2303.13723 DOI
- [87]
- E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI
- [88]
- R. Alicki, M. Horodecki, P. Horodecki, and R. Horodecki, “On thermal stability of topological qubit in Kitaev’s 4D model”, (2008) arXiv:0811.0033
- [89]
- M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, “Randomness conductors and constant-degree lossless expanders”, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing 659 (2002) DOI
- [90]
- T.-C. Lin and M.-H. Hsieh, “\(c^3\)-Locally Testable Codes from Lossless Expanders”, (2022) arXiv:2201.11369
- [91]
- T.-C. Lin and M.-H. Hsieh, “Good quantum LDPC codes with linear time decoder from lossless expanders”, (2022) arXiv:2203.03581
- [92]
- D. Litinski and F. von Oppen, “Quantum computing with Majorana fermion codes”, Physical Review B 97, (2018) arXiv:1801.08143 DOI
- [93]
- 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
- [94]
- H. Bombin, “Gauge Color Codes: Optimal Transversal Gates and Gauge Fixing in Topological Stabilizer Codes”, (2015) arXiv:1311.0879
- [95]
- F. H. E. Watson, E. T. Campbell, H. Anwar, and D. E. Browne, “Qudit color codes and gauge color codes in all spatial dimensions”, Physical Review A 92, (2015) arXiv:1503.08800 DOI
- [96]
- A. Yu. Kitaev, “Fault-tolerant quantum computation by anyons”, Annals of Physics 303, 2 (2003) arXiv:quant-ph/9707021 DOI
- [97]
- S. S. Bullock and G. K. Brennen, “Qudit surface codes and gauge theory with finite cyclic groups”, Journal of Physics A: Mathematical and Theoretical 40, 3481 (2007) arXiv:quant-ph/0609070 DOI
- [98]
- H. Watanabe, M. Cheng, and Y. Fuji, “Ground state degeneracy on torus in a family of ZN toric code”, Journal of Mathematical Physics 64, (2023) arXiv:2211.00299 DOI
- [99]
- J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: A ring-based public key cryptosystem”, Lecture Notes in Computer Science 267 (1998) DOI
- [100]
- T. J. Osborne and D. E. Stiegemann, “Dynamics for holographic codes”, Journal of High Energy Physics 2020, (2020) arXiv:1706.08823 DOI
- [101]
- J. Cotler and A. Strominger, “The Universe as a Quantum Encoder”, (2022) arXiv:2201.11658
- [102]
- M. Taylor and C. Woodward, “Holography, cellulations and error correcting codes”, (2023) arXiv:2112.12468
- [103]
- W. Donnelly, D. Marolf, B. Michel, and J. Wien, “Living on the edge: a toy model for holographic reconstruction of algebras with centers”, Journal of High Energy Physics 2017, (2017) arXiv:1611.05841 DOI
- [104]
- 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
- [105]
- D. Harlow and H. Ooguri, “Symmetries in quantum field theory and quantum gravity”, (2019) arXiv:1810.05338
- [106]
- E. T. Campbell, H. Anwar, and D. E. Browne, “Magic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes”, Physical Review X 2, (2012) arXiv:1205.3104 DOI
- [107]
- E. T. Campbell, “Enhanced Fault-Tolerant Quantum Computing ind-Level Systems”, Physical Review Letters 113, (2014) arXiv:1406.3055 DOI
- [108]
- A. Krishna and J.-P. Tillich, “Towards Low Overhead Magic State Distillation”, Physical Review Letters 123, (2019) arXiv:1811.08461 DOI
- [109]
- S. Prakash and T. Saha, “Low Overhead Qutrit Magic State Distillation”, (2024) arXiv:2403.06228
- [110]
- H. Barnum, C. Crepeau, D. Gottesman, A. Smith, and A. Tapp, “Authentication of quantum messages”, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. arXiv:quant-ph/0205128 DOI
- [111]
- A. Ashikhmin and E. Knill, “Nonbinary quantum stabilizer codes”, IEEE Transactions on Information Theory 47, 3065 (2001) DOI
- [112]
- A. Niehage, “Quantum Goppa Codes over Hyperelliptic Curves”, (2005) arXiv:quant-ph/0501074
- [113]
- D. Gottesman. Surviving as a quantum computer in a classical world (2024) URL
- [114]
- Q. T. Nguyen, “Good binary quantum codes with transversal CCZ gate”, (2024) arXiv:2408.10140
- [115]
- L. Golowich and V. Guruswami, “Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates”, (2024) arXiv:2408.09254
- [116]
- L. Golowich and V. Guruswami, “Quantum Locally Recoverable Codes”, (2023) arXiv:2311.08653
- [117]
- O. Å. Mostad, E. Rosnes, and H.-Y. Lin, “Generalizing Quantum Tanner Codes”, (2024) arXiv:2405.07980
- [118]
- A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, “Nonbinary stabilizer codes over finite fields”, (2005) arXiv:quant-ph/0508070
- [119]
- M. Hagiwara, K. Kasai, H. Imai, and K. Sakaniwa, “Spatially Coupled Quasi-Cyclic Quantum LDPC Codes”, (2011) arXiv:1102.3181
- [120]
- S. Yang and R. Calderbank, “Spatially-Coupled QLDPC Codes”, Quantum 9, 1693 (2025) arXiv:2305.00137 DOI
- [121]
- D. Poulin, J.-P. Tillich, and H. Ollivier, “Quantum serial turbo-codes”, (2009) arXiv:0712.2888
- [122]
- M. Hagiwara and H. Imai, “Quantum Quasi-Cyclic LDPC Codes”, 2007 IEEE International Symposium on Information Theory 806 (2007) arXiv:quant-ph/0701020 DOI
- [123]
- K. Kasai, M. Hagiwara, H. Imai, and K. Sakaniwa, “Quantum Error Correction Beyond the Bounded Distance Decoding Limit”, IEEE Transactions on Information Theory 58, 1223 (2012) arXiv:1007.1778 DOI
- [124]
- D. Leung and G. Smith, “Communicating over adversarial quantum channels using quantum list codes”, (2007) arXiv:quant-ph/0605086
- [125]
- T. Bergamaschi, L. Golowich, and S. Gunn, “Approaching the Quantum Singleton Bound with Approximate Error Correction”, (2022) arXiv:2212.09935
- [126]
- H. Q. Dinh, T. Bag, A. K. Upadhyay, R. Bandi, and R. Tansuchat, “A class of skew cyclic codes and application in quantum codes construction”, Discrete Mathematics 344, 112189 (2021) DOI
- [127]
- M. Ashraf and G. Mohammad, “Quantum codes over Fp from cyclic codes over Fp[u, v]/〈u2 − 1, v3 − v, uv − vu〉”, Cryptography and Communications 11, 325 (2018) DOI
- [128]
- A. Kubica, M. E. Beverland, F. Brandão, J. Preskill, and K. M. Svore, “Three-Dimensional Color Code Thresholds via Statistical-Mechanical Mapping”, Physical Review Letters 120, (2018) arXiv:1708.07131 DOI
- [129]
- A. Kitaev, “Anyons in an exactly solved model and beyond”, Annals of Physics 321, 2 (2006) arXiv:cond-mat/0506438 DOI
- [130]
- A. Chapman and S. T. Flammia, “Characterization of solvable spin models via graph invariants”, Quantum 4, 278 (2020) arXiv:2003.05465 DOI
- [131]
- S. J. Elman, A. Chapman, and S. T. Flammia, “Free Fermions Behind the Disguise”, Communications in Mathematical Physics 388, 969 (2021) arXiv:2012.07857 DOI
- [132]
- F. J. Burnell, X. Chen, L. Fidkowski, and A. Vishwanath, “Exactly soluble model of a three-dimensional symmetry-protected topological phase of bosons with surface topological order”, Physical Review B 90, (2014) arXiv:1302.7072 DOI
- [133]
- S. Roberts and D. J. Williamson, “3-Fermion Topological Quantum Computation”, PRX Quantum 5, (2024) arXiv:2011.04693 DOI
- [134]
- N. P. Breuckmann and J. N. Eberhardt, “Balanced Product Quantum Codes”, IEEE Transactions on Information Theory 67, 6653 (2021) arXiv:2012.09271 DOI
- [135]
- K. Fujii and K. Yamamoto, “Topological one-way quantum computation on verified logical cluster states”, Physical Review A 82, (2010) arXiv:1008.2048 DOI
- [136]
- K. Fujii and Y. Tokunaga, “Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates”, Physical Review Letters 105, (2010) arXiv:1008.3752 DOI
- [137]
- S. Burton, E. Durso-Sabina, and N. C. Brown, “Genons, Double Covers and Fault-tolerant Clifford Gates”, (2024) arXiv:2406.09951
- [138]
- A. Robertson, C. Granade, S. D. Bartlett, and S. T. Flammia, “Tailored Codes for Small Quantum Memories”, Physical Review Applied 8, (2017) arXiv:1703.08179 DOI
- [139]
- Q. Xu, N. Mannucci, A. Seif, A. Kubica, S. T. Flammia, and L. Jiang, “Tailored XZZX codes for biased noise”, (2022) arXiv:2203.16486
- [140]
- A. A. Kovalev and L. P. Pryadko, “Quantum Kronecker sum-product low-density parity-check codes with finite rate”, Physical Review A 88, (2013) arXiv:1212.6703 DOI
- [141]
- M. Levin and Z.-C. Gu, “Braiding statistics approach to symmetry-protected topological phases”, Physical Review B 86, (2012) arXiv:1202.3120 DOI
- [142]
- 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
- [143]
- W. Shirley, K. Slagle, and X. Chen, “Foliated fracton order from gauging subsystem symmetries”, SciPost Physics 6, (2019) arXiv:1806.08679 DOI
- [144]
- H. Ma, E. Lake, X. Chen, and M. Hermele, “Fracton topological order via coupled layers”, Physical Review B 95, (2017) arXiv:1701.00747 DOI
- [145]
- W. Shirley, K. Slagle, and X. Chen, “Fractional excitations in foliated fracton phases”, Annals of Physics 410, 167922 (2019) arXiv:1806.08625 DOI
- [146]
- T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes II. Product constructions”, (2024) arXiv:2402.16831
- [147]
- K. Tiurev, A. Pesah, P.-J. H. S. Derks, J. Roffe, J. Eisert, M. S. Kesselring, and J.-M. Reiner, “Domain Wall Color Code”, Physical Review Letters 133, (2024) arXiv:2307.00054 DOI
- [148]
- Z. Liang, Z. Yi, F. Yang, J. Chen, Z. Wang, and X. Wang, “High-dimensional quantum XYZ product codes for biased noise”, (2024) arXiv:2408.03123
- [149]
- M. B. Hastings, “Quantum Codes from High-Dimensional Manifolds”, (2016) arXiv:1608.05089
- [150]
- A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design of additive quantum codes via the code-word-stabilized framework”, Physical Review A 84, (2011) arXiv:1108.5490 DOI
- [151]
- H. Bombin, “Topological Order with a Twist: Ising Anyons from an Abelian Model”, Physical Review Letters 105, (2010) arXiv:1004.1838 DOI
- [152]
- Z. Liang, B. Yang, J. T. Iosue, and Y.-A. Chen, “Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes”, (2024) arXiv:2410.11942
- [153]
- A. B. Khesin, J. Z. Lu, and P. W. Shor, “Universal graph representation of stabilizer codes”, (2025) arXiv:2411.14448
- [154]
- B. W. Reichardt et al., “Demonstration of quantum computation and error correction with a tesseract code”, (2024) arXiv:2409.04628
- [155]
- D. Hangleiter, M. Kalinowski, D. Bluvstein, M. Cain, N. Maskara, X. Gao, A. Kubica, M. D. Lukin, and M. J. Gullans, “Fault-tolerant compiling of classically hard IQP circuits on hypercubes”, (2025) arXiv:2404.19005
- [156]
- 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
- [157]
- A. J. Moorthy and L. G. Gunderman, “Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise”, (2021) arXiv:2110.11510
- [158]
- B. Zeng, H. Chung, A. W. Cross, and I. L. Chuang, “Local unitary versus local Clifford equivalence of stabilizer and graph states”, Physical Review A 75, (2007) arXiv:quant-ph/0611214 DOI
- [159]
- S. X. Cui, D. Gottesman, and A. Krishna, “Diagonal gates in the Clifford hierarchy”, Physical Review A 95, (2017) arXiv:1608.06596 DOI
- [160]
- B. J. Brown, N. H. Nickerson, and D. E. Browne, “Fault-tolerant error correction with the gauge color code”, Nature Communications 7, (2016) arXiv:1503.08217 DOI
- [161]
- P. Lévay and F. Holweck, “A fermionic code related to the exceptional group E \({}_{\text{8}}\)”, Journal of Physics A: Mathematical and Theoretical 51, 325301 (2018) arXiv:1801.06998 DOI
- [162]
- N. Rengaswamy, R. Calderbank, H. D. Pfister, and S. Kadhe, “Synthesis of Logical Clifford Operators via Symplectic Geometry”, 2018 IEEE International Symposium on Information Theory (ISIT) 791 (2018) arXiv:1803.06987 DOI
- [163]
- A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum Error Correction via Codes over GF(4)”, (1997) arXiv:quant-ph/9608006
- [164]
- K. Betsumiya and A. Munemasa, “On triply even binary codes”, Journal of the London Mathematical Society 86, 1 (2012) arXiv:1012.4134 DOI
- [165]
- S. Bravyi and J. Haah, “Magic-state distillation with low overhead”, Physical Review A 86, (2012) arXiv:1209.2426 DOI
- [166]
- K. Betsumiya and A. Munemasa, “On triply even binary codes”, Journal of the London Mathematical Society 86, 1 (2012) DOI
- [167]
- H. F. Chau, “Five quantum register error correction code for higher spin systems”, Physical Review A 56, R1 (1997) arXiv:quant-ph/9702033 DOI
- [168]
- E. M. Rains, “Nonbinary quantum codes”, (1997) arXiv:quant-ph/9703048
- [169]
- B. Shaw, M. M. Wilde, O. Oreshkov, I. Kremsky, and D. A. Lidar, “Encoding one logical qubit into six physical qubits”, Physical Review A 78, (2008) arXiv:0803.1495 DOI
- [170]
- S. Vijay and L. Fu, “Quantum Error Correction for Complex and Majorana Fermion Qubits”, (2017) arXiv:1703.00459
- [171]
- Keqin Feng, “Quantum codes [[6, 2, 3]]/sub p/ and [[7, 3, 3]]/sub p/ (p ≥ 3) exist”, IEEE Transactions on Information Theory 48, 2384 (2002) DOI
- [172]
- Z. Wang, S. Yu, H. Fan, and C. H. Oh, “Quantum error-correcting codes over mixed alphabets”, Physical Review A 88, (2013) arXiv:1205.4253 DOI
- [173]
- H. Goto, “High-performance fault-tolerant quantum computing with many-hypercube codes”, Science Advances 10, (2024) arXiv:2403.16054 DOI
- [174]
- A. M. Steane, “Simple quantum error-correcting codes”, Physical Review A 54, 4741 (1996) arXiv:quant-ph/9605021 DOI
- [175]
- S. Koutsioumpas, D. Banfield, and A. Kay, “The Smallest Code with Transversal T”, (2022) arXiv:2210.14066