Code | Description |
---|---|

3D surface code | A variant of the Kitaev surface code on a 3D lattice. The closely related solid code [1] consists of several 3D surface codes stitched together in a way that the distance scales faster than the linear size of the system. |

Abelian topological code | Code whose codewords realize topological order associated with an abelian group. Stub. |

Bacon-Shor code | CSS subsystem stabilizer code defined on an \(m_1 \times m_2\) lattice of qubits. It is said to be symmetric when \(m_1=m_2\). The \(X\)-type and \(Z\)-type stabilizers defined as \(X\) and \(Z\) operators acting on all qubits on adjacent columns and rows, respectively. Let \(O_{i,j}\) denote an operator acting on the qubit at a position \((i,j)\) on the lattice, with \(i\in\{0,1,\ldots ,m_1-1\}\) and \(j\in\{0,1,\ldots,m_2-1\}\). The code's stabilizer group is \begin{align} \mathsf{S}=\langle X_{i,*}X_{i+1,*},Z_{*,j}Z_{*,j+1}\rangle~, \end{align} with generators expressed as products of nearest-neightbour 2-qubit gauge operators, \begin{align} \begin{split} X_{i,*}X_{i+1,*}= \bigotimes_{k=0}^{m_2-1} X_{i,k}X_{i+1,k} \\ Z_{*,j}Z_{*,j+1}=\bigotimes_{k=0}^{m_1-1} Z_{k,j}Z_{k,j+1}~. \end{split} \end{align} Syndrome extraction can be done by measuring these gauge operators, which are on fewer qubits and local. |

Balanced product 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. |

CSS 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 [2] against erasure and depolarizing noise when compared to other notable CSS codes, such as the asymptotically good quantum Tanner codes. |

Calderbank-Shor-Steane (CSS) stabilizer code | An \([[n,k,d]]\) stabilizer code admitting a set of stabilizer generators that are either \(Z\)-type or \(X\)-type Pauli strings. The stabilizer generator matrix is of the form \begin{align} H=\begin{pmatrix}0 & H_{Z}\\ H_{X} & 0 \end{pmatrix} \label{eq:parity} \end{align} such that the rows of the two blocks must be orthogonal \begin{align} H_X H_Z^T=0~. \label{eq:comm} \end{align} The above condition guarantees that the \(X\)-stabilizer generators, defined in the symplectic representation as rows of \(H_X\), commute with the \(Z\)-stabilizer generators associated with \(H_Z\). |

Chuang-Leung-Yamamoto (CLY) code | Bosonic Fock-state code that encodes \(k\) qubits into \(n\) oscillators, with each oscillator restricted to having at most \(N\) excitations. Codewords are superpositions of oscillator Fock states which have exactly \(N\) total excitations, and are either uniform (i.e., balanced) superpositions or unbalanced superpositions. Codes can be denoted as \([[N,n,2^k,d]]\), which conflicts with stabilizer code notation. |

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. |

Color code | A family of abelian topological CSS stabilizer codes defined on a \(D\)-dimensional lattice which satisfies two properties: The lattice is (1) a homogeneous simplicial \(D\)-complex obtained as a triangulation of the interior of a \(D\)-simplex and (2) is \(D+1\)-colorable. Qubits are placed on the \(D\)-simplices and generators are supported on suitable simplices [3]. For 2-dimensional color code, the lattice must be such that it is 3-valent and has 3-colorable faces, such as a honeycomb lattice. The qubits are placed on the vertices and two stabilizer generators are placed on each face [4]. |

Constant-excitation (CE) code | Code whose codewords lie in an excited-state eigenspace of a Hamiltonian governing the total energy or total number of excitations of the underlying quantum system. For qubit codes, such a Hamiltonian is often the total spin Hamiltonian, \(H=\sum_i Z_i\). For spin-\(S\) codes, this generalizes to \(H=\sum_i J_z^{(i)}\), where \(J_z\) is the spin-\(S\) \(Z\)-operator. For bosonic codes, such as Fock-state codes, codewords are often in an eigenspace with eigenvalue \(N>0\) of the total excitation or energy Hamiltonian, \(H=\sum_i \hat{n}_i\). |

