Here is a list of generalized homological product codes.

[Jump to code graph excerpt]

Code Description
2D color code Color code defined on a graph embedded in a two-dimensional surface. 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 are 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).
3D color code Color code defined on a four-valent, four-colorable 3-colex in a 3-manifold. In the original colex realization, qubits sit on vertices, \(X\)-type stabilizers are attached to 3-cells, and \(Z\)-type stabilizers are attached to faces [1].
3D surface code A generalization of the Kitaev surface code defined on a 3D cubic lattice. Qubits are placed on edges, \(Z\)-type stabilizer generators are placed on square plaquettes oriented in all three directions, and \(X\)-type stabilizers are placed on the six edges neighboring every vertex [2].
Abelian LP code A lifted-product code whose lift group \(G\) is Abelian. The one-by-one (scalar) case, built from a pair of single group-algebra elements \(a,b \in \mathbb{F}_q[G]\), yields Abelian 2BGA codes. The scalar case with cyclic \(G\) yields GB codes, whereas general cyclic lifts yield quasi-cyclic LP codes [3; Sec. III.E]. A particular family with \(G=\mathbb{Z}_{\ell}\) yields codes with parameters \([[n,k=\Theta(\log n),d=\Theta(n/\log n)]]\) [3].
Abelian two-block group-algebra code A 2BGA code LP\((a,b)\) whose group \(G\) is Abelian, equivalently a multi-dimensional index-two quasi-cyclic code. Since any finite Abelian group is a direct product of cyclic groups, the group algebra elements \(a\) and \(b\) can be treated as multivariate polynomials. The family includes GB (one variable), bivariate bicycle (two variables), and higher-variable codes, providing some of the best known short codes with small stabilizer weights.
Anisotropic \(\mathbb{Z}_2\) Laplacian model code A graph-based analogue of a Type-I fracton phase with lineon-like restricted mobility [4,5].
BB5 code A BB code with weight-five stabilizer generators (contrasting with the weight-six checks of standard BB codes), designed and benchmarked for long chains of trapped ions [6].
Balanced product (BP) code Family of CSS quantum codes obtained from two classical-code chain complexes that share a common group symmetry. The balanced product can be understood as taking the usual tensor or hypergraph product and then quotienting by the shared symmetry action. This can reduce the overall number of physical qubits \(n\) while, in favorable cases, preserving the number of encoded qubits and the code distance, thereby improving the encoding rate \(k/n\) and normalized distance \(d/n\) compared to the underlying tensor or hypergraph product.
Bicycle code An even-length CSS code whose stabilizer generator matrix blocks are \(H_{X}=H_{Z}=(A|A^T)\), where \(A\) is a sparse circulant matrix. The fact that \(A\) commutes with its transpose ensures that the CSS condition is satisfied. Bicycle codes were among the first QLDPC code families [7; Sec. III].
Bivariate bicycle (BB) code Two-block CSS code on \(n=2\ell m\) qubits with check matrices \(H_X=[A|B]\) and \(H_Z=[B^T|A^T]\) [8; Sec. 4]. Here, \(A\) and \(B\) are polynomials in two commuting cyclic shifts \(x\) and \(y\) of orders \(\ell\) and \(m\). As in the toric code, all checks are shifts of one \(X\)-check and one \(Z\)-check on a two-dimensional periodic grid [8; Sec. 3].
Campbell double homological product code A multi-dimensional HGP code derived from two applications of the hypergraph product to a classical code, resulting in a length-\(4\) chain complex. The construction method allows for the use of two different classical codes as inputs, with Ref. [9] assuming identical input codes for simplicity.
Canonical LP code Binary LP code over a cyclic group \(\mathbb{Z}_{\ell}\) that admits a canonical logical basis, whose operators are base-code codewords laid along the rows and columns of a grid of \(\ell\)-qubit fibers [10; Def. 3.4]. This basis is that of HGP codes with each logical qubit replaced by a cyclic orbit of \(\ell\) logical qubits [10].
Chamon model code A foliated type-I fracton non-CSS code defined on a cubic lattice, with qubits on the even-parity sites and one weight-six stabilizer generator on each odd-parity site [12][11; Eq. (1)].
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 every other cube of the lattice, arranged in a checkerboard pattern. A tetrahedral Ising model can be used to obtain the checkerboard model by gauging [13–22] its subsystem symmetry [15]. In that construction, the checkerboard model is self-dual under exchange of \(X\)- and \(Z\)-type stabilizers, and its composites include dimension-1 and dimension-2 excitations, i.e., lineons and planons in later terminology, with anyonic mutual and self-statistics [15].
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 [23]. This results in a pinning of each mode to the space of periodic functions, which is the Hilbert space of a physical rotor, and can be thought of as compactification of the 2D \(\mathbb{R}\) gauge theory phase realized by the analog surface code.
Cubic honeycomb color code 3D color code defined on a four-colorable bitruncated cubic honeycomb uniform tiling.
Cyclic hypergraph product code Hypergraph product code constructed from two circulant matrices, typically of low weight. The \(\mathrm{C2}\) subfamily is the product of a cyclic LDPC code with itself, while the \(\mathrm{CxR}\) subfamily is the product of the cyclic code with a repetition code [24].
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 CSS codes defined by the degree-\(k\) cochains of a tensor-product sheaf on a \(t\)-dimensional cubical complex [25]. The complexes are \(t\)-order extensions of those underlying expander codes (\(t=1\)) and expander lifted-product codes (\(t=2\)).
Directional code Member of a family of BB codes on a torus whose stabilizer generators are each supported on a translate of one bounded connected string of the square lattice. The string is traced out by a fixed word in the four lattice directions, and the same word doubles as the schedule of a syndrome-extraction circuit built only from nearest-neighbor iSWAP gates. The exchange action of those gates carries the check qubits through the lattice, so the connectivity needed to measure a high-weight stabilizer generator is produced during the circuit rather than built into the qubit connectivity graph.
Distance-balanced code Galois-qudit CSS code obtained from a CSS code by increasing the smaller of the \(X\)- and \(Z\)-distances using a homological-product-based balancing step or one of its generalizations. 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 treats both types of errors on a more equal footing.
Expander LP code Family of \(G\)-lifted product codes constructed using two classical expander codes, equivalently two regular Tanner codes defined on the same expander graph [26]. For certain parameters, this construction yields the first asymptotically good QLDPC codes. Classical codes resulting from the same lifted-product complexes are one of the first two families of \(c^3\)-LTCs [27].
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}/polylog(n) )\) and rate of order \(\Omega( n^{-2/5}/polylog(n) )\).
Fibonacci fractal spin-liquid code A fractal type-I fracton CSS code defined on a cubic lattice [28; Eq. (D23)].
Fractal surface code Kitaev surface code on a fractal geometry obtained by puncturing a higher-dimensional lattice at all length scales. A related construction, the fractal product code, is a homological product of two surface codes defined on Sierpinski carpet graphs [29]. The underlying classical codes form classical self-correcting memories [30–32].
Freedman-Meyer-Luo code Hyperbolic surface code constructed using cellulation of a Riemannian Manifold \(M\) exhibiting systolic freedom [33]. 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 [34]. Improved codes are obtained by studying a weak family of Riemann metrics on closed 4-dimensional manifolds \(S^2\otimes S^2\) with the \(\mathbb{Z}_2\)-homology.
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 color code Extension of the color code to 2D lattices of Galois qudits.
Galois-qudit expander code Galois-qudit CSS code obtained from tensor products of chain complexes associated with \(q\)-ary expander codes.
Galois-qudit surface code Extension of the surface code to 2D lattices of Galois qudits.
Generalized bicycle (GB) code A quasi-cyclic Galois-qudit CSS code constructed using a generalized version of the bicycle ansatz [35] from a pair of equivalent index-two quasi-cyclic linear codes. The length \(n=2\ell\), twice the circulant size \(\ell\), is necessarily even. Equivalently, the codes can be constructed via the lifted-product construction for \(G\) being a cyclic group [3; 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 chain complexes, thus allowing for the use of various products from homology in constructing codes.
Generalized homological-product qubit CSS code A qubit CSS code whose properties are determined from an underlying chain complex via the qubit CSS-to-homology correspondence. This complex 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.
Golden code Variant of the Guth-Lubotzky hyperbolic surface code that uses regular tessellations of 4-dimensional hyperbolic space.
Guth-Lubotzky code Homological linear-rate code based on cellulations of certain 4D hyperbolic manifolds with particular homology and systolic properties.
Hemicubic code Homological code constructed out of cubes in high dimensions. The hemicubic code family has a soundness lower bound of order \(\Omega(1/\log n)\), locality of stabilizer generators scaling as order \(O(\log n)\), and distance of order \(\Theta(\sqrt{n})\).
High-dimensional expander (HDX) code CSS code obtained by applying the generalized distance-balancing/product construction of Ref. [36] to a Ramanujan-complex quantum code and an asymptotically good classical LDPC code.
Higher-dimensional homological product code A qubit CSS code formulated using a tensor product of two or more chain complexes, each of length one or greater. The number of chain complexes participating in the product is the dimension of the code. When all chain complexes are length-one, meaning that they correspond to classical codes, the code is called a higher-dimensional HGP code (a.k.a. multi-sector HGP code or iterative HGP code).
Homological code A CSS 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).
Honeycomb (6.6.6) color code 2D color code defined on a (typically triangular) patch of the 6.6.6 (honeycomb) tiling. The usual triangular patch has three differently colored boundaries, encodes one logical qubit, and is local-Clifford equivalent to a folded surface/toric code with two smooth and two rough boundaries [37].
Hurwitz surface code Homological code constructed on triangulations of Hurwitz surfaces.
Hyperbolic surface code An extension of the Kitaev surface code construction to hyperbolic manifolds. Given a cellulation of a hyperbolic manifold of arbitrary dimension, 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. Classical LDPC seed codes yield QLDPC codes, and asymptotically good ones yield codes with \(k=\Theta(n)\) and \(d=\Theta(\sqrt{n})\) (using asymptotic notation) [38; Thm. 1].
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.
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.
Klein-bottle surface code A family of Kitaev surface codes on the non-orientable Klein bottle.
La-cross code La-cross codes are hypergraph products of two copies of a classical seed code with generating polynomial \(1+x+x^k\) for some \(k\) [39]. They are high-rate quantum LDPC codes with moderate-range, weight-six checks suited to neutral-atom registers.
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.
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.
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 [40] yields a \(c^3\)-LTC [41]. Using two-sided expanders [42] yields an asymptotically good QLDPC code family [43].
Maximal Cube Root (MCR) code Qubit GB code whose defining polynomials guarantee a large automorphism group and many fold-transversal CX gates. The construction ties both properties to a nontrivial cube root of unity in a polynomial quotient ring [44].
Mitten code Member of a family of LP codes \(\mathrm{LP}(A,B)\) with one-by-two base matrices \(A=[a_0~a_1]\) and \(B=[b_0~b_1]\) whose entries are weight-three elements of the group algebra \(\mathbb{F}_2[G]\) of a non-Abelian group \(G\) [45]. The \(G\)-lift of this shape yields five blocks of \(|G|\) data qubits and two blocks each of \(X\)- and \(Z\)-type checks, hence check weight nine and encoding rate at least \(20\%\). A non-Abelian \(G\) evades the distance ceiling of Abelian lifts of the same shape, allowing distances of about \(20\) with a few hundred data qubits.
Modular-qudit 3D surface code A generalization of the 3D surface code to modular qudits. Qudits are placed on edges, \(Z\)-type stabilizer generators are placed on square plaquettes oriented in all three directions, and \(X\)-type stabilizers are placed on the six edges neighboring every vertex [2].
Modular-qudit lattice color code Extension of the color code to lattices of modular qudits. Codes are defined analogously to qubit color codes on suitable lattices of any spatial dimension, but a directionality is required in order to make the modular-qudit stabilizers commute. This can be done by puncturing a hyperspherical lattice [46] or constructing a star-bipartition; see [47; 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 surface code Extension of the surface code to prime-dimensional [48,49] and more general modular qudits. 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.
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.
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. See Ref. [50] for explicit instances based on dihedral groups. This construction has been generalized to Schreier graphs [51].
Quantum expander code CSS code constructed from a hypergraph product of bipartite expander graphs [26] 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 entries equal to 1 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) via the hypergraph product of their parity check matrices.
Reed-Solomon cubical sheaf code DLV code on the degree-\(k\) cochains of a sheaf with projective Reed-Solomon local codes over an arithmetic quotient of a product of \(r\) Bruhat-Tits trees. Its parameters are chosen so that Ramanujan expansion and uniform product expansion of the local codes yield binary QLTCs with linear distance and constant soundness [52,53].
Rotated surface code Variant of the surface code obtained by taking the medial graph of the surface code lattice (treated as a graph) and applying a procedure to construct the check operators [54,55][56; Fig. 8]. On a square lattice, this amounts to a rotation by 45 degrees such that qubits are on vertices, and both \(X\)- and \(Z\)-type check operators occupy plaquettes in an alternating checkerboard pattern.
Sierpinski prism model code A fractal type-I fracton CSS code defined on a cubic lattice [28; Eq. (D22)]. The code admits an excitation-moving operator shaped like a Sierpinski triangle [28; Fig. 2].
Square homological product code Homological product code whose underlying quantum-code boundary operators are square matrices (see Qubit CSS-to-homology correspondence).
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 [1]. An equivalent description uses the Tetrakis square tiling (a.k.a. the Union Jack lattice), which is dual to the 4.8.8 lattice [57]. Among the three semiregular triangular 2D color-code families, the 4.8.8 family uses the fewest physical qubits for a given distance and is the only one of the three with transversal implementations of the full Clifford group using uniform single-qubit gates [58].
Tensor-product HDX code A code constructed in a similar way as the HDX code, but utilizing iterated homological products of multiple Ramanujan complexes and then applying distance balancing. For any fixed tensor-power parameter \(c\), these yield explicit QLDPC codes with distance scaling as \(\sqrt{n}\log^{c} n\), improving on the original HDX construction by replacing a single logarithmic enhancement with arbitrarily high fixed polylogarithmic enhancement. 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.
Tetrahedral color code A 3D color code defined on a colored tetrahedron cut from a suitably colored BCC lattice [46]. Qubits are placed on tetrahedra, on the triangles covering the tetrahedron faces, on the edges along the tetrahedron edges, and on the tetrahedron vertices. The code has both string-like and sheet-like logical operators [59].
Tillich-Zémor code A family of \([[n^2 + m^2, (n - rank([C \mid M]) )^2 + (m - rank([C \mid M]^\top) )^2, d]]\) quantum LDPC codes constructed via the hypergraph product of two classical \((n, m, r)\)-structured LDPC seed codes
Toric code Version of the Kitaev surface code on a square lattice with periodic boundary conditions, 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 [60; Fig. 8] refers to the construction on a torus with twisted (a.k.a. shifted) boundary conditions. In the original Hamiltonian construction, open Pauli-\(Z\) and Pauli-\(X\) strings create pairs of electric charges and magnetic vortices, and braiding one type around the other yields the nontrivial Abelian anyonic phase [48].
Transversal-\(CCZ\) Reed-Solomon cubical sheaf code One of three degree-two Reed-Solomon cubical sheaf codes on a common six-dimensional complex, which together admit \(\Theta(N)\) addressable and parallel transversal logical \(CCZ\) gates for block length \(N\) [61]. Block \(a\in\{1,2,3\}\) uses lower-degree projective Reed-Solomon local codes in directions \(2a-1\) and \(2a\) than in the other four [61; Sec. 3.1].
Tricycle code A three-block CSS code whose commuting matrices represent three elements \(a,b,c\) of the group algebra \(\mathbb{F}_2[G]\) of a finite Abelian group \(G\). The code is the balanced product over \(\mathbb{F}_2[G]\) of the three classical group-algebra codes defined by \(a\), \(b\), and \(c\), extending the two-block 2BGA construction to three homological dimensions [62,63]. The third dimension provides \(Z\)-type metachecks, which make the code single-shot decodable in the \(Z\) basis, and a cup product, which yields constant-depth transversal \(CCZ\) circuits for magic-state generation [63].
Truncated trihexagonal (4.6.12) color code 2D color code defined on a (typically triangular) patch of the 4.6.12 (truncated trihexagonal or square-hexagon-dodecagon) tiling.
Two-block group-algebra (2BGA) codes 2BGA codes are the one-by-one, or smallest, LP codes: \(LP(a,b)\) is defined by a pair of group algebra elements \(a,b\in \mathbb{F}_q[G]\), where \(G\) is a finite group. The codes have length \(n=2|G|\).
Two-foliated fracton code A type-I fracton code obtained by gauging [13–22] a 3D paramagnet with planar subsystem symmetries in two directions. In that construction, the gauge charges are lineons and the flux excitations are also lineons moving in the same direction, yielding the anisotropic lineon model [19; Sec. 4.1.2].
XY surface code A variant of the surface code whose generators are \(XXXX\) and \(YYYY\), obtained by mapping \(Z \to Y\) in the surface code. While this code is equivalent to a CSS surface code with the same distance, other properties like noise-bias performance can differ significantly.
XYZ color code A variant of the 6.6.6 color code whose generators are \(XZXZXZ\) and \(ZYZYZY\) Pauli strings associated to each hexagon in the hexagonal (6.6.6) tiling. A further variation called the domain wall color code admits generators of the form \(XXXZZZ\) and \(ZZZXXX\) [64]. While such codes are equivalent to CSS color codes with the same distance, other properties like noise-bias performance can differ significantly.
XYZ product code A non-CSS QLDPC code obtained from a three-fold variant of the hypergraph product applied to three classical binary codes with parity-check matrices \(H_1,H_2,H_3\). The parity-check matrices \(H_1\), \(H_2\), and \(H_3\) set the Pauli-\(X\), \(Y\), and \(Z\) components of the stabilizer generators, respectively [65; Sec. 3.1]. Under mild assumptions, the code dimension is determined by a tensor Sylvester equation over \(\mathbb{F}_2\), and the minimum-distance problem reduces up to constant factors to how closely a related inhomogeneous tensor Sylvester equation can be satisfied [65]. When the underlying classical codes are repetition codes, the construction yields the Chamon model code.
\((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. In the hypercubic lattice version, qubits are placed on edges, each \(Z\)-type stabilizer generator is supported on cubes on the boundary of a hypercube, and \(X\)-type stabilizers are placed on the edges neighboring every vertex [66].
\((2,2)\) 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 [67,68].
\(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 yield qubit 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.
\([[108,8,10]]\) three-quarters-gross code A bivariate bicycle (BB) code with parameters \([[108,8,10]]\) and weight-six stabilizer generators [8].
\([[144,12,12]]\) gross code A BB code which requires fewer physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance. It is the BB code with \(\ell=12\), \(m=6\), \(A=x^3+y+y^2\), and \(B=y^3+x+x^2\) [8; Table 3]. Laid out on a torus, each check acts on four nearest-neighbor qubits, as in the toric code, and on two long-range qubits [8; Fig. 1].
\([[15,1,3]]\) quantum RM code A \([[15,1,3]]\) quantum Reed-Muller code that is most easily thought of as a tetrahedral 3D color code. It can be constructed as a CSS code from the \([15,5,7]\) punctured Reed-Muller code and its even subcode, which explains its transversal \(T^\dagger\) gate [69].
\([[16,4,4]]\) twisted color code Self-dual doubly-even CSS code that is the 4.8.8 color code on the smallest torus, twisted in that one boundary identification is shifted by half a period [70]. Equivalently, it is the concatenated symplectic double of the \([[4,2,2]]\) code, i.e., its inner \([[8,4,2]]\) symplectic double with each \(ZX\)-dual pair of qubits encoded into an outer \([[4,2,2]]\) block [71]. Automorphisms of the \([[4,2,2]]\) seed lift through this structure to logical gates realized by qubit permutations [71].
\([[16,6,4]]\) copy-cup code An even pure \([[16,6,4]]\) CSS code that admits a constant-depth logical \(CZ\) gate between two copies and is constructed as a balanced product of two weight-four cyclic group-algebra codes over \(\mathbb{F}_2[\mathbb{Z}_8]\). It is one of two inequivalent \([[16,6,4]]\) codes whose complete logical Clifford group is realizable by depth-one two-local circuits, the other being the tesseract color code.
\([[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. The smallest distance-five CSS code has \(n=17\) [72]. It is also a normal self-dual CSS code whose transversal Hadamard acts logically, making it suitable as an inner code for fifth-order magic-state distillation [73].
\([[18,2,5]]\) BCC code BCC code on 18 qubits encoding 2 logical qubits with distance 5, found by computer search [74].
\([[18,4,4]]\) 6.6.6 color code Self-dual pure CSS code that is the 6.6.6 (honeycomb) color code on the torus \(\mathbb{Z}^2/3\mathbb{Z}^2\). The nine hexagonal faces each host a weight-six \(X\)-type and a weight-six \(Z\)-type stabilizer generator. The 18 qubits sit on the vertices of the tiling, i.e., on the faces of the underlying triangular lattice.
\([[22,2,6]]\) shortened Golay code Self-dual doubly even CSS code on 22 physical qubits encoding two logical qubits with distance six. The code is constructed from the self-orthogonal \([22,10,8]\) code obtained by shortening the \([24,12,8]\) extended Golay code on two bits [73; Appx. A.1.5]. Since the automorphism group of the extended Golay code is 5-transitive, the code does not depend on which two bits are chosen [73]. The code is also a symplectic double of a pure \([[11,1,3]]\) stabilizer code.
\([[27,3,3]]\) bivariate tricycle code Bivariate tricycle code that can code switch into a BB code and that admits a depth-two cup-product \(CCZ\) gate [75]. It is defined over \(\mathbb{F}_2[x,y]/(x^3+1,y^3+1)\) by the binomial elements \(a=x^2y+x^2y^2\), \(b=1+xy^2\), and \(c=x+x^2y\) [75; Table III].
\([[288,12,18]]\) double-gross code A bivariate bicycle (BB) code with parameters \([[288,12,18]]\) and weight-six stabilizer generators [8].
\([[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 lie on the edges of the small stellated dodecahedron, with \(X\)-type stabilizer generators on its vertices and \(Z\)-type stabilizer generators on its pentagrammic faces [76]. It admits a set of weight-five stabilizer generators.
\([[4,1,2]]\) Leung-Nielsen-Chuang-Yamamoto (LNCY) code A four-qubit CSS stabilizer code that is the only qubit CSS code with such parameters.
\([[4,2,2]]\) Four-qubit code A four-qubit hyperbolic self-dual CSS stabilizer code that is the smallest two-logical-qubit stabilizer code to detect a single-qubit error. It is unique for its parameters [77; Thm. 8].
\([[5,1,2]]\) rotated surface code A rotated surface code on one rung of a ladder, with one qubit on the rung, and four qubits surrounding it. This is the smallest code that implements a fault-tolerant logical \(S\) gate using a diagonal depth-one Clifford circuit [78].
\([[6,2,2]]\) \(C_6\) code Error-detecting normal self-dual CSS code on three qubit pairs that encodes a logical qubit pair and detects any error acting on one pair [79]. In Knill’s \(C_4/C_6\) architecture, this code is used at the second and higher concatenation levels.
\([[6,4,2]]\) error-detecting code Self-complementary six-qubit code with rate \(2/3\) that is unique for its parameters, up to equivalence [80; Tab. III]. Concatenations of this code with itself yield the \([[6^r,4^r,2^r]]\) level-\(r\) many-hypercube code [81].
\([[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 [82]. The code is constructed using the classical binary \([7,4,3]\) Hamming code for protecting against both \(X\) and \(Z\) errors.
\([[7,2,2]]\) HGP phantom code Smallest member of a family of CSS phantom HGP codes obtained from the hypergraph product of a classical simplex code and a repetition code.
\([[72,12,6]]\) half-gross code A bivariate bicycle (BB) code with parameters \([[72,12,6]]\) and weight-six stabilizer generators [8].
\([[8,2,2]]\) projective-plane color code An \([[8,2,2]]\) color code defined on the projective plane. It is a self-dual CSS code.
\([[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.
\([[81,3,5]]\) bivariate tricycle code Bivariate tricycle code that can code switch into a BB code and that admits a depth-two cup-product \(CCZ\) gate [75]. It is defined over \(\mathbb{F}_2[x,y]/(x^3+1,y^9+1)\) by the binomial elements \(a=xy^3+x^2y\), \(b=1+xy^8\), and \(c=x^2y^4+x^2y^6\) [75; Table III].
\([[9,1,3]]\) Shor code Nine-qubit CSS code that is the first quantum error-correcting code [83; ID 8802]. Among indecomposable \([[9,1,3]]\) CSS codes, the Shor code has the largest automorphism group [84].
\([[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 is one of the four inequivalent CSS gauge fixings of the nine-qubit Bacon-Shor code [84]. It uses the smallest number of qubits to perform fault-tolerant error correction on a surface code with parallel syndrome extraction.
\([[90,8,10]]\) BB6 code A bivariate bicycle (BB) code with parameters \([[90,8,10]]\) and weight-six stabilizer generators [8].
List (descendants): All descendants of Generalized homological-product code.

References

  1. [1]

    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

  2. [2]

    H. Moradi and X.-G. Wen, “Universal topological data for gapped quantum liquids in three dimensions and fusion algebra for non-Abelian string excitations”, Physical Review B 91, (2015) arXiv:1404.4618 DOI

  3. [3]

    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

  4. [4]

    P. Gorantla, H. T. Lam, N. Seiberg, and S.-H. Shao, “Gapped lineon and fracton models on graphs”, Physical Review B 107, (2023) arXiv:2210.03727 DOI

  5. [5]

    H. Ebisu and B. Han, “Anisotropic higher rank \(\mathbb{Z}_N\) topological phases on graphs”, SciPost Physics 14, (2023) arXiv:2209.07987 DOI

  6. [6]

    M. Ye and N. Delfosse, “Quantum error correction for long chains of trapped ions”, Quantum 9, 1920 (2025) arXiv:2503.22071 DOI

  7. [7]

    Z. Babar, P. Botsinis, D. Alanis, Soon Xin Ng, and L. Hanzo, “The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure”, IEEE Access 3, 146 (2015) arXiv:1503.02372 DOI

  8. [8]

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, “High-threshold and low-overhead fault-tolerant quantum memory”, Nature 627, 778 (2024) arXiv:2308.07915 DOI

  9. [9]

    E. T. Campbell, “A theory of single-shot error correction for adversarial noise”, Quantum Science and Technology 4, 025006 (2019) arXiv:1805.09271 DOI

  10. [10]

    H. Zheng, G. Zheng, L. Jiang, and Q. Xu, “Logical computation with canonical lifted product codes”, (2026) arXiv:2607.28605

  11. [11]

    S. Bravyi, B. Leemhuis, and B. M. Terhal, “Topological order in an exactly solvable 3D spin model”, Annals of Physics 326, 839 (2011) arXiv:1006.4871 DOI

  12. [12]

    W. Shirley, X. Liu, and A. Dua, “Emergent fermionic gauge theory and foliated fracton order in the Chamon model”, Physical Review B 107, (2023) arXiv:2206.12791 DOI

  13. [13]

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

  14. [14]

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

  15. [15]

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

  16. [16]

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

  17. [17]

    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

  18. [18]

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

  19. [19]

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

  20. [20]

    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

  21. [21]

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

  22. [22]

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

  23. [23]

    J. C. Magdalena de la Fuente, T. D. Ellison, M. Cheng, and D. J. Williamson, “Topological Stabilizer Models on Continuous Variables”, Physical Review X 16, (2026) arXiv:2411.04993 DOI

  24. [24]

    A. Aydin, N. Delfosse, and E. Tham, “Cyclic Hypergraph Product Code”, (2026) arXiv:2511.09683

  25. [25]

    I. Dinur, T.-C. Lin, and T. Vidick, “Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes”, (2025) arXiv:2402.07476

  26. [26]

    S. Hoory, N. Linial, and A. Wigderson, “Expander graphs and their applications”, Bulletin of the American Mathematical Society 43, 439 (2006) DOI

  27. [27]

    P. Panteleev and G. Kalachev, “Asymptotically Good Quantum and Locally Testable Classical LDPC Codes”, (2022) arXiv:2111.03654

  28. [28]

    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

  29. [29]

    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

  30. [30]

    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

  31. [31]

    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

  32. [32]

    M. Shinoda, “Existence of phase transition of percolation on Sierpiński carpet lattices”, Journal of Applied Probability 39, 1 (2002) DOI

  33. [33]

    M. H. Freedman, “Z\({}_{2}\)–Systolic-Freedom”, Geometry & Topology Monographs 113 (1999) DOI

  34. [34]

    E. Fetaya, “Bounding the distance of quantum surface codes”, Journal of Mathematical Physics 53, (2012) DOI

  35. [35]

    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

  36. [36]

    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

  37. [37]

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

  38. [38]

    J.-P. Tillich and G. Zemor, “Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength”, IEEE Transactions on Information Theory 60, 1193 (2014) arXiv:0903.0566 DOI

  39. [39]

    L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo, “High-rate quantum LDPC codes for long-range-connected neutral atom registers”, Nature Communications 16, (2025) arXiv:2404.13010 DOI

  40. [40]

    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

  41. [41]

    T.-C. Lin and M.-H. Hsieh, “\(c^3\)-Locally Testable Codes from Lossless Expanders”, (2022) arXiv:2201.11369

  42. [42]

    J.-T. Hsieh, A. Lubotzky, S. Mohanty, A. Reiner, and R. Y. Zhang, “Explicit Lossless Vertex Expanders”, (2025) arXiv:2504.15087

  43. [43]

    T.-C. Lin and M.-H. Hsieh, “Good quantum LDPC codes with linear time decoder from lossless expanders”, (2022) arXiv:2203.03581

  44. [44]

    A. Davenport, J. Blue, and I. Chuang, “Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure”, (2026) arXiv:2606.05044

  45. [45]

    A. Bhardwaj, M. Ma, N. Meister, R. King, D. Bluvstein, J. Preskill, M. Cain, Q. Xu, and H.-Y. Huang, “High-rate qLDPC processors”, (2026) arXiv:2607.28795

  46. [46]

    H. Bombin, “Gauge Color Codes: Optimal Transversal Gates and Gauge Fixing in Topological Stabilizer Codes”, (2015) arXiv:1311.0879

  47. [47]

    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

  48. [48]

    A. Yu. Kitaev, “Fault-tolerant quantum computation by anyons”, Annals of Physics 303, 2 (2003) arXiv:quant-ph/9707021 DOI

  49. [49]

    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

  50. [50]

    R. K. Radebold, S. D. Bartlett, and A. C. Doherty, “Explicit Instances of Quantum Tanner Codes”, (2025) arXiv:2508.05095

  51. [51]

    O. Å. Mostad, E. Rosnes, and H.-Y. Lin, “Generalizing Quantum Tanner Codes”, (2024) arXiv:2405.07980

  52. [52]

    W. Gay and F. G. Jeronimo, “Asymptotically Good Quantum Locally Testable Codes”, (2026) arXiv:2609.20780

  53. [53]

    Y. Chen, M. M.-Y. Huang, Y. Liu, and E.-C. Tang, “Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs”, (2026) arXiv:2609.28028

  54. [54]

    H. Bombin and M. A. Martin-Delgado, “Optimal resources for topological two-dimensional stabilizer codes: Comparative study”, Physical Review A 76, (2007) arXiv:quant-ph/0703272 DOI

  55. [55]

    N. Delfosse, P. Iyer, and D. Poulin, “Generalized surface codes and packing of logical qubits”, (2016) arXiv:1606.07116

  56. [56]

    R. Sarkar and T. J. Yoder, “A graph-based formalism for surface codes and twists”, Quantum 8, 1416 (2024) arXiv:2101.09349 DOI

  57. [57]

    H. G. Katzgraber, H. Bombin, R. S. Andrist, and M. A. Martin-Delgado, “Topological color codes on Union Jack lattices: a stable implementation of the whole Clifford group”, Physical Review A 81, (2010) arXiv:0910.0573 DOI

  58. [58]

    A. J. Landahl, J. T. Anderson, and P. R. Rice, “Fault-tolerant quantum computing with color codes”, (2011) arXiv:1108.5738

  59. [59]

    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

  60. [60]

    N. P. Breuckmann and J. N. Eberhardt, “Balanced Product Quantum Codes”, IEEE Transactions on Information Theory 67, 6653 (2021) arXiv:2012.09271 DOI

  61. [61]

    Y. Li, Z. Li, Z. Han, and Z.-W. Liu, “Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes”, (2026) arXiv:2609.26691

  62. [62]

    A. Jacob, C. McLauchlan, and D. E. Browne, “Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes”, (2026) arXiv:2508.08191

  63. [63]

    V. Menon, J. P. Bonilla Ataides, R. Mehta, A. Gu, D. B. Tan, and M. D. Lukin, “Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes”, Physical Review X 16, (2026) arXiv:2508.10714 DOI

  64. [64]

    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

  65. [65]

    A. Leverrier, S. Apers, and C. Vuillot, “Quantum XYZ Product Codes”, Quantum 6, 766 (2022) arXiv:2011.09746 DOI

  66. [66]

    T. Jochym-O’Connor and T. J. Yoder, “Four-dimensional toric code with non-Clifford transversal gates”, Physical Review Research 3, (2021) arXiv:2010.02238 DOI

  67. [67]

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

  68. [68]

    R. Alicki, M. Horodecki, P. Horodecki, and R. Horodecki, “On thermal stability of topological qubit in Kitaev’s 4D model”, (2008) arXiv:0811.0033

  69. [69]

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

  70. [70]

    P. Prabhu and B. W. Reichardt, “Distance-four quantum codes with combined postselection and error correction”, Physical Review A 110, (2024) arXiv:2112.03785 DOI

  71. [71]

    N. Berthusen and E. Durso-Sabina, “Simple logical quantum computation with concatenated symplectic double codes”, Quantum 10, 2195 (2026) arXiv:2510.18753 DOI

  72. [72]

    M. F. Ezerman, S. Jitman, S. Ling, and D. V. Pasechnik, “CSS-Like Constructions of Asymmetric Quantum Codes”, IEEE Transactions on Information Theory 59, 6732 (2013) arXiv:1207.6512 DOI

  73. [73]

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

  74. [74]

    M. B. Hastings, “A Class of Cyclic Quantum Codes”, (2025) arXiv:2509.06865

  75. [75]

    C. Li, J. Preskill, and Q. Xu, “Transversal dimension jump for product qLDPC codes”, (2026) arXiv:2510.07269

  76. [76]

    J. Conrad, C. Chamberland, N. P. Breuckmann, and B. M. Terhal, “The small stellated dodecahedron code and friends”, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 376, 20170323 (2018) arXiv:1712.07666 DOI

  77. [77]

    E. M. Rains, “Quantum codes of minimum distance two”, (1997) arXiv:quant-ph/9704043

  78. [78]

    V. V. Albert, private communication, 2026

  79. [79]

    E. Knill, “Quantum computing with realistically noisy devices”, Nature 434, 39 (2005) arXiv:quant-ph/0410199 DOI

  80. [80]

    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

  81. [81]

    H. Goto, “High-performance fault-tolerant quantum computing with many-hypercube codes”, Science Advances 10, (2024) arXiv:2403.16054 DOI

  82. [82]

    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

  83. [83]

    Qiskit Community, “Qiskit QEC framework”, URL

  84. [84]

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

Classical Domain

  • Binary Kingdom
  • Galois-field Kingdom
  • Matrix Kingdom
  • Analog Kingdom
  • Spherical Kingdom
  • Ring Kingdom
  • Group Kingdom
  • Homogeneous-space Kingdom

Quantum Domain

  • Qubit Kingdom
  • Modular-qudit Kingdom
  • Galois-qudit Kingdom
  • Bosonic Kingdom
  • Spin Kingdom
  • Group quantum Kingdom
  • Homogeneous-space quantum Kingdom
  • Category Kingdom

Classical-quantum Domain

  • Binary c-q Kingdom
  • Analog c-q Kingdom

  • Home
  • Code graph
  • Code lists
  • Concepts glossary
  • Handbook
  • Search

  • Team
  • About

  • 🌒
≡
Error correction zoo by Victor V. Albert, Philippe Faist, and many contributors. This work is licensed under a CC-BY-SA License. See how to contribute.