[Jump to code hierarchy]

\([[15,1,3]]\) quantum RM code [1–3]

Alternative Names: Tetrahedral code.

Description

A \([[15,1,3]]\) quantum Reed-Muller code that is most easily thought of as a tetrahedral 3D color code. It can be constructed as a CSS code from the \([15,5,7]\) punctured Reed-Muller code and its even subcode, which explains its transversal \(T^\dagger\) gate [4].

This code contains 15 qubits, represented by four vertices, four face centers, six edge centers, and one body center. The tetrahedron is cellulated into four identical polyhedron cells by connecting the body center to all four face centers, where each face center is then connected to three adjacent edge centers. Each colored cell corresponds to a weight-eight \(X\)-check, and each face corresponds to a weight-4 \(Z\)-check. A logical \(Z\) is any weight-3 \(Z\)-string along an edge of the entire tetrahedron. The logical \(X\) is any weight-7 \(X\)-face of the entire tetrahedron.

The code can also be thought of as a code on all corners of a tesseract except one [5].

In the qubit order given by the nonzero binary four-tuples \(0001,0010,\ldots,1111\), one stabilizer tableau for the code is [6; ID 6705228b19cca60cf657a8f6] \begin{align} \begin{smallmatrix} Z & Z & I & Z & I & I & Z & I & I & I & I & I & I & I & I \\ Z & Z & I & I & Z & Z & I & I & I & I & I & I & I & I & I \\ Z & Z & I & I & I & I & I & Z & I & I & Z & I & I & I & I \\ Z & Z & I & I & I & I & I & I & Z & Z & I & I & I & I & I \\ Z & Z & I & I & I & I & I & I & I & I & I & Z & I & I & Z \\ Z & Z & I & I & I & I & I & I & I & I & I & I & Z & Z & I \\ Z & I & Z & Z & I & Z & I & I & I & I & I & I & I & I & I \\ Z & I & Z & I & I & I & I & Z & I & Z & I & I & I & I & I \\ Z & I & Z & I & I & I & I & I & I & I & I & Z & I & Z & I \\ Z & I & I & Z & I & I & I & Z & I & I & I & I & Z & I & I \\ I & I & I & I & I & I & I & X & X & X & X & X & X & X & X \\ I & I & I & X & X & X & X & I & I & I & I & X & X & X & X \\ I & X & X & I & I & X & X & I & I & X & X & I & I & X & X \\ X & I & X & I & X & I & X & I & X & I & X & I & X & I & X \end{smallmatrix}~.\tag*{$(1)$} \end{align}The logical \(\ket{\overline{0}}\) and \(\ket{\overline{1}}\) states are superpositions of computational-basis words of weight \(0 \bmod 8\) and \(7 \bmod 8\).

Magic

Magic-state yield parameter \( \gamma= \log_d (n/k)\approx 2.47\) [8][7; Box 2].

Encoding

Fault-tolerant logical zero and logical plus state preparation using reinforcement learning [9].

Transversal and Permutation-Based Gates

A transversal logical \(T\) is implemented by applying a \(T^\dagger\) gate on every qubit [1,7,10]. This is the smallest qubit stabilizer code with distance at least three and a (strongly) transversal gate outside of the Clifford group [11].Transversal logical \(CS\) gates between code blocks, together with transversal \(T\) and CNOT, can be used to realize IQP-like sampling architectures on a hypercube connectivity graph [12].

Gates

The code is often used in magic-state distillation protocols because of its transversal \(T\) gate [3]. In the original 15-to-1 protocol, 15 noisy \(R_{\pi/8}\ket{+}\) magic states are used to implement the transversal \(T\) by compressed gate teleportation. The resulting encoded state is post-selected by 15-qubit error detection, and decoding yields an output magic state with error probability \(O(p^3)\) when the input states have independent error probability \(p\) [4; Sec. 13.5.1, Protocol 13.2].With mid-circuit measurement and reuse of check qubits, the 15-to-1 protocol runs on four active qubits [13; Sec. VI].Non-transversal logical Hadamard [14].

Decoding

Decoding has been studied for the BP, BP+OSD, and AutDEC decoders [15].An exact ML decoder based on the Walsh-Hadamard transform was developed for error correction and gauge fixing in the alternating Steane/\([[15,1,3]]\) Clifford + \(T\) protocol [16].

Fault Tolerance

A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[15,1,3]]\) code [10,16–19].Fault-tolerant logical zero and logical plus state preparation using reinforcement learning [9].