Constant-excitation permutation-invariant code | Stub. |

Crystalline-circuit 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\). |

Dinur-Hsieh-Lin-Vidick (DHLV) code | Stub. |

Distance-balanced code | 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 [5], later generalized in Ref. [6], can yield QLDPC codes; see Thm. 1 in Ref. [5]. |

Double-semion code | Stub. |

Dual-rail quantum code | Two-mode code encoding a logical qubit in Fock states with one excitation. The logical-zero state is represented by \(|01\rangle\), while the logical-one state is represented by \(|10\rangle\). The two modes of the encoding can represent temporal or spatial modes, corresponding to a time-bin or frequency-bin encoding. |

Eigenstate thermalization hypothesis (ETH) code | Also called a thermodynamic code [7]. An \(n\)-qubit approximate code whose codespace is formed by eigenstates of a translationally-invariant quantum many-body system which satisfies the Eigenstate Thermalization Hypothesis (ETH). ETH ensures that codewords cannot be locally distinguished in the thermodynamic limit. Relevant many-body systems include 1D non-interacting spin chains, Motzkin chains, or Heisenberg models. |

Error-corrected sensing code | Code that can be obtained via an optimization procedure that ensures correction against a set \(\cal{E}\) of errors as well as guaranteeting optimal precision in locally estimating a parameter using a noiseless ancilla. For tensor-product spaces consisting of \(n\) subsystems (e.g., qubits, modular qudits, or Galois qudits), the procedure can yield a code whose parameter estimation precision satisfies Heisenberg scaling, i.e., scales quadratically with the number \(n\) of subsystems. |

Expander lifted-product code | Family of \(G\)-lifted product codes constructed using two random classical Tanner codes defined on expander graphs. 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. |

Fiber-bundle code | Also called a twisted product code. CSS code constructed by combining a random LDPC code as the base and a cyclic repetition code as the fiber of a fiber bundle. After applying distance balancing, a QLDPC code with distance \(\Omega(n^{3/5}\text{polylog}(n))\) and rate \(\Omega(n^{-2/5}\text{polylog}(n))\) is obtained. |

Fibonacci string-net code | Quantum error correcting code associated with the Levin-Wen string-net model with the Fibonacci input category, admitting two types of encodings. |

Five-qubit perfect code | Five-qubit stabilizer code with generators that are symmetric under cyclic permutation of qubits, \begin{align} \begin{split} S_1 &= IXZZX \\ S_2 &= XZZXI \\ S_3 &= ZZXIX \\ S_4 &= ZXIXZ~. \end{split} \end{align} |

Floquet code | Dynamically-generated stabilizer-based code whose logical qubits are generated through a particular sequence of check-operator measurements such that the number of logical qubits is larger than when the code is viewed as a static subsystem stabilizer code. After each measurement in the sequence, the codespace is a joint \(+1\) eigenspace of an instantaneous stabilizer group (ISG), i.e., a particular stabilizer group corresponding to the measurement. The ISG specifies the state of the system as a Pauli stabilizer state at a particular round of measurement, and it evolves into a (potentially) different ISG depending on the check operators measured in the next step in the sequence. As opposed to subsystem codes, only specific measurement sequences maintain the codespace. |

Floquet color code | Stub. |

Fractal surface code | Kitaev surface code on a fractal geometry, which is obtained by removing qubits from the surface code on a cubic lattice. Stub. |

Fracton code | A code whose codewords make up the ground-state space of a fracton-phase Hamiltonian. |

Freedman-Meyer-Luo code | Hyperbolic surface code constructed using cellulation of a Riemannian Manifold \(M\) exhibiting systolic freedom [8]. 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 [9]. 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. |

