3D surface code

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

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 [3]. The welded surface code [4] 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 [5,6] on lattices with certain colorability are equivalent to several copies of the 3D surface code [7].

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 [8]. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.

Transversal Gates

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

Gates

CZ gate for toric code on a Klein bottle [19].Lattice surgery [10].3D and Hybrid 2D-3D surface code computation using lattice surgery and without magic-state distillation [10].Fault-tolerant Hadamard gate using teleportation and error correction [10].

Decoding

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

Fault Tolerance

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

Code Capacity Threshold

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

Threshold

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

Cousins

Chamon model code— The Chamon and 3D surface codes can both be built out of a hypergraph product of three repetition codes; see [28; Sec. 3.4].
Rotated surface code— There exists a rotated version of the 3D surface code, akin to the (2D) rotated surface code [3].
Hamiltonian-based code— Stability of the 3D surface code against Hamiltonian perturbations was determined using a tensor-network representation [8]. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.
Repetition code— The 3D planar (3D toric) code can be obtained from a hypergraph product of three repetition (cyclic) codes [29; Exam. A.1], but done in a different way than the Chamon code; see [28; Sec. 3.4].
Self-correcting quantum code— The 3D welded surface code is partially self-correcting with a power-law energy barrier [4]. The 3D toric code is a classical self-correcting memory, whose protected bit admits a membrane-like logical operator [30], but it is not a quantum self-correcting memory [31].
\([[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 [32].
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 [9,33,34]. This process can be viewed as an ungauging [35–37,37] of certain symmetries. This mapping can also be done via code concatenation [10].
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 surface code

Member of code lists

Primary Hierarchy

Quantum Domain

Qubit Kingdom

Qubit codeQECC Quantum

Union stabilizer (USt) codeQECC Quantum

Qubit stabilizer codeStabilizer Hamiltonian-based Qubit QECC Quantum

Coherent-parity-check (CPC) code

Qubit CSS codeCSS Stabilizer Qubit Hamiltonian-based QECC Quantum

Generalized homological-product qubit CSS codeGeneralized homological-product QLDPC CSS Stabilizer Hamiltonian-based QECC Quantum

Homological code

Parents

Homological code

3D lattice stabilizer codeLattice stabilizer QLDPC Stabilizer Hamiltonian-based QECC Quantum

Abelian topological codeTopological Hamiltonian-based QECC Quantum

The 3D Kitaev surface code realizes 3D \(\mathbb{Z}_2\) gauge theory with bosonic charge and loop excitations (BcBl). The welded surface code does not satisfy homogeneous topological order [38].

XYZ product codeLattice stabilizer Generalized homological-product QLDPC Stabilizer Hamiltonian-based Qubit QECC Quantum

The 3D planar (3D toric) code can be obtained from a hypergraph product of three repetition (cyclic) codes [29; Exam. A.1], but done in a different way than the Chamon code; see [28; Sec. 3.4].