Realizations

Trapped ions: code switching between the Steane code and the \([[15,1,3]]\) code as well as magic-state preparation and logical Bell measurements on the Steane code realized on the 28-qubit H2-1 device by Quantinuum [20].MBQC with the \([[15,1,3]]\) code has been demonstrated in neutral atom arrays by the Lukin group [21].

Cousins

  • Doubled color code— The \([[15,1,3]]\) code can be viewed as a (gauge-fixed) doubled color code obtained from the Steane code via the doubling transformation [16].
  • \([[7,1,3]]\) Steane code— The \([[15,1,3]]\) code can be viewed as a (gauge-fixed) doubled color code obtained from the Steane code via the doubling transformation [16]. A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[15,1,3]]\) code [10,17–19,22]. An \([[105,1,9]]\) alternative concatenation of the \([[15,1,3]]\) and Steane codes allows for a universal gate set consisting of gates that are close to transversal [23,24].
  • Concatenated Steane code— The \([[105,1]]\) concatenation of the \([[15,1,3]]\) and Steane codes allows for a universal gate set consisting of gates that are transversal w.r.t. two different partitions [23,24].
  • Concatenated qubit code— The concatenated \([[15,1,3]]\) code has a measurement threshold less than one under uniformly random Pauli measurements [25].
  • Tensor-network code— The \([[15,1,3]]\) code serves as the local tensor in a holographic quantum-Lego code on a \(\{15,4\}\) tiling that supports a transversal non-Clifford operator [26].
  • Holographic tensor-network code— The \([[15,1,3]]\) code serves as the local tensor in a holographic quantum-Lego code on a \(\{15,4\}\) tiling that supports a transversal non-Clifford operator [26].
  • Cluster-state code— MBQC with the \([[15,1,3]]\) code has been demonstrated in neutral atom arrays by the Lukin group [21].
  • \([[10,1,2]]\) Vasmer-Kubica code— The \([[10,1,2]]\) code is obtained by morphing the \([[15,1,3]]\) code on a region whose child code is the \([[8,3,2]]\) smallest interesting color code [27].
  • \([[15, 7, 3]]\) quantum Hamming code— Gauging out six of the seven logical qubits of the \([[15,7,3]]\) code yields the \([[15,1,3]]\) code [28].
  • \([[8,1,2]]\) Shen-Wang-Cao code— The \([[8,1,2]]\) code is an XP-regular code that can be obtained via the XP stabilizer formalism applied to the \([[15,1,3]]\) Reed-Muller code [29].
  • \([[8,3,2]]\) Smallest interesting color code— The \([[8,3,2]]\) code can be obtained from a subset of physical qubits of the \([[15,1,3]]\) code [27].
  • \([[4,1,2]]_5\) ququint RM code— The \([[15,1,3]]\) quantum RM code is the smallest qubit stabilizer code with distance at least three and a strongly transversal non-Clifford gate [11]. Both codes belong to a family of CSS codes on \(p^m-1\) qudits of prime dimension \(p\) whose \(X\)-type stabilizers form shortened first-order GRM codes [30].