GNU permutation-invariant code | Can be expressed in terms of Dicke states where the logical states are \begin{align} |\overline{\pm}\rangle = \sum_{\ell=0}^{n} \frac{(\pm 1)^\ell}{\sqrt{2^n}} \sqrt{n \choose \ell} |D^m_{g \ell}\rangle~. \end{align} Here, \(m\) is the number of particles used for encoding \(1\) qubit, and \(g, n \leq m\) are arbitrary positive integers. The state \(|D^m_w\rangle\) is a Dicke state -- a normalized permutation-invariant state on \(m\) spin-half systems with \(w\) excitations, i.e., a normalized sum over all basis elements with \(w\) ones and \(m - w\) zeroes. |

Galois-qudit topological code | Abelian topological code, such as a surface [10][11] or color [12] code, constructed on lattices of Galois qudits. |

Generalized color code | Member of a family of non-Abelian topological codes, defined by a finite group \( G \), that serves as a generalization of the color code (for which \(G=\mathbb{Z}_2\)). |

Generalized homological product CSS code | Qubit, modular-qudit, or Galois-qudit generalized homological product code of CSS type. |

Generalized homological product code | Stabilizer code formulated in terms a chain complex consisting of some type of product of other chain complexes. The 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. The codes participating in the product can be quantum, classical, or mixed. Products can be of more than two codes, in which case the output code need not be of CSS type (e.g., for XYZ-product codes). The simplest product is a tensor product, with more general products imposing equivalence or symmetry relations on the outputs of the tensor product. A product of two codes can be interpreted as a fiber bundle, with one element of the product being the base and the other being the fiber. |

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. |

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 | Class of stabilizer codes on a length-\(L\) cubic lattice with one or two qubits per site. We also require that the stabilizer group \(\mathsf{S}\) is translation invariant and generated by two types of operators with support on a cube. 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. Haah showed in his original construction that there is exactly one non-CSS code of this form, and 17 CSS codes [13]. The non-CSS code is labeled code 0, and the rest are numbered from 1 - 17. Codes 1-4, 7, 8, and 10 do not have string logical operators [13][14]. |

Hamiltonian-based code | Encoding corresponds to a set of energy eigenstates of a quantum-mechanical Hamiltonian. The codespace is typically a set of low-energy eigenstates or ground states, but can include subspaces of arbitrarily high energy. |

Hemicubic code | Stub. |

Higher-dimensional surface code | A family of Kitaev surface codes on planar or toric surfaces of dimension greater than two. Stub. |

Homological product code | CSS code formulated using the homological product of two chain complexes (see CSS-to-homology correspondence). Stub. |

Honeycomb Floquet code | Floquet code inspired by the Kitaev honeycomb model [15] whose logical qubits are generated through a particular sequence of measurements. |

Hyperbolic surface code | An extension of the Kitaev surface code construction to hyperbolic manifolds in dimension two or greater. 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 code | A family of \([[n,k,d]]\) CSS codes whose construction is based on two binary linear seed codes \(C_1\) and \(C_2\). |

Hypersphere product code | Stub. |

Kitaev honeycomb code | Code whose logical subspace is labeled by different fusion outcomes of Ising anyons present in the non-Abelian topological phase of the Kitaev honeycomb model [15]. Each logical qubit is constructed out of four Majorana operators, which admit braiding-based gates due to their non-Abelian statistics and which can be used for topological quantum computation. |

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). Toric code often either refers to the construction on the two-dimensional torus or is an alternative name for the general construction. The construction on surfaces with boundaries is often called the planar code [16]. |

Lifted-product (LP) code | Also called a Panteleev-Kalachev (PK) code. 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. |

Matching code | Member of a class of qubit stabilizer codes based on the abelian phase of the Kitaev honeycomb model. |

Matrix-model code | Multimode-mode Fock-state bosonic approximate code derived from a matrix model, i.e., a non-Abelian bosonic gauge theory with a large gauge group. The model's degrees of freedom are matrix-valued bosons \(a\), each consisting of \(N^2\) harmonic oscillator modes and subject to an \(SU(N)\) gauge symmetry. |

