Description
A rotated surface code on one rung of a ladder, with one qubit on the rung, and four qubits surrounding it. This is the smallest code that implements a fault-tolerant logical \(S\) gate using a diagonal depth-one Clifford circuit [1].
A stabilizer tableau for the code is given by [2; ID 18] \begin{align}
Figure I: Stabilizer generators of the \([[5,1,2]]\) rotated surface code. The 5 data qubits (circles) consist of 4 corner qubits and 1 center qubit. Each triangular region corresponds to a weight-three stabilizer generator. Red regions correspond to \(X\) operators while blue regions correspond to \(Z\) operators.
A non-CSS form, local Clifford equivalent to the above via \(X\to Y\to Z\to X\) on qubits 0 and 2 and \(Y\leftrightarrow Z\) on qubits 1 and 4, is [3] \begin{align}
Gates
In the qubit order of the stabilizer tableau above, the physical action \(S_0 S_2 S_3^{\dagger} CZ_{1,4}\) implements the logical gate \(\bar{S}\) [4; Fig. 1].Fault-tolerant implementation of the single-qubit Clifford group [4; Fig. 1].Fault Tolerance
Fault-tolerant implementation of the single-qubit Clifford group [4; Fig. 1].Cousins
- Twist-defect surface code— The \([[5,1,2]]\) rotated surface code can be interpreted as a twist-defect surface code on a sphere, with the missing external \(Y\)-type stabilizer forming the back of the sphere. More generally, any surface code with a single boundary component can be interpreted this way [3].
- \([[7,1,3]]\) Steane code— The \([[5,1,2]]\) rotated surface code is obtained by morphing the Steane code on a region whose child code is a \([[4,2,2]]\) code [4; Fig. 1].
- \([[4,2,2]]\) Four-qubit code— The \([[5,1,2]]\) rotated surface code is obtained by morphing the Steane code on a region whose child code is a \([[4,2,2]]\) code [4; Fig. 1].
- \([[10,2,3]]\) rotated toric code— The \([[10,2,3]]\) rotated toric code is a symplectic double (a.k.a. genus-one double cover) of the \([[5,1,2]]\) rotated surface code [3].
- Recursive 3D self-correcting code— The recursive 3D self-correcting code family is obtained by recursively transforming the \([[5,1,2]]\) rotated surface code, which is its level-zero code [5; Sec. 3.3].
Primary Hierarchy
References
- [1]
V. V. Albert, private communication, 2026
- [2]
Qiskit Community, “Qiskit QEC framework”, URL
- [3]
S. Burton, E. Durso-Sabina, and N. C. Brown, “Genons, Double Covers and Fault-tolerant Clifford Gates”, (2024) arXiv:2406.09951
- [4]
M. Vasmer and A. Kubica, “Morphing Quantum Codes”, PRX Quantum 3, (2022) arXiv:2112.01446 DOI
- [5]
S. Balasubramanian, M. Davydova, and T.-C. Lin, “A passive self-correcting quantum memory in three dimensions”, (2026) arXiv:2605.10943
- [6]
R. J. Harris, E. Coupe, N. A. McMahon, G. K. Brennen, and T. M. Stace, “Decoding holographic codes with an integer optimization decoder”, Physical Review A 102, (2020) arXiv:2008.10206 DOI
Page edit log
- Victor V. Albert (2026-09-24) — most recent
- Victor V. Albert (2026-06-08)
- Victor V. Albert (2024-07-01)
Cite as:
“\([[5,1,2]]\) rotated surface code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/stab_5_1_2, arXiv:2606.11484