References

  1. [1]

    E. Knill, R. Laflamme, and W. Zurek, “Threshold Accuracy for Quantum Computation”, (1996) arXiv:quant-ph/9610011

  2. [2]

    A. Steane, “Quantum Reed-Muller Codes”, (1996) arXiv:quant-ph/9608026

  3. [3]

    S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas”, Physical Review A 71, (2005) arXiv:quant-ph/0403025 DOI

  4. [4]

    D. Gottesman, Surviving as a Quantum Computer in a Classical World (2024) URL

  5. [5]

    R. Raussendorf, “Key ideas in quantum error correction”, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, 4541 (2012) DOI

  6. [6]

    S. Burton, “qecdb.org: Quantum Error Correction Database”, URL

  7. [7]

    E. T. Campbell, B. M. Terhal, and C. Vuillot, “Roads towards fault-tolerant universal quantum computation”, Nature 549, 172 (2017) arXiv:1612.07330 DOI

  8. [8]

    J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, “Magic state distillation with low space overhead and optimal asymptotic input count”, Quantum 1, 31 (2017) arXiv:1703.07847 DOI

  9. [9]

    R. Zen, J. Olle, L. Colmenarez, M. Puviani, M. Müller, and F. Marquardt, “Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning”, Physical Review X 15, (2025) arXiv:2402.17761 DOI

  10. [10]

    J. T. Anderson, G. Duclos-Cianci, and D. Poulin, “Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes”, Physical Review Letters 113, (2014) arXiv:1403.2734 DOI

  11. [11]

    S. Koutsioumpas, D. Banfield, and A. Kay, “The Smallest Code with Transversal T”, (2022) arXiv:2210.14066

  12. [12]

    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

  13. [13]

    H. Jacinto, X. Valcarce, V. Barizien, É. Gouzien, and N. Sangouard, “Exploring the landscape of compact magic-state distillation factories”, (2026) arXiv:2606.07734

  14. [14]

    B. Anker and M. Marvian, “Universal Fault Tolerance with Non-Transversal Clifford Gates”, (2025) arXiv:2510.08402

  15. [15]

    S. Koutsioumpas, H. Sayginel, M. Webster, and Dan E Browne, “Automorphism Ensemble Decoding of Quantum LDPC Codes”, (2025) arXiv:2503.01738

  16. [16]

    S. Bravyi and A. Cross, “Doubled Color Codes”, (2015) arXiv:1509.03239

  17. [17]

    A. Paetznick and B. W. Reichardt, “Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction”, Physical Review Letters 111, (2013) arXiv:1304.3709 DOI

  18. [18]

    D.-X. Quan, L.-L. Zhu, C.-X. Pei, and B. C. Sanders, “Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing”, Journal of Physics A: Mathematical and Theoretical 51, 115305 (2018) arXiv:1703.03860 DOI

  19. [19]

    D. Banfield, H. Leitch, and A. Kay, “Implementing Clifford Gates on Stabilizer Codes via Measurement”, (2025) arXiv:2210.14074

  20. [20]

    L. Daguerre, R. Blume-Kohout, N. C. Brown, D. Hayes, and I. H. Kim, “Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching”, Physical Review X 15, (2025) arXiv:2506.14169 DOI

  21. [21]

    D. Bluvstein et al., “A fault-tolerant neutral-atom architecture for universal quantum computation”, Nature 649, 39 (2025) arXiv:2506.20661 DOI

  22. [22]

    F. Butt, S. Heußen, M. Rispler, and M. Müller, “Fault-Tolerant Code-Switching Protocols for Near-Term Quantum Processors”, PRX Quantum 5, (2024) arXiv:2306.17686 DOI

  23. [23]

    T. Jochym-O’Connor and R. Laflamme, “Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates”, Physical Review Letters 112, (2014) arXiv:1309.3310 DOI

  24. [24]

    T. Jochym-O’Connor, A. Kubica, and T. J. Yoder, “Disjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates”, Physical Review X 8, (2018) arXiv:1710.07256 DOI

  25. [25]

    D. Lee and B. Yoshida, “Randomly Monitored Quantum Codes”, (2024) arXiv:2402.00145

  26. [26]

    C. Cao and B. Lackey, “Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks”, PRX Quantum 3, (2022) arXiv:2109.08158 DOI

  27. [27]

    M. Vasmer and A. Kubica, “Morphing Quantum Codes”, PRX Quantum 3, (2022) arXiv:2112.01446 DOI

  28. [28]

    A. Kubica and M. E. Beverland, “Universal transversal gates with color codes: A simplified approach”, Physical Review A 91, (2015) arXiv:1410.0069 DOI

  29. [29]

    R. Shen, Y. Wang, and C. Cao, “Quantum Lego and XP Stabilizer Codes”, Quantum 9, 1876 (2025) arXiv:2310.19538 DOI

  30. [30]

    E. T. Campbell, H. Anwar, and D. E. Browne, “Magic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes”, Physical Review X 2, (2012) arXiv:1205.3104 DOI

  31. [31]

    M. A. Webster, B. J. Brown, and S. D. Bartlett, “The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases”, Quantum 6, 815 (2022) arXiv:2203.00103 DOI

  32. [32]

    S. Nezami and J. Haah, “Classification of small triorthogonal codes”, Physical Review A 106, (2022) arXiv:2107.09684 DOI

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: stab_15_1_3

Cite as:
“\([[15,1,3]]\) quantum RM code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/stab_15_1_3, arXiv:2606.11484
BibTeX:
@incollection{eczoo_stab_15_1_3,
title={\([[15,1,3]]\) quantum RM code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/stab_15_1_3}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/stab_15_1_3

Cite as:

“\([[15,1,3]]\) quantum RM code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/stab_15_1_3, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/small_distance/small/15/stab_15_1_3.yml.