Matrix-product state (MPS) code | Also called a magnon code. An \(n\)-qubit approximate code whose codespace of \(k=\Omega(\log n)\) qubits is efficiently described in terms of matrix product states (MPS) or Bethe ansatz tensor networks. A no-go theorem states that open-boundary MPS that form a degenerate ground-state space of a gapped local Hamiltonian yield codes with distance that is only constant in the number of qubits \(n\), so MPS excitation ansatze have to be used to achieve a distance scaling nontrivially with \(n\). |

Movassagh-Ouyang Hamiltonian code | This is a family of codes derived via an algorithm that takes as input any binary classical code and outputs a quantum code (note that this framework can be extended to \(q\)-ary codes). The algorithm is probabalistic but succeeds almost surely if the classical code is random. An explicit code construction does exist for linear distance codes encoding one logical qubit. For finite rate codes, there is no rigorous proof that the construction algorithm succeeds, and approximate constructions are described instead. |

Pair-cat code | Two- or higher-mode extension of cat codes whose codewords are right eigenstates of powers of products of the modes' lowering operators. Many gadgets for cat codes have two-mode pair-cat analogues, with the advantage being that such gates can be done in parallel with a dissipative error-correction process. |

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 Reed-Muller code | A CSS code formed from a classical Reed-Muller code (or its punctured versions) in which polynomials over finite fields encode data. This is done by transforming these polynomials into the stabilizer generator matrices. |

Quantum Tanner code | Stub. |

Quantum check-product code | Stub. |

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 divisible code | Consider a CSS code whose \(Z\)-stabilizers are determined by the dual of a classical \([n, k_1]\) linear binary code \(C_1\), and whose \(X\)-stabilizers are determined by a classical \([n, k_2]\) binary code \(C_2 \subset C_1\). This code is quantum divisible if all weights in \(C_2\) share a common divisor \(\Delta > 1\), and all weights in each coset of \(C_2\) in \(C_1\) are congruent to \(\Delta\). |

Quantum expander code | CSS codes constructed from a hypergraph product of bipartite expander graphs 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 locally testable code (QLTC) | A local commuting-projector Hamiltonian-based quantum error-correcting code on a finite-tensor-product space of \(n\) identical factors (e.g., qubits, modular qudits, or Galois qudits) which has a nonzero average-energy penalty for creating large errors. Informally, QLTC error states that are far away from the codespace have to be excited states of many of the code's local projectors. |

Quantum low-density parity-check (QLDPC) code | Also called a sparse quantum code. Family of \([[n,k,d]]\) stabilizer codes for which the number of sites (either qubit or qudit) participating in each stabilizer generator and the number of stabilizer generators that each site participates in are both bounded by a constant as \(n\to\infty\). A geometrically local stabilizer code is a QLDPC code where the sites involved in any syndrome bit are contained in a fixed volume that does not scale with \(n\). As opposed to general stabilizer codes, syndrome extraction of the constant-weight check operators of a QLDPC codes can be done using a constant-depth circuit. |

Quantum parity code (QPC) | Also called a generalized Shor code [17]. 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. Logical codewords are \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{2^{m_2/2}}\left(|0\rangle^{\otimes m_1}+|1\rangle^{\otimes m_1}\right)^{\otimes m_2}\\ |\overline{1}\rangle&=\frac{1}{2^{m_2/2}}\left(|0\rangle^{\otimes m_1}-|1\rangle^{\otimes m_1}\right)^{\otimes m_2}~. \end{split} \end{align} |

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}\). Also known as 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-double code | A family of topological codes, defined by a finite group \( G \), whose generators are few-body operators associated to the stars and plaquettes, respectively, of a tessellation of a two-dimensional surface (with a qudit of dimension \( |G| \) located at each edge of the tesselation). |

Qubit stabilizer code | Also called a Pauli 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. |

Ramanujan-complex product 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. 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. |

Rotated surface code | Also called a checkerboard code. CSS 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. |

Self-correcting quantum code | Also called a self-correcting quantum memory or thermally stable encoding. A ground-state encoding of an \(n\)-body geometrically local Hamiltonian whose logical information is recoverable for arbitrary long times in the \(n\to\infty\) limit after interaction with a sufficiently cold thermal environment. Typically, one also requires a decoder whose decoding time scales polynomially with \(n\) and a finite energy density. The original criteria for a self-correcting quantum memory, informally known as the Caltech rules [18][19], also required finite-spin Hamiltonians. |

