Here is a list of codes related to self-correcting quantum memories.

[Jump to code graph excerpt]

Code Description
2D lattice stabilizer code Lattice stabilizer code in two Euclidean dimensions, using either the ordinary block notion of locality or the fermionic/Majorana notion of locality.
3D Bacon-Shor code Generalization of the Bacon-Shor code to three dimensions that was conjectured to be a self-correcting memory. It is defined on a cubic lattice and admits sheet-like stabilizer generators.
3D lattice stabilizer code Lattice stabilizer code in three Euclidean dimensions, using either the ordinary block notion of locality or the fermionic/Majorana notion of locality.
3D subsystem color code A subsystem version of the 3D color code defined on a 3-colex.
3D subsystem surface code Subsystem generalization of the surface code on a 3D cubic lattice with gauge-group generators of weight at most three.
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 [1].
Cat-repetition code A concatenated qubit-into-\(n\)-mode code obtained by encoding each qubit of a quantum repetition code into a two-component cat code in its cat-state basis.
Color code Member of a family of qubit CSS codes defined on particular \(D\)-dimensional graphs.
Concatenated quantum code A combination of two quantum codes, an inner code \(C_{in}\) and an outer code \(C_{out}\), where the physical subspace used for the inner code consists of the logical subspace of the outer code. In other words, one first encodes in the inner code, and then encodes each of its physical registers in the outer code. An inner \(C_{in} = ((n_1,K,d_1))_{q_1}\) and outer \(C_{out} = ((n_2,q_1,d_2))_{q_2}\) block quantum code yield an \(((n_1 n_2, K, d \geq d_1d_2))_{q_2}\) concatenated block quantum code [2].
Cubic theory code A geometrically local commuting-projector code family defined on triangulations in arbitrary spatial dimensions. Its Hamiltonian contains Pauli-\(Z\) flux terms and non-Pauli Gauss-law terms built from products of Pauli-\(X\) operators and \(CZ\) gates. These commuting non-Pauli stabilizers realize higher-form \(\mathbb{Z}_2^3\) gauge theories with Abelian electric excitations and non-Abelian magnetic excitations.
Expander code LDPC code whose parity-check matrix is derived from the adjacency matrix of a bipartite expander graph [3] such as a Ramanujan graph or a Cayley graph of a projective special linear group over a finite field [4,5]. Expander codes admit efficient encoding and decoding algorithms and yield an explicit (i.e., non-random) asymptotically good LDPC code family.
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 [6]. The underlying classical codes form classical self-correcting memories [7–9].
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-trivial 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.
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) [10; Thm. 1].
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.
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\), using either the ordinary block notion of locality or the fermionic/Majorana notion of locality. 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 a 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 geometrically local 3D qubit QLDPC codes obtained by coupling layers of 2D surface codes according to the check-qubit incidence structure of an input QLDPC code. Geometric locality is maintained because, instead of being concatenated, each pair of parallel surface-code squares is fused (or quasi-concatenated) with perpendicular surface-code squares via lattice surgery.
Low-density parity-check (LDPC) code A binary linear code with a sparse parity-check matrix. Often a member of an infinite family of \([n,k,d]\) codes for which the numbers of nonzero entries in each row and in each column of the parity-check matrix are both bounded above by a constant as \(n\to\infty\).
Matrix-model code Multimode Fock-state bosonic approximate code derived from a matrix model, i.e., a bosonic theory with a large non-Abelian 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.
QLDPC code Member of a family of 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 as \(n\to\infty\). Sometimes, the two parameters are explicitly stated: each site of an \((l,w)\)-regular QLDPC code is acted on by \(\leq l\) generators of weight \(\leq w\).
Quantum expander code CSS code constructed from a hypergraph product of bipartite expander graphs [3] 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.
Quantum locally testable code (QLTC) A local-projector Hamiltonian-based block quantum code which has a nonzero average-energy penalty for creating large errors. Informally, testing a randomly chosen local projector must reject states far from the codespace with probability bounded away from zero as \(n\) grows.
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\). This repetition-style encoding does not clone an arbitrary quantum state; instead, it extends the copying of computational-basis states linearly to entangled codewords [2; Ch. 2].
Quantum-double code Group-based code whose codewords realize 2D modular gapped topological order defined by a finite group \(G\). The code’s 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 tessellation). The original Hamiltonian can be re-expressed via group-based right- and left-multiplication \(X\)-type as well as \(Z\)-type error operators [11; Sec. 3.3].
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).
Recursive 3D self-correcting code Family of geometrically local 3D CSS codes, each encoding one logical qubit, whose stabilizer Hamiltonians are self-correcting [12]. Each iteration replaces every square of the Tanner square complex by two parallel layers joined by a thickness-two strip, doubling the syndrome weight of one error type [12; Sec. 3.2]. Alternating \(X\)-type and \(Z\)-type iterations makes this doubling occur at all length scales and for both error types.
Repetition code \([n,1,n]\) binary linear code encoding one bit of information into an \(n\)-bit string. Majority decoding requires \(n\) to be odd in order to avoid ties. The idea is to increase the code distance by repeating the logical information several times. Its automorphism group is \(S_n\).
Self-correcting quantum code A block quantum code that forms the ground-state subspace of an \(n\)-body geometrically local Hamiltonian whose logical information is recoverable for arbitrarily 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.
Single-shot code Block quantum qudit code whose error-syndrome weights increase linearly with the distance of the error state to the code space.
Symmetry-protected self-correcting quantum code A code which admits a 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.
Symmetry-protected topological (SPT) code A code whose codewords form the ground-state or low-energy subspace of a code Hamiltonian realizing symmetry-protected topological (SPT) order.
Three-fermion (3F) Walker-Wang model code A 3D lattice stabilizer code whose bulk realizes a 3D time-reversal SPT order [13] and whose gapped boundary supports the 2D three-fermion (3F) topological order. The code can be used as a resource state for fault-tolerant MBQC [14].
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 [15; 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 [16].
\((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 [17,18].

List: Union of:

  • •

    codes that are cousins of Self-correcting quantum code

  • •

    codes that are descendants of Symmetry-protected self-correcting quantum code

  • •

    codes that are cousins of Symmetry-protected self-correcting quantum code

References

  1. [1]

    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

  2. [2]

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

  3. [3]

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

  4. [4]

    A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan graphs”, Combinatorica 8, 261 (1988) DOI

  5. [5]

    G. Davidoff, P. Sarnak, and A. Valette, Elementary Number Theory, Group Theory and Ramanujan Graphs (Cambridge University Press, 2001) DOI

  6. [6]

    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

  7. [7]

    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

  8. [8]

    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

  9. [9]

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

  10. [10]

    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

  11. [11]

    V. V. Albert, D. Aasen, W. Xu, W. Ji, J. Alicea, and J. Preskill, “Spin chains, defects, and quantum wires for the quantum-double edge”, (2021) arXiv:2111.12096

  12. [12]

    S. Balasubramanian, M. Davydova, and T.-C. Lin, “A passive self-correcting quantum memory in three dimensions”, (2026) arXiv:2605.10943

  13. [13]

    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

  14. [14]

    S. Roberts and D. J. Williamson, “3-Fermion Topological Quantum Computation”, PRX Quantum 5, (2024) arXiv:2011.04693 DOI

  15. [15]

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

  16. [16]

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

  17. [17]

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

  18. [18]

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

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.