[Jump to code hierarchy]

3D surface code[1,2]

Alternative names: 3D toric code, 3D cubic code, Bosonic-charge bosonic-loop (BcBl) surface code.

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. There exists a rotated version of the 3D surface code, the 3D rotated surface code, akin to the (2D) rotated surface code [4]. The welded surface code [5] consists of several 3D surface codes stitched together in a way that the distance scales faster than the linear size of the system.

Related models [6,7] on lattices with certain colorability are equivalent to several copies of the 3D surface code [8].

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

Stability against Hamiltonian perturbations was determined using a tensor-network representation [9]. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.

Transversal Gates

Transversal \(CZ\) and \(CCZ\) gates [1016], with \(CZ\) gates formulated in terms of the slant product [17,18] or cup product [19] structures.

Gates

There is a CZ gate for the 3D toric code on a Klein bottle \(\times S^1\) [20].Lattice surgery [11].3D and Hybrid 2D-3D surface code computation using lattice surgery and without magic-state distillation [11].Fault-tolerant Hadamard gate using teleportation and error correction [11].

Decoding

Flip decoder and its modification p-flip [21].Tensor-network decoder [22].Efficient MWPM decoder for 3D toric and 3D welded surface codes handling string-like syndromes only [23].Generalization of linear-time ML erasure decoder [24] to 3D surface codes [23].Equivariant machine learning decoder [25].

Fault Tolerance

Fault-tolerant Hadamard gate using teleportation and error correction [11].

Code Capacity Threshold

Independent \(X,Z\) noise: \(12\%\) for bit-flip and \(3\%\) for phase-flip channels with MWPM decoder for 3D toric code [23], and \(17.2\%\) and \(3.3\%\) with RG decoder for 3D toric code [26].Erasure noise: \(24.8\%\) with generalization of linear-time ML erasure decoder [24] to 3D surface codes [23]. No threshold was observed for the 3D welded surface code [23].

Threshold

Phenomenological noise model for the 3D toric code: \(2.90(2)\%\) under BP-OSD decoder [27], \(7.1\%\) under improved BP-OSD [28], \(7.3\%\) under RG [26], and \(2.6\%\) under flip decoder [21]. For 3D surface code: \(3.08(4)\%\) under flip decoder [27].