String-net code | Also called a Turaev-Viro or Levin-Wen model code. A family of topological codes, defined by a finite unitary fusion category \( \mathcal{C} \), whose generators are few-body operators acting on a cell decomposition dual to a triangulation of a two-dimensional surface (with a qudit of dimension \( |\mathcal{C}| \) located at each edge of the decomposition). |

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 error correction on a surface code with parallel syndrome extraction. |

Symmetry-protected self-correcting quantum code | Also called a symmetry-protected self-correcting memory. An restricted notion of thermal stability against symmetric perturbations, i.e., perturbations that commute with a set of operators forming a group \(G\) called the symmetry group. |

Tensored-Ramanujan-complex product code | Code constructed in a similar way as the Ramanujan-complex product code, but utilizing tensor products of Ramanujan complexes in order to improve code distance 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. |

Topological code | Stub. |

Translationally invariant stabilizer code | A geometrically local qubit or qudit stabilizer code with qudits organized on a lattice modeled by the additive group \(\mathbb{Z}^D\) for spatial dimension \(D\) such that each lattice point, referred to as a site, contains \(m\) qudits of dimension \(q\). The stabilizer group of the translationally invariant code is generated by site-local Pauli operators and their translations. |

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). |

Triorthogonal code | A triorthogonal \(m \times n\) binary matrix 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\), where addition and multiplication are done on \(\mathbb{Z}_2\). The triorthogonal code associated with the matrix is constructed by mapping non-zero entries in even-weight rows to \(X\) operators, and \(Z\) operators for each row in the orthogonal complement. |

Two-component cat code | Code whose codespace is spanned by two coherent states \(\left|\pm\alpha\right\rangle\) for nonzero complex \(\alpha\). An orthonormal basis for the codespace consists of the bosonic cat states \begin{align} |\overline{\pm}\rangle=\frac{\left|\alpha\right\rangle \pm\left|-\alpha\right\rangle }{\sqrt{2\left(1\pm e^{-2|\alpha|^{2}}\right)}} \end{align} for any complex \(\alpha\). |

Two-dimensional 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). |

Wasilewski-Banaszek code | Three-oscillator Fock-state code encoding a single logical qubit using codewords \begin{align} \begin{split} |\overline{0}\rangle &= \frac{1}{\sqrt{3}}(|003\rangle+|030\rangle+|300\rangle)\\ |\overline{1}\rangle &= |111\rangle \end{split}. \end{align} |

XY surface code | Also called the tailored surface code (TSC). Non-CSS derivative of the surface code whose generators are \(XXXX\) and \(YYYY\), obtained by mapping \(Z \to Y\) in the surface code. |

XYZ product code | A non-CSS QLDPC code constructed from three classical codes. The construction of an XYZ product code is similar to that of a hypergraph product code and related 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. |

XYZ\(^2\) hexagonal stabilizer code | An instance of the matching code based on the Kitaev honeycomb model. It is described on a hexagonal lattice 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 \(XZXZ\) 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). |

\((5,1,2)\)-convolutional code | Quantum convolutional code with the stabilizer generators \begin{align} \begin{array}{cccccccc} X & Z & I & I & I & I & I & \cdots\\ Z & X & X & Z & I & I & I & \cdots\\ I & Z & X & X & Z & I & I & \cdots\\ I & I & Z & X & X & Z & I & \cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots \end{array} \end{align} |

\([[15, 7, 3]]\) Hamming-based CSS code | Self-dual Hamming-based CSS code that admits permutation-based CZ logical gates. |

\([[15,1,3]]\) quantum Reed-Muller code | \([[15,1,3]]\) CSS code that is most easily thought of as a tetrahedral 3D color code. This code contains 15 qubits, represented by four vertices, four face centers, six edge centers, and one body center. The tetrahedron is cellulated into four identical polyhedron cells by connecting the body center to all four face centers, where each face center is then connected by three adjacent edge centers. Each colored cell corresponds to a weight-8 \(X\)-check, and each face corresponds to a weight-4 \(Z\)-check. A logical \(Z\) is any weight-3 \(Z\)-string along an edge of the entire tetrahedron. The logical \(X\) is any weight-7 \(X\)-face of the entire tetrahedron. |

\([[2^r-1, 1, 3]]\) quantum Reed-Muller code | Member of CSS code family constructed with a first-order punctured RM\((1,r)\) \([2^r-1,r+1,2^{r-1}-1]\) code and its even subcode for \(r \geq 3\). Each code transversally implements a member of an infinite family of diagonal gates from the Clifford hierarchy [20]. |

\([[2^r-1, 2^r-2r-1, 3]]\) Hamming-based CSS code | CCS code constructed with a classical Hamming code \([2^r-1,2^r-1-r,3]=C_X=C_Z\) a.k.a. a first-order punctured Reed-Muller code RM\((r-2,r)\). |

\([[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\). |

\([[2m,2m-2,2]]\) error-detecting code | Also known as the iceberg code. CSS stabilizer code for \(m\geq 2\) with generators \(\{XX\cdots X, ZZ\cdots Z\} \) acting on all \(2m\) physical qubits. Admits a basis such that each codeword is a superposition of a computational basis state labeled by a bitstring \(b\) and a state labeled by the negation of \(b\). Such states generalize the two-qubit Bell states and three-qubit GHz states and are often called cat states. |

\([[4,2,2]]\) CSS code | Also known as the \(C_4\) code. Four-qubit CSS stabilizer code with generators \(\{XXXX, ZZZZ\} \) and codewords \begin{align} \begin{split} |\overline{00}\rangle = (|0000\rangle + |1111\rangle)/\sqrt{2}~{\phantom{.}}\\ |\overline{01}\rangle = (|0011\rangle + |1100\rangle)/\sqrt{2}~{\phantom{.}}\\ |\overline{10}\rangle = (|0101\rangle + |1010\rangle)/\sqrt{2}~{\phantom{.}}\\ |\overline{11}\rangle = (|0110\rangle + |1001\rangle)/\sqrt{2}~. \end{split} \end{align} This code is the smallest single-qubit error-detecting code. It is also the smallest instance of the toric code, and its various single-qubit subcodes are small planar surface codes. |

\([[7,1,3]]\) Steane code | A \([[7,1,3]]\) CSS code that uses the classical binary \([7,4,3]\) Hamming code for protecting against both \(X\) and \(Z\) errors. The parity-check matrix for the \([7,4,3]\) Hamming code is \begin{align} H = \left(\begin{matrix} 1&0&0&1&0&1&1\\ 0&1&0&1&1&0&1\\ 0&0&1&0&1&1&1 \end{matrix}\right), \end{align} and the check matrix for the Steane code is therefore \begin{align} \left(\begin{matrix} 0&H\\ H&0 \end{matrix}\right). \end{align} The stabilizer group for the Steane code has six generators. Logical codewords are \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{\sqrt{8}}\Big(|0000000\rangle+|1010101\rangle+|0110011\rangle+|1100110\rangle\\&\,\,\,\,\,\,\,\,+|0001111\rangle+|1011010\rangle+|0111100\rangle+|1101001\rangle\Big)\\|\overline{1}\rangle&=\frac{1}{\sqrt{8}}\Big(|1111111\rangle+|0101010\rangle+|1001100\rangle+|0011001\rangle\\&\,\,\,\,\,\,\,\,+|1110000\rangle+|0100101\rangle+|1000011\rangle+|0010110\rangle\Big)~. \end{split} \end{align} The automorphism group of the code is \(PGL(3,2)\) [21]. |

\([[8,3,2]]\) code | Smallest 3D color code whose physical qubits lie on vertices of a cube and which admits a transversal CCZ gate. Similar constructions exist on \(d\)-dimensional hypercubes and are called hyperoctahedron \([[2^d,d,2]]\) codes [22]. |

\([[9,1,3]]\) Shor code | Nine-qubit CSS code that is the smallest such code to correct a single-qubit error. Logical codewords are \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{2\sqrt{2}}\left(|000\rangle+|111\rangle\right)^{\otimes3}\\ |\overline{1}\rangle&=\frac{1}{2\sqrt{2}}\left(|000\rangle-|111\rangle\right)^{\otimes3}~. \end{split} \end{align} The code works by concatenating each qubit of a phase-flip with a bit-flip repetition code. Therefore, the code can correct both type of errors simultaneously. |

\([[k+4,k,2]]\) H code | Family of \([[k+4,k,2]]\) CSS codes with transversal Hadamard gates; relevant to magic state distillation. 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}\). |

