Description
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 [3].
3D toric code often either refers to the construction on the three-dimensional torus or is an alternative name for the general construction. The construction on surfaces with boundaries is often called the 3D planar code. In the open-boundary hypercubic family of [4], setting one linear dimension of the tesseract construction to \(1\) yields a single-qubit cubic code that interpolates between the planar surface code and the 4D tesseract code. There exists a rotated version of the 3D surface code, the 3D rotated surface code, akin to the (2D) rotated surface code [5]. The welded surface code [6,7] places 3D surface codes on the edges of a 3D cubic lattice and welds their rough boundaries at each vertex. Welding identifies the qubits of the joined boundaries, keeps all \(X\)-type stabilizers, and takes as \(Z\)-type stabilizers all \(Z\)-type operators commuting with them [6]. This first gives a code with no logical qubits, so a welded \(Z\)-type stabilizer generator is then promoted to a logical operator to encode one qubit [6]. A \(Z\) error on a welded qubit excites an \(X\)-type stabilizer in every code meeting there, so \(X\)-type excitations split at each weld [6]. The string-like \(Z\)-type logical operator becomes a branching string whose energy barrier is lower bounded by that of the Ising model on the lattice [6]. In the rectified picture, three 3D surface codes can be supported on the same rectified cubic lattice, and the corresponding cubic-lattice realization is a gauge choice of the 3D Bacon-Shor code [8].
Related models [9] on lattices with certain colorability are equivalent to several copies of the 3D surface code [10].
Protection
The planar 3D surface code family on a cubic lattice of length \(L\) has parameters \([[2L(L-1)^2+L^3,1,d_X=L^2,d_Z=L]]\), while the 3D toric code has parameters \([[3L^3,3,d_X=L^2,d_Z=L]]\). Rectangular open-boundary 3D versions furnish single-qubit \([[71,1,6]]\), \([[177,1,9]]\), \([[331,1,12]]\), and \([[616,1,16]]\) codes, illustrating an \(n\propto 3d^2\) tradeoff between the 2D surface and 4D tesseract families [4]. Membrane-like logical operators have an energy barrier of order \(O(L)\), while string-like logical operators have a constant energy barrier [6].
The welded surface code on a cube of side length \(L\) has parameters \([[O(L^3),1,O(L^{4/3})]]\) and an energy barrier of order \(O(L^{2/3})\) [6,7]. The welded surface code is translation invariant only over a length that grows with system size, which evades the no-go theorems for translationally invariant 3D stabilizer codes [6,7].
A tensor-network representation of the 3D surface-code ground state is stable under a generating set of uniform local tensor perturbations [11]. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.
Transversal and Permutation-Based Gates
For a stack of three 3D surface codes on the same rectified cubic lattice, pairwise logical \(CZ\) and triple logical \(CCZ\) gates are transversal [8].Gates
There is a CZ gate for the 3D toric code on a Klein bottle \(\times S^1\) [12].Lattice surgery [8].Single-shot lattice surgery for the 3D toric/surface code can be formulated using the fault-complex formalism [13].3D and Hybrid 2D-3D surface code computation using lattice surgery and without magic-state distillation [8].Fault-tolerant Hadamard gate using teleportation and error correction [8].Three distance-\(d\) 3D surface/toric codes with open boundaries and cyclically permuted lattice axes admit a logical \(CCZ\) gate via transversal physical \(CCZ\) gates; concatenating each supporting qubit triple with an \([[8,3,2]]\) block yields a \([[8n,3,2d]]\) 3D toric/color family whose smallest member has parameters \([[72,3,4]]\) [14].Various inter-code \(CZ\) and \(CCZ\) gates implemented via constant-depth circuits on stacks or coupled collections of 3D surface/toric codes [8,15–20], with \(CZ\) gates formulated in terms of the slant product [21,22] or cup product [23] structures.Decoding
Flip decoder and its modification p-flip [24].Tensor-network decoder [25].Local decoder based on Toom’s rule for bit-flip errors and MWPM decoder for phase-flip errors in the 3D toric code, with extensions to welded surface codes [26].Generalization of linear-time ML erasure decoder [27] to 3D surface codes [26].Equivariant machine learning decoder [28].Fault Tolerance
Fault-tolerant Hadamard gate using teleportation and error correction [8].Code Capacity Threshold
Independent \(X,Z\) noise: \(12\%\) for the bit-flip channel with a local decoder based on Toom’s rule and \(3\%\) for the phase-flip channel with MWPM decoding for the 3D toric code [26]. RG decoding yields \(17.2\%\) for the surface-like logical operator of the 3D cubic code. The optimal threshold for its line-like logical operator is about \(3.3\%\) [4].Erasure noise: \(24.8\%\) with generalization of linear-time ML erasure decoder [27] to 3D surface codes [26]. No threshold was observed for the welded surface code [26].Threshold
Phenomenological noise model for the 3D toric code: \(2.90(2)\%\) under MWPM syndrome repair followed by BP-OSD decoding [29], \(7.1\%\) under improved BP-OSD [30], and \(2.6\%\) under flip decoder [24]. For the surface-like logical operator of the 3D cubic code, RG decoding yields \(7.3\%\) [4]. For 3D surface code: \(3.08(4)\%\) under MWPM syndrome repair followed by BP-OSD decoding [29]. Optimal thresholds of \(11\%\) under \(X\)-type and \(2\%\) under \(Z\)-type noise for the 3D toric code are derived in Ref. [31].Cousins
- Bacon-Shor code— In the rectified-cubic construction, the resulting cubic-lattice 3D surface codes are particular gauge choices of the 3D Bacon-Shor code [8].
- Chamon model code— The 3D planar and toric code on a cubic lattice can be obtained from a hypergraph product of three repetition codes [33][32; Exam. A.1]. The Chamon code is an XYZ product of three repetition codes [34; Sec. 3.4].
- Rotated surface code— There exists a rotated version of the 3D surface code, akin to the (2D) rotated surface code [5].
- Hamiltonian-based code— A tensor-network representation of the 3D surface-code ground state is stable under a generating set of uniform local tensor perturbations [11]. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.
- Higher-dimensional homological product code— The 3D planar and toric code on a cubic lattice can be obtained from a hypergraph product of three repetition codes [33][32; Exam. A.1].
- Repetition code— The 3D planar and toric code on a cubic lattice can be obtained from a hypergraph product of three repetition codes [33][32; Exam. A.1].
- Self-correcting quantum code— The welded surface code has a power-law energy barrier [6,7] and is partially self-correcting [7]. The 3D toric code is a classical self-correcting memory, whose protected bit admits a membrane-like logical operator [35], but it is not a quantum self-correcting memory because the star terms thermalize [36].
- Floquet 3D surface code— The G-round ISG is FDLQC-equivalent to the 3D surface code, while the other rounds are FDLQC-equivalent to two copies of the 3D surface code up to non-local stabilizers [37].
- X-cube Floquet code— The B- and first R-round ISGs of the rewinding schedule are FDLQC-equivalent to the product of the X-cube model, a 3D surface code, and a 3-foliated stack of 2D surface codes up to non-local stabilizers [37].
- \([[8,3,2]]\) Smallest interesting color code— Three cyclically rotated copies of the 3D surface/toric code admit a logical \(CCZ\) gate via transversal physical \(CCZ\) gates, and concatenating each such qubit triple with an \([[8,3,2]]\) block yields a 3D toric/color family with parameters \([[8n,3,2d]]\); its smallest member has parameters \([[72,3,4]]\) [14].
- Recursive 3D self-correcting code— The local complexes that replace each square in the recursive 3D self-correcting code construction resemble pieces of thickness-one 3D surface code slabs with membrane-condensing front and back boundaries [38; Remark 3.7].
- Sierpinski prism model code— The Sierpinski prism model code admits a topological defect network construction out of 3D surface codes on triangular prisms [39,40].
- Haah cubic code (CC)— The Haah B-code admits a topological defect network construction out of two copies of the 3D surface code [39].
- X-cube model code— The X-cube model admits a topological defect network construction out of 3D surface codes [39,40].
- 3D color code— On closed 3-manifolds, the 3D color code is equivalent to multiple decoupled copies of the 3D surface code via a local constant-depth Clifford circuit [15,41,42]. This process can be viewed as an ungauging [43–52] of certain symmetries. This mapping can also be done via code concatenation [8]. In contrast to the 3D surface/toric code, the original colex Hamiltonian can be viewed as both a string-net condensate and a membrane-net condensate [9].
- Tetrahedral color code— A tetrahedral 3D color code with four differently colored boundaries is equivalent, via a local Clifford circuit, to three 3D surface codes attached along one boundary, with condensation of a composite electric charge on that attached boundary [15].
- Klein-bottle surface code— There is a CZ gate for the 3D toric code on a Klein bottle \(\times S^1\) [12].
- 3D fermionic surface code— The 3D (fermionic) surface code is a CSS (non-CSS) code which realizes a \(\mathbb{Z}_2\) gauge theory in 3D (with an emergent fermion). Two copies of the 3D fermionic surface code are equivalent to a copy of the 3D surface code and a copy of the 3D fermionic surface code via anyon relabeling: the two incoming fermions, \(f_1\) and \(f_2\), can be re-organized into a boson \(f_1 f_2\) and fermion \(f_2\).
- \((2,2)\) Loop toric code— Setting one linear size of the open-boundary tesseract construction to \(1\) yields the cubic/3D surface code [4].
- Fractal surface code— 3D fractal surface codes are obtained by removing qubits from the 3D surface code on a cubic lattice.
- Three-fermion (3F) Walker-Wang model code— The 3F Walker-Wang model code is obtained from two copies of the 3D surface code on the same cubic lattice [53,54]. The copies are twisted together by decorating the face terms with \(X\)-type operators on the edges lying over and under each face [54]. Flux of one copy then confines the point excitations of the other [54].
- 3D subsystem color code— The 3D subsystem color code can be ungauged [43–52] to obtain six copies of \(\mathbb{Z}_2\) gauge theory with one-form symmetries [48].
- 3D subsystem surface code— The 3D subsystem surface code is a subsystem version of the 3D surface code.
Member of code lists
- 3D stabilizer codes
- Lattice qubit stabilizer codes
- Quantum codes
- Quantum codes based on homological products
- Quantum codes with code capacity thresholds
- Quantum codes with fault-tolerant gadgets
- Quantum codes with notable decoders
- Quantum codes with other thresholds
- Quantum codes with transversal or permutation-based gates
- Qubit CSS codes
- Self-correcting quantum codes and friends
- Surface code and friends
- Topological codes
Primary Hierarchy
References
- [1]
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI
- [2]
A. Hamma, P. Zanardi, and X.-G. Wen, “String and membrane condensation on three-dimensional lattices”, Physical Review B 72, (2005) arXiv:cond-mat/0411752 DOI
- [3]
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
- [4]
K. Duivenvoorden, N. P. Breuckmann, and B. M. Terhal, “Renormalization Group Decoder for a Four-Dimensional Toric Code”, IEEE Transactions on Information Theory 65, 2545 (2019) arXiv:1708.09286 DOI
- [5]
E. Huang, A. Pesah, C. T. Chubb, M. Vasmer, and A. Dua, “Tailoring Three-Dimensional Topological Codes for Biased Noise”, PRX Quantum 4, (2023) arXiv:2211.02116 DOI
- [6]
K. Michnicki, “3-d quantum stabilizer codes with a power law energy barrier”, (2012) arXiv:1208.3496
- [7]
K. P. Michnicki, “3D Topological Quantum Memory with a Power-Law Energy Barrier”, Physical Review Letters 113, (2014) arXiv:1406.4227 DOI
- [8]
M. Vasmer and D. E. Browne, “Three-dimensional surface codes: Transversal gates and fault-tolerant architectures”, Physical Review A 100, (2019) arXiv:1801.04255 DOI
- [9]
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
- [10]
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
- [11]
D. J. Williamson, C. Delcamp, F. Verstraete, and N. Schuch, “On the stability of topological order in tensor network states”, Physical Review B 104, (2021) arXiv:2012.15346 DOI
- [12]
M. Barkeshli, Y.-A. Chen, P.-S. Hsin, and R. Kobayashi, “Higher-group symmetry in finite gauge theory and stabilizer codes”, SciPost Physics 16, (2024) arXiv:2211.11764 DOI
- [13]
T. Hillmann, G. Dauphinais, I. Tzitrin, and M. Vasmer, “Single-shot and measurement-based quantum error correction via fault complexes”, Physical Review A 112, (2025) arXiv:2410.12963 DOI
- [14]
D. Hangleiter, M. Kalinowski, D. Bluvstein, M. Cain, N. Maskara, X. Gao, A. Kubica, M. D. Lukin, and M. J. Gullans, “Fault-Tolerant Compiling of Classically Hard Instantaneous Quantum Polynomial Circuits on Hypercubes”, PRX Quantum 6, (2025) arXiv:2404.19005 DOI
- [15]
A. Kubica, B. Yoshida, and F. Pastawski, “Unfolding the color code”, New Journal of Physics 17, 083026 (2015) arXiv:1503.02065 DOI
- [16]
Y.-A. Chen and S. Tata, “Higher cup products on hypercubic lattices: Application to lattice models of topological phases”, Journal of Mathematical Physics 64, (2023) arXiv:2106.05274 DOI
- [17]
G. Zhu, T. Jochym-O’Connor, and A. Dua, “Topological Order, Quantum Codes, and Quantum Computation on Fractal Geometries”, PRX Quantum 3, (2022) arXiv:2108.00018 DOI
- [18]
G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown, “Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries”, PRX Quantum 6, (2025) arXiv:2310.16982 DOI
- [19]
Y. Wang, Y. Wang, Y.-A. Chen, W. Zhang, T. Zhang, J. Hu, W. Chen, Y. Gu, and Z.-W. Liu, “Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays”, npj Quantum Information 10, (2024) arXiv:2312.09111 DOI
- [20]
Z. Song and G. Zhu, “Magic Boundaries of 3D Color Codes”, Quantum 9, 1831 (2025) arXiv:2404.05033 DOI
- [21]
B. Yoshida, “Gapped boundaries, group cohomology and fault-tolerant logical gates”, Annals of Physics 377, 387 (2017) arXiv:1509.03626 DOI
- [22]
M. Barkeshli, Y.-A. Chen, S.-J. Huang, R. Kobayashi, N. Tantivasadakarn, and G. Zhu, “Codimension-2 defects and higher symmetries in (3+1)D topological phases”, SciPost Physics 14, (2023) arXiv:2208.07367 DOI
- [23]
N. P. Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn, “Cups and Gates I: Cohomology Invariants and Logical Quantum Operations”, Communications in Mathematical Physics 407, (2026) arXiv:2410.16250 DOI
- [24]
T. R. Scruby and K. Nemoto, “Local Probabilistic Decoding of a Quantum Code”, Quantum 7, 1093 (2023) arXiv:2212.06985 DOI
- [25]
C. Piveteau, C. T. Chubb, and J. M. Renes, “Tensor-Network Decoding Beyond 2D”, PRX Quantum 5, (2024) arXiv:2310.10722 DOI
- [26]
A. Kulkarni and P. K. Sarvepalli, “Decoding the three-dimensional toric codes and welded codes on cubic lattices”, Physical Review A 100, (2019) arXiv:1808.03092 DOI
- [27]
N. Delfosse and G. Zémor, “Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel”, Physical Review Research 2, (2020) arXiv:1703.01517 DOI
- [28]
O. Weißl and E. Egorov, “An Equivariant Machine Learning Decoder for 3D Toric Codes”, 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC) 672 (2025) arXiv:2409.04300 DOI
- [29]
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, “Single-Shot Error Correction of Three-Dimensional Homological Product Codes”, PRX Quantum 2, (2021) arXiv:2009.11790 DOI
- [30]
O. Higgott and N. P. Breuckmann, “Improved Single-Shot Decoding of Higher-Dimensional Hypergraph-Product Codes”, PRX Quantum 4, (2023) arXiv:2206.03122 DOI
- [31]
J.-Z. Xu, Y. Zhong, M. A. Martin-Delgado, H. Song, and K. Liu, “Phenomenological noise models and optimal thresholds of the 3D toric code”, Quantum Science and Technology 11, 035022 (2026) arXiv:2510.20489 DOI
- [32]
L. Berent, T. Hillmann, J. Eisert, R. Wille, and J. Roffe, “Analog Information Decoding of Bosonic Quantum Low-Density Parity-Check Codes”, PRX Quantum 5, (2024) arXiv:2311.01328 DOI
- [33]
W. Zeng and L. P. Pryadko, “Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates”, Physical Review Letters 122, (2019) arXiv:1810.01519 DOI
- [34]
A. Leverrier, S. Apers, and C. Vuillot, “Quantum XYZ Product Codes”, Quantum 6, 766 (2022) arXiv:2011.09746 DOI
- [35]
O. Landon-Cardinal, B. Yoshida, D. Poulin, and J. Preskill, “Perturbative instability of quantum memory based on effective long-range interactions”, Physical Review A 91, (2015) arXiv:1501.04112 DOI
- [36]
S. Stengele, Á. Capel, L. Gao, A. Lucia, D. Pérez-García, A. Pérez-Hernández, C. Rouzé, and S. Warzel, “Modified Logarithmic Sobolev Inequalities for CSS Codes”, Communications in Mathematical Physics 407, (2026) arXiv:2510.03090 DOI
- [37]
A. Dua, N. Tantivasadakarn, J. Sullivan, and T. D. Ellison, “Engineering 3D Floquet Codes by Rewinding”, PRX Quantum 5, (2024) arXiv:2307.13668 DOI
- [38]
S. Balasubramanian, M. Davydova, and T.-C. Lin, “A passive self-correcting quantum memory in three dimensions”, (2026) arXiv:2605.10943
- [39]
D. Aasen, D. Bulmash, A. Prem, K. Slagle, and D. J. Williamson, “Topological defect networks for fractons of all types”, Physical Review Research 2, (2020) arXiv:2002.05166 DOI
- [40]
Z. Song, A. Dua, W. Shirley, and D. J. Williamson, “Topological Defect Network Representations of Fracton Stabilizer Codes”, PRX Quantum 4, (2023) arXiv:2112.14717 DOI
- [41]
B. Yoshida, “Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes”, Annals of Physics 326, 15 (2011) arXiv:1007.4601 DOI
- [42]
A. B. Aloshious, A. N. Bhagoji, and P. K. Sarvepalli, “On the Local Equivalence of 2D Color Codes and Surface Codes with Applications”, (2018) arXiv:1804.00866
- [43]
M. Levin and Z.-C. Gu, “Braiding statistics approach to symmetry-protected topological phases”, Physical Review B 86, (2012) arXiv:1202.3120 DOI
- [44]
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
- [45]
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
- [46]
D. J. Williamson, “Fractal symmetries: Ungauging the cubic code”, Physical Review B 94, (2016) arXiv:1603.05182 DOI
- [47]
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
- [48]
A. Kubica and B. Yoshida, “Ungauging quantum error-correcting codes”, (2018) arXiv:1805.01836
- [49]
W. Shirley, K. Slagle, and X. Chen, “Foliated fracton order from gauging subsystem symmetries”, SciPost Physics 6, (2019) arXiv:1806.08679 DOI
- [50]
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
- [51]
T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes I. Gauging and dualities”, (2023) arXiv:2310.16032
- [52]
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
- [53]
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
- [54]
C. Stahl and R. Nandkishore, “Symmetry-protected self-correcting quantum memory in three space dimensions”, Physical Review B 103, (2021) arXiv:2103.08622 DOI
- [55]
J. Haah, “A degeneracy bound for homogeneous topological order”, SciPost Physics 10, (2021) arXiv:2009.13551 DOI
Page edit log
- Victor V. Albert (2026-10-15) — most recent
- Victor V. Albert (2026-10-12)
- Victor V. Albert (2026-06-08)
- Nathanan Tantivasadakarn (2025-11-14)
- Victor V. Albert (2025-11-14)
- Aleksander Kubica (2022-05-16)
- Victor V. Albert (2022-05-16)
Cite as:
“3D surface code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/3d_surface, arXiv:2606.11484