Cousins

  • Chamon model code— The 3D planar (3D toric) code can be obtained from a hypergraph product of three repetition (cyclic) codes [30][29; Exam. A.1], while the Chamon code is an XYZ product of three repetition codes [31; Sec. 3.4].
  • Rotated surface code— There exists a rotated version of the 3D surface code, akin to the (2D) rotated surface code [4].
  • Hamiltonian-based code— Stability of the 3D surface code against Hamiltonian perturbations was determined using a tensor-network representation [9]. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.
  • Self-correcting quantum code— The 3D welded surface code is partially self-correcting with a power-law energy barrier [5]. The 3D toric code is a classical self-correcting memory, whose protected bit admits a membrane-like logical operator [32], but it is not a quantum self-correcting memory because the star terms thermalize [33].
  • Floquet 3D surface code— The ISG of the Floquet 3D surface code is that of the 3D surface code.
  • X-cube Floquet code— The ISG of the X-cube Floquet code can be that of the X-cube model code or that of several decoupled surface codes. A rewinding of the original measurement sequence yields a period-six sequence whose ISGs are those of the X-cube model, some 3D surface codes, and some decoupled surface codes [34].
  • \([[8,3,2]]\) Smallest interesting color code— The \([[8,3,2]]\) code can be concatenated with a 3D surface code to yield a \([[O(d^3),3,2d]]\) code family that admits a transversal implementation of the logical \(CCZ\) gate [35].
  • Sierpinski prism model code— The Sierpinski prism model code admits a topological defect network construction out of 3D surface codes on triangular prisms [36,37].
  • Haah cubic code (CC)— The Haah B-code admits a topological defect network construction out of two copies of the 3D surface code [36].
  • X-cube model code— The X-cube model admits a topological defect network construction out of 3D surface codes [36].
  • 3D color code— The 3D color code is equivalent to multiple decoupled copies of the 3D surface code via a local constant-depth Clifford circuit [10,38,39]. This process can be viewed as an ungauging [4049] of certain symmetries. This mapping can also be done via code concatenation [11].
  • Klein-bottle surface code— There is a CZ gate for the 3D toric code on a Klein bottle \(\times S^1\) [20].
  • 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\).
  • Fractal surface code— Fractal surface codes are obtained by removing qubits from the 3D surface code on a cubic lattice.
  • 3D subsystem color code— The 3D subsystem color code can be ungauged [4049] to obtain six copies of \(\mathbb{Z}_2\) gauge theory with one-form symmetries [45].
  • 3D subsystem surface code

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]
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
[5]
K. P. Michnicki, “3D Topological Quantum Memory with a Power-Law Energy Barrier”, Physical Review Letters 113, (2014) arXiv:1406.4227 DOI
[6]
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
[7]
I. H. Kim, “Local non-CSS quantum error correcting code on a three-dimensional lattice”, (2013) arXiv:1012.0859
[8]
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
[9]
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
[10]
A. Kubica, B. Yoshida, and F. Pastawski, “Unfolding the color code”, New Journal of Physics 17, 083026 (2015) arXiv:1503.02065 DOI
[11]
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
[12]
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
[13]
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
[14]
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 LDPC codes via higher symmetries”, (2025) arXiv:2310.16982
[15]
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
[16]
Z. Song and G. Zhu, “Magic Boundaries of 3D Color Codes”, Quantum 9, 1831 (2025) arXiv:2404.05033 DOI
[17]
B. Yoshida, “Gapped boundaries, group cohomology and fault-tolerant logical gates”, Annals of Physics 377, 387 (2017) arXiv:1509.03626 DOI
[18]
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
[19]
N. P. Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn, “Cups and Gates I: Cohomology invariants and logical quantum operations”, (2024) arXiv:2410.16250
[20]
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
[21]
T. R. Scruby and K. Nemoto, “Local Probabilistic Decoding of a Quantum Code”, Quantum 7, 1093 (2023) arXiv:2212.06985 DOI
[22]
C. Piveteau, C. T. Chubb, and J. M. Renes, “Tensor-Network Decoding Beyond 2D”, PRX Quantum 5, (2024) arXiv:2310.10722 DOI
[23]
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
[24]
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
[25]
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
[26]
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
[27]
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
[28]
O. Higgott and N. P. Breuckmann, “Improved Single-Shot Decoding of Higher-Dimensional Hypergraph-Product Codes”, PRX Quantum 4, (2023) arXiv:2206.03122 DOI
[29]
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
[30]
W. Zeng and L. P. Pryadko, “Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates”, Physical Review Letters 122, (2019) arXiv:1810.01519 DOI
[31]
A. Leverrier, S. Apers, and C. Vuillot, “Quantum XYZ Product Codes”, Quantum 6, 766 (2022) arXiv:2011.09746 DOI
[32]
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
[33]
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”, (2025) arXiv:2510.03090
[34]
A. Dua, N. Tantivasadakarn, J. Sullivan, and T. D. Ellison, “Engineering 3D Floquet Codes by Rewinding”, PRX Quantum 5, (2024) arXiv:2307.13668 DOI
[35]
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
[36]
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
[37]
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
[38]
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
[39]
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
[40]
M. Levin and Z.-C. Gu, “Braiding statistics approach to symmetry-protected topological phases”, Physical Review B 86, (2012) arXiv:1202.3120 DOI
[41]
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
[42]
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
[43]
D. J. Williamson, “Fractal symmetries: Ungauging the cubic code”, Physical Review B 94, (2016) arXiv:1603.05182 DOI
[44]
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
[45]
A. Kubica and B. Yoshida, “Ungauging quantum error-correcting codes”, (2018) arXiv:1805.01836
[46]
W. Shirley, K. Slagle, and X. Chen, “Foliated fracton order from gauging subsystem symmetries”, SciPost Physics 6, (2019) arXiv:1806.08679 DOI
[47]
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
[48]
T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes I. Gauging and dualities”, (2023) arXiv:2310.16032
[49]
D. J. Williamson and T. J. Yoder, “Low-overhead fault-tolerant quantum computation by gauging logical operators”, (2024) arXiv:2410.02213
[50]
J. Haah, “A degeneracy bound for homogeneous topological order”, SciPost Physics 10, (2021) arXiv:2009.13551 DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: 3d_surface

Cite as:
“3D surface code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/3d_surface
BibTeX:
@incollection{eczoo_3d_surface, title={3D surface code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/3d_surface} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/3d_surface

Cite as:

“3D surface code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/3d_surface

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/stabilizer/topological/surface/higher_d/3d_surface.yml.