## References

- [1]
- K. P. Michnicki, “3D Topological Quantum Memory with a Power-Law Energy Barrier”, Physical Review Letters 113, (2014). DOI; 1406.4227
- [2]
- Dimiter Ostrev et al., “Classical product code constructions for quantum Calderbank-Shor-Steane codes”. 2209.13474
- [3]
- A. M. Kubica, The Abcs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-tolerant Quantum Computation and Quantum Phases of Matter, California Institute of Technology, 2018. DOI
- [4]
- H. Bombin, “An Introduction to Topological Quantum Codes”. 1311.0277
- [5]
- M. B. Hastings, “Weight Reduction for Quantum Codes”. 1611.03790
- [6]
- Shai Evra, Tali Kaufman, and Gilles Zémor, “Decodable quantum LDPC codes beyond the $\sqrt{n}$ distance barrier using high dimensional expanders”. 2004.07935
- [7]
- P. Faist et al., “Continuous Symmetries and Approximate Quantum Error Correction”, Physical Review X 10, (2020). DOI; 1902.07714
- [8]
- M. H. Freedman, “<b>Z</b><sub>2</sub>–Systolic-Freedom”, Proceedings of the Kirbyfest (1999). DOI
- [9]
- E. Fetaya, “Bounding the distance of quantum surface codes”, Journal of Mathematical Physics 53, 062202 (2012). DOI
- [10]
- 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). DOI; quant-ph/0609070
- [11]
- Iryna Andriyanova, Denise Maurice, and Jean-Pierre Tillich, “New constructions of CSS codes obtained by moving to higher alphabets”. 1202.3338
- [12]
- P. Sarvepalli, “Topological color codes over higher alphabet”, 2010 IEEE Information Theory Workshop (2010). DOI
- [13]
- J. Haah, “Local stabilizer codes in three dimensions without string logical operators”, Physical Review A 83, (2011). DOI; 1101.1962
- [14]
- A. Dua et al., “Sorting topological stabilizer models in three dimensions”, Physical Review B 100, (2019). DOI; 1908.08049
- [15]
- A. Kitaev, “Anyons in an exactly solved model and beyond”, Annals of Physics 321, 2 (2006). DOI; cond-mat/0506438
- [16]
- S. B. Bravyi and A. Yu. Kitaev, “Quantum codes on a lattice with boundary”. quant-ph/9811052
- [17]
- Dave Bacon and Andrea Casaccino, “Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes”. quant-ph/0610088
- [18]
- C. G. Brell, “A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)”, New Journal of Physics 18, 013050 (2016). DOI; 1411.7046
- [19]
- O. Landon-Cardinal et al., “Perturbative instability of quantum memory based on effective long-range interactions”, Physical Review A 91, (2015). DOI; 1501.04112
- [20]
- S. X. Cui, D. Gottesman, and A. Krishna, “Diagonal gates in the Clifford hierarchy”, Physical Review A 95, (2017). DOI; 1608.06596
- [21]
- Hanson Hao, “Investigations on Automorphism Groups of Quantum Stabilizer Codes”. 2109.12735
- [22]
- M. Vasmer and A. Kubica, “Morphing Quantum Codes”, PRX Quantum 3, (2022). DOI; 2112.01446