Here is a list of 2D stabilizer codes.
Code Description
2D color code Color code defined on a two-dimensional planar graph. Each face hosts two stabilizer generators, a Pauli-\(X\) and a Pauli-\(Z\) string acting on all the qubits of the face.
2D hyperbolic surface code Hyperbolic surface codes based on a tessellation of a closed 2D manifold with a hyperbolic geometry (i.e., non-Euclidean geometry, e.g., saddle surfaces when defined on a 2D plane).
2D lattice stabilizer code Lattice stabilizer code in two spatial dimensions.
Abelian TQD stabilizer code Modular-qudit stabilizer code whose codewords realize 2D modular gapped Abelian topological order. The corresponding anyon theory is defined by an Abelian group and a Type-III group cocycle that can be decomposed as a product of Type-I and Type-II group cocycles; see [1; Sec. IV.A]. Abelian TQDs realize all modular gapped Abelian topological orders [1]. Many Abelian TQD code Hamiltonians were originally formulated as commuting-projector models [2].
Abelian quantum-double stabilizer code Modular-qudit stabilizer code whose codewords realize 2D modular gapped Abelian topological order with trivial cocycle. The corresponding anyon theory is defined by an Abelian group. All such codes can be realized by a stack of modular-qudit surface codes because all Abelian groups are Kronecker products of cyclic groups.
Analog surface code An analog CSS version of the Kitaev surface code realizing a phase of 2D \(\mathbb{R}\) gauge theory.
Bivariate bicycle (BB) code One of several Abelian 2BGA codes which admit time-optimal syndrome measurement circuits that can be implemented in a two-layer architecture, a generalization of the square-lattice architecture optimal for the surface codes.
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.
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 [3]. This results in a pinning of each mode to the space of periodic functions, which make up a physical rotor, and can be thought of as compactification of the 2D \(\mathbb{R}\) gauge theory phase realized by the analog surface code.
Double-semion stabilizer code A 2D lattice modular-qudit stabilizer code with qudit dimension \(q=4\) that is characterized by the 2D double semion topological phase. The code can be obtained from the \(\mathbb{Z}_4\) surface code by condensing the anyon \(e^2 m^2\) [4]. Originally formulated as the ground-state space of a Hamiltonian with non-commuting terms [5], which can be extended to other spatial dimensions [6], and later as a commuting-projector code [2,7].
Five-qubit perfect code Five-qubit cyclic stabilizer code that is the smallest qubit stabilizer code to correct a single-qubit error.
GKP-surface code A concatenated code whose outer code is a GKP code and whose inner code is a toric surface code [8], rotated surface code [9–13], or XZZX surface code [14].
Galois-qudit color code Extension of the color code to 2D lattices of Galois qudits.
Galois-qudit surface code Extension of the surface code to 2D lattices of Galois qudits.
Honeycomb (6.6.6) color code Triangular color code defined on a patch of the 6.6.6 (honeycomb) tiling.
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.
Matching code Member of a class of qubit stabilizer codes based on the Abelian phase of the Kitaev honeycomb model.
Modular-qudit surface code Extension of the surface code to prime-dimensional [15,16] and more general modular qudits [17]. Stabilizer generators are few-body \(X\)-type and \(Z\)-type Pauli strings associated to the stars and plaquettes, respectively, of a tessellation of a two-dimensional surface. Since qudits have more than one \(X\) and \(Z\)-type operator, various sets of stabilizer generators can be defined. Ground-state degeneracy and the associated phase depends on the qudit dimension and the stabilizer generators.
Rotated surface code Variant of the surface code defined on a square lattice that has been rotated 45 degrees such that qubits are on vertices, and both \(X\)- and \(Z\)-type check operators occupy plaquettes in an alternating checkerboard pattern.
Square-lattice cluster-state code A code based on the cluster state on a square lattice that was used in the the first proposal for MBQC [18,19].
Square-octagon (4.8.8) color code Triangular 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 [20].
Stellated color code A non-CSS color code on a lattice patch with a single twist defect at the center of the patch.
Surface-17 code A \([[9,1,3]]\) rotated surface code named for the sum of its 9 data qubits and 8 syndrome qubits. It uses the smallest number of qubits to perform fault-tolerant error correction on a surface code with parallel syndrome extraction.
Toric code Version of the Kitaev surface code on the two-dimensional torus, encoding two logical qubits. Being the first manifestation of the surface code, "toric code" is often an alternative name for the general construction. Twisted toric code [21; Fig. 8] refers to the construction on a torus with twisted (a.k.a. shifted) boundary conditions.
Triangular surface code A surface code with weight-four stabilizer generators defined on a triangular lattice patch that are examples of twist-defect surface code with a single twist defect at the center of the patch. The codes use about \(25\%\) fewer physical per logical qubit for a given distance compared to the surface code.
Truncated trihexagonal (4.6.12) color code Triangular color code defined on a patch of the 4.6.12 (truncated trihexagonal or square-hexagon-dodecagon) tiling.
Twist-defect color code A non-CSS extension of the 2D color code whose non-CSS stabilizer generators are associated with twist defects of the associated lattice.
Twist-defect surface code A non-CSS extension of the 2D surface-code construction whose non-CSS stabilizer generators are associated with twist defects of the associated lattice. A related construction [22] doubles the number of qubits in the lattice via symplectic doubling.
Twisted XZZX toric code A cyclic code that can be thought of as the XZZX toric code with shifted (a.k.a twisted) boundary conditions. Admits a set of stabilizer generators that are cyclic shifts of a particular weight-four \(XZZX\) Pauli string. For example, a seven-qubit \([[7,1,3]]\) variant has stabilizers generated by cyclic shifts of \(XZIZXII\) [23]. Codes encode either one or two logical qubits, depending on qubit geometry, and perform well against biased noise [24].
Union-Jack color code Triangular color code defined on a patch of the Tetrakis square tiling (a.k.a. the Union Jack lattice).
XY surface code Non-CSS derivative of the surface code whose generators are \(XXXX\) and \(YYYY\), obtained by mapping \(Z \to Y\) in the surface code.
XYZ color code Non-CSS variant of the 6.6.6 color code whose generators are \(XZXZXZ\) and \(ZYZYZY\) Pauli strings associated to each hexagonal in the hexagonal (6.6.6) tiling. A further variation called the domain wall color code admits generators of the form \(XXXZZZ\) and \(ZZZXXX\) [25].
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 \(XZZX\) Pauli strings associated, clock-wise, to the vertices of each face of a two-dimensional lattice (with a qubit located at each vertex of the tessellation).
\(U(1)_{2n} \times U(1)_{-2m}\) Chern-Simons GKP code A non-CSS multimode GKP code defined on a 2D mode lattice that encodes a qudit logical space and whose excitations are characterized by the \(U(1)_{2n} \times U(1)_{-2m}\) Chern-Simons theory. The code can be obtained from the analog surface code by condensing certain anyons [3].
\([[13,1,5]]\) cyclic code Thirteen-qubit twisted surface code for which there is a set of stabilizer generators consisting of cyclic permutations of the \(XZZX\)-type Pauli string \(XIZZIXIIIIIII\). The code can be thought of as a small twisted XZZX code [26; Exam. 11 and Fig. 3].
\([[14,3,3]]\) Rhombic dodecahedron surface code A \([[14,3,3]]\) twist-defect surface code whose qubits lie on the vertices of a rhombic dodecahedron. Its non-CSS nature is due to twist defects [27] stemming from the geometry of the polytope.
\([[144,12,12]]\) gross code A BB code which requires less physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance. The gross code is equivalent to 8 copies of the surface code via a constant-depth Clifford circuit, and is an element of a larger family of 2D stabilizer codes [28]. The name stems from the fact that a gross is a dozen dozen.
\([[30,8,3]]\) Bring code A \([[30,8,3]]\) hyperbolic surface code on a quotient of the \(\{5,5\}\) hyperbolic tiling called Bring's curve. Its qubits and stabilizer generators lie on the vertices of the small stellated dodecahedron. Admits a set of weight-five stabilizer generators.
\([[4,2,2]]\) Four-qubit code Four-qubit CSS stabilizer code is the smallest qubit stabilizer code to detect a single-qubit error.
\([[5,1,2]]\) rotated surface code Rotated surface code on one rung of a ladder, with one qubit on the rung, and four qubits surrounding it.
\([[6,4,2]]\) error-detecting code Error-detecting six-qubit code with rate \(2/3\) whose codewords are cat/GHZ states. A set of stabilizer generators is \(XXXXXX\) and \(ZZZZZZ\). It is the unique code for its parameters, up to equivalence [29; Tab. III]. Concatenations of this code with itself yield the \([[6^r,4^r,2^r]]\) level-\(r\) many-hypercube code [30].
\([[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 [31]. The code is constructed using the classical binary \([7,4,3]\) Hamming code for protecting against both \(X\) and \(Z\) errors.
\([[7,1,3]]\) twist-defect surface code A \([[7,1,3]]\) code (different from the Steane code) that is a small example of a twist-defect surface code.
\([[9,1,3]]\) Shor code Nine-qubit CSS code that is the first quantum error-correcting code.
\([[9,1,3]]_{\mathbb{Z}_q}\) modular-qudit code Modular-qudit CSS code that generalizes the \([[9,1,3]]\) Shor code using properties of the multiplicative group \(\mathbb{Z}_q\).

References

[1]
T. D. Ellison, Y.-A. Chen, A. Dua, W. Shirley, N. Tantivasadakarn, and D. J. Williamson, “Pauli Stabilizer Models of Twisted Quantum Doubles”, PRX Quantum 3, (2022) arXiv:2112.11394 DOI
[2]
J. C. Magdalena de la Fuente, N. Tarantino, and J. Eisert, “Non-Pauli topological stabilizer codes from twisted quantum doubles”, Quantum 5, 398 (2021) arXiv:2001.11516 DOI
[3]
J. C. M. de la Fuente, T. D. Ellison, M. Cheng, and D. J. Williamson, “Topological stabilizer models on continuous variables”, (2024) arXiv:2411.04993
[4]
T. D. Ellison, Y.-A. Chen, A. Dua, W. Shirley, N. Tantivasadakarn, and D. J. Williamson, “Pauli topological subsystem codes from Abelian anyon theories”, Quantum 7, 1137 (2023) arXiv:2211.03798 DOI
[5]
M. A. Levin and X.-G. Wen, “String-net condensation: A physical mechanism for topological phases”, Physical Review B 71, (2005) arXiv:cond-mat/0404617 DOI
[6]
M. H. Freedman and M. B. Hastings, “Double Semions in Arbitrary Dimension”, Communications in Mathematical Physics 347, 389 (2016) arXiv:1507.05676 DOI
[7]
G. Dauphinais, L. Ortiz, S. Varona, and M. A. Martin-Delgado, “Quantum error correction with the semion code”, New Journal of Physics 21, 053035 (2019) arXiv:1810.08204 DOI
[8]
C. Vuillot, H. Asasi, Y. Wang, L. P. Pryadko, and B. M. Terhal, “Quantum error correction with the toric Gottesman-Kitaev-Preskill code”, Physical Review A 99, (2019) arXiv:1810.00047 DOI
[9]
K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, “High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction”, Physical Review X 8, (2018) arXiv:1712.00294 DOI
[10]
K. Noh and C. Chamberland, “Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code”, Physical Review A 101, (2020) arXiv:1908.03579 DOI
[11]
M. V. Larsen, C. Chamberland, K. Noh, J. S. Neergaard-Nielsen, and U. L. Andersen, “Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture”, PRX Quantum 2, (2021) arXiv:2101.03014 DOI
[12]
K. Noh, C. Chamberland, and F. G. S. L. Brandão, “Low-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code”, PRX Quantum 3, (2022) arXiv:2103.06994 DOI
[13]
M. Lin, C. Chamberland, and K. Noh, “Closest Lattice Point Decoding for Multimode Gottesman-Kitaev-Preskill Codes”, PRX Quantum 4, (2023) arXiv:2303.04702 DOI
[14]
J. Zhang, Y.-C. Wu, and G.-P. Guo, “Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code”, Physical Review A 107, (2023) arXiv:2207.04383 DOI
[15]
A. Yu. Kitaev, “Fault-tolerant quantum computation by anyons”, Annals of Physics 303, 2 (2003) arXiv:quant-ph/9707021 DOI
[16]
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
[17]
H. Watanabe, M. Cheng, and Y. Fuji, “Ground state degeneracy on torus in a family of ZN toric code”, Journal of Mathematical Physics 64, (2023) arXiv:2211.00299 DOI
[18]
R. Raussendorf, D. Browne, and H. Briegel, “The one-way quantum computer--a non-network model of quantum computation”, Journal of Modern Optics 49, 1299 (2002) arXiv:quant-ph/0108118 DOI
[19]
R. Raussendorf and H. J. Briegel, “A One-Way Quantum Computer”, Physical Review Letters 86, 5188 (2001) DOI
[20]
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
[21]
N. P. Breuckmann and J. N. Eberhardt, “Balanced Product Quantum Codes”, IEEE Transactions on Information Theory 67, 6653 (2021) arXiv:2012.09271 DOI
[22]
S. Burton, E. Durso-Sabina, and N. C. Brown, “Genons, Double Covers and Fault-tolerant Clifford Gates”, (2024) arXiv:2406.09951
[23]
A. Robertson, C. Granade, S. D. Bartlett, and S. T. Flammia, “Tailored Codes for Small Quantum Memories”, Physical Review Applied 8, (2017) arXiv:1703.08179 DOI
[24]
Q. Xu, N. Mannucci, A. Seif, A. Kubica, S. T. Flammia, and L. Jiang, “Tailored XZZX codes for biased noise”, (2022) arXiv:2203.16486
[25]
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
[26]
A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design of additive quantum codes via the code-word-stabilized framework”, Physical Review A 84, (2011) arXiv:1108.5490 DOI
[27]
H. Bombin, “Topological Order with a Twist: Ising Anyons from an Abelian Model”, Physical Review Letters 105, (2010) arXiv:1004.1838 DOI
[28]
Z. Liang, B. Yang, J. T. Iosue, and Y.-A. Chen, “Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes”, (2024) arXiv:2410.11942
[29]
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
[30]
H. Goto, “High-performance fault-tolerant quantum computing with many-hypercube codes”, Science Advances 10, (2024) arXiv:2403.16054 DOI
[31]
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