[Jump to code hierarchy]

\([[7,1,3]]\) Steane code [1,2]

Description

A \([[7,1,3]]\) self-dual CSS code that is the smallest qubit CSS code to correct a single-qubit error [3]. The code is constructed using the classical binary \([7,4,3]\) Hamming code for protecting against both \(X\) and \(Z\) errors.

A stabilizer tableau for the code is given by [4; ID 226] \begin{align} \begin{array}{ccccccc} I & I & I & X & X & X & X \\ I & X & X & I & I & X & X \\ X & I & X & I & X & I & X \\ I & I & I & Z & Z & Z & Z \\ I & Z & Z & I & I & Z & Z \\ Z & I & Z & I & Z & I & Z \end{array}~.\tag*{$(1)$} \end{align}The code’s stabilizer generator matrix blocks \(H_{X}\) and \(H_{Z}\) are both the parity-check matrix of the \([7,4,3]\) Hamming code. The checks can be thought of as lying on the three trapezoids of the following tiling of the triangle.

Figure I: Stabilizer generators of the Steane code.

The Steane code can also be thought of as a code on all corners of a cube except one [5,6], and the code’s encoder-respecting form is the graph of the full cube [7].

A set of logical codewords is \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{\sqrt{8}}\Big(|0000000\rangle+|1010101\rangle+|0110011\rangle+|1100110\rangle\\&\,\,\,\,\,\,\,\,+|0001111\rangle+|1011010\rangle+|0111100\rangle+|1101001\rangle\Big)\\|\overline{1}\rangle&=\frac{1}{\sqrt{8}}\Big(|1111111\rangle+|0101010\rangle+|1001100\rangle+|0011001\rangle\\&\,\,\,\,\,\,\,\,+|1110000\rangle+|0100101\rangle+|1000011\rangle+|0010110\rangle\Big)~. \end{split}\tag*{$(2)$} \end{align}

The automorphism group of the code is \(PGL(3,2)\) [8]. It is one of sixteen distinct indecomposable \([[7,1,3]]\) codes [9].

Protection

The Steane code is a distance 3 code. It detects errors on 2 qubits, corrects errors on 1 qubit.

Encoding

Nine CNOT and four Hadamard gates [10; Fig. 10.14].Evolution under stabilizer Hamiltonian [11].Fault-tolerant logical zero and logical plus state preparation on all-to-all and 2D grid qubit connectivity [12].Parity-check encoding with flag-bridge qubits on a square lattice connectivity [13].

Transversal and Permutation-Based Gates

The single-qubit Clifford group [14,15]. More generally, \(k\) copies of the Steane code form a \([[7k,k,3]]\) code that admits a \(k\)-fold transversal implementation of the full Clifford group on all \(k\) logical qubits, showing the tightness of a no-go theorem that requires at least \(k\)-fold transversal gadgets for the full Clifford group [16].

Gates

Fault-tolerant approximations of arbitrary single-qubit gates [17,18].Non-fault-tolerant \(T\) gate [19].Fault-tolerant logical zero and magic state preparation [20]. Magic-state preparation converts unbiased noise into biased noise [21].Because transversal Hadamard acts logically on the code, the Steane code serves as a normal self-dual inner code for magic-state distillation. One routine uses 14 noisy \(T\) gates and one noisy input magic state to produce one output with cubic error suppression, and it can be pipelined with the \([[17,1,5]]\) code to obtain fifth-order suppression [22; Sec. I.A].Pieceable fault-tolerant \(CCZ\) gate [23].

Decoding

Shor error correction fidelity calculation [24–26].A \([15,3]\) syndrome-measurement code yields a QDS extension that uses the same 15 measurements as five-fold repetition of the three syndrome bits while achieving lower syndrome-decoding error [27; Fig. 1].Fault-tolerant measurement-free error-correction cycle [28].

Fault Tolerance

A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[15,1,3]]\) code [29–33].A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[10,1,2]]\) code [34].A fault-tolerant logical \(T\) gate can be obtained by encoding the Steane code’s seven physical qubits into the seven logical qubits of a \([[63,7,3]]\) outer coset-divisible code preserved by transversal \(T^\dagger\) [35; Sec. V].Fault-tolerant logical zero and magic state preparation [20]. Magic-state preparation converts unbiased noise into biased noise [21].Fault-tolerant logical zero and logical plus state preparation on all-to-all and 2D grid qubit connectivity [12].Pieceable fault-tolerant \(CCZ\) gate [23].Syndrome measurement can be done with ancillary flag qubits [36] or with no extra qubits [37]. The depth of syndrome extraction circuits can be lowered by using past syndrome values [38]. An adaptive protocol measures the syndrome with a 14-CNOT fault-tolerant circuit and falls back to an 11-CNOT recovery circuit when a flag is raised [39].Computation of ground-state energy of the hydrogen molecule [40].Fault-tolerant measurement-free error-correction cycle [28].

Realizations

Trapped-ion devices: seven-qubit device in Blatt group [41]. Ten-qubit QCCD device by Quantinuum [42] realizing repeated syndrome extraction, real-time look-up-table decoding (yielding lower logical SPAM error rate than physical SPAM), and non-fault-tolerant magic-state distillation (see APS Physics Synopsis [43]). Fault-tolerant universal two-qubit gate set using T injection by Monz group [44]. Logical CNOT gate and Bell-pair creation between two logical qubits (yielding a logical fidelity higher than physical), including rounds of correction and fault-tolerant primitives such as flag qubits and pieceable fault tolerance, on a 20-qubit device by Quantinuum [45]; logical fidelity interval of the combined preparation-CNOT-measurement procedure was higher than that of the unencoded physical qubits. Multiple rounds of Steane error correction [46]. Fault-tolerant universal gate set via code switching between the Steane code and the \([[10,1,2]]\) code [34]. Post-selected fault-tolerant logical Bell-state preparation with logical error rates at least 10 times lower than physical rate on a device by Quantinuum [47]. The quantum Fourier transform on three code blocks [48]. Fault-tolerant transversal and lattice-surgery state teleportation protocols as well as Knill error correction [49]. Rains shadow enumerators have been measured [50]. Inter-block CNOT gates have been characterized via cycle reconstruction [51]. 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 [52]. End-to-end fault-tolerant execution of QAOA and HHL circuits, including logical non-Clifford operations, with up to 12 logical qubits on Quantinuum systems [53]. Neutral atom arrays: Lukin group. Ten logical qubits, transversal CNOT gate performed, logical ten-qubit GHZ state initialized with break-even fidelity, and fault-tolerant logical two-qubit GHZ state initialized [54]. Deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations [55].

Notes

Pedagogical explanation of QEC using the Steane code [56].The Steane code can be used for entanglement purification [57].

Cousins

  • Group-representation code— The Steane code is a group-representation code with \(G\) being the \(2O\) subgroup of \(SU(2)\) [58].
  • Cluster-state code— The Steane code is equivalent via a single-qubit Clifford unitary to a cluster-state code for a particular graph and classical code [59; Exam. 4]. Four non-isomorphic graphs yield graph quantum codes that are equivalent to the Steane code under a single-qubit-Clifford circuit [60].
  • EA qubit stabilizer code— The Steane code is globally equivalent to a \([[6,1,3;1]]\) EA CSS code, which the paper identifies as an example of the smallest one-ebit EA CSS code correcting an arbitrary single-qubit error on the sender’s qubits [3].
  • \([[6,2,2]]\) \(C_6\) code— In Knill’s \(C_4/C_6\) architecture, noisy \(\ket{\pi/8}\) states are injected using \(C_4/C_6\) logical Bell pairs and then purified by encoding them into the Steane code; Knill also proposed using the Steane code as a final concatenation level for the \(C_4/C_6\) scheme [61].
  • \([7,4,3]\) Hamming code— The Steane code is constructed from the \([7,4,3]\) classical Hamming code via the CSS construction.
  • Dual-rail quantum code— The KLM protocol, one of the first protocols for fault-tolerant quantum computation, utilizes concatenations of the dual-rail code with a stabilizer code such as the Steane code [62–64].
  • Concatenated cat code— Two-component cat codes concatenated with Steane and Golay codes are estimated to be fault tolerant against photon loss noise with rate \(\eta < 5\times 10^{-4}\) provided that \(\alpha > 1.2\) [65].
  • Tensor-network code— The Steane code can be built from two \([[4,2,2]]\) codes in the quantum Lego code framework [66].
  • Majorana stabilizer code— Applying the CSS-to-Majorana map of [67; Lemma 2] to the \([[7,1,3]]\) Steane code yields a seven-Majorana code encoding half a qubit; pairing two such odd-length copies gives a physical Majorana stabilizer code with odd logical operators [67; Sec. 8].
  • Khesin-Lu-Shor code— The encoder-respecting form of both the Steane and Khesin-Lu-Shor codes is the graph of a hypercube [7].
  • \([[10,1,2]]\) Vasmer-Kubica code— A fault-tolerant universal gate set can be obtained via code switching between the Steane code and the \([[10,1,2]]\) code [34].
  • \([[14,3,3]]\) CE phantom code— Dual-rail concatenation of the \([[7,1,3]]\) Steane code yields a \([[14,1,3]]\) CE CSS code whose \(X\)-type stabilizer generators coincide with those of the locally Clifford-equivalent \([[14,3,3]]\) CE CSS frame of this code [68]. The latter frame replaces the three weight-four \(Z\)-type generators of the former by the dual-rail image of the Steane logical \(Z\) operator.
  • \([[15,1,3]]\) quantum RM 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 [29]. A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[15,1,3]]\) code [30–33,69]. 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 [70,71].
  • \([[4,2,2]]\) Four-qubit code— The Steane code can be built from two \([[4,2,2]]\) codes in the quantum Lego code framework [66]. Ref. [72] also introduces a \(C_4\)/Steane concatenated code, obtained by concatenating the \([[4,2,2]]\) code with the Steane code, as an underlying code for further concatenation with quantum Hamming codes.
  • \([[5,1,2]]\) rotated surface 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 [73; Fig. 1].
  • \(((7,2,3))\) Pollatsek-Ruskai code— The Pollatsek-Ruskai code can be continuously deformed to the Steane code [74].
  • Raussendorf-Bravyi-Harrington (RBH) cluster-state code— Concatenation of the RBH code with small codes such as the \([[2,1]]\) repetition code, \([[4,1,1,2]]\) subsystem code, or Steane code can improve thresholds [75].
  • Tetron subsystem code— The \([[14,1,4,3]]\) tetron subsystem code is obtained from the Steane code together with the \([7,4,3]\) Hamming code [76; Sec. 3.7].

Primary Hierarchy

Parents
Steane code is a 2D color code defined on a seven-qubit patch of the 6.6.6 tiling.
The Steane code is equivalent to a cyclic code via qubit permutations [59; Exam. 1].
There exists a set of stabilizer generators for the Steane code that make it a QDS code; a \([15,3]\) syndrome-measurement code beats five-fold repeated syndrome extraction at the same measurement cost [27,78].
The Steane code is the \(m=1\) member of the \([[2^{2m}+2^{m}+1,1,>2^{m}]]\) PG-QLDPC code family that is constructed from codes corresponding to lines and affine charts in \(PG(2,2^m)\) via the CSS construction [79; Def. 4.9].
The concatenated Steane code at level \(m=1\) is the Steane code.
The Steane code is the smallest heptagon holographic code. The encoding of more general heptagon holographic codes is a holographic tensor network consisting of the encoding isometry for the Steane code, which is a planar-perfect tensor.
\([[7,1,3]]\) Steane code

References

  1. [1]

    A. M. Steane, “Error Correcting Codes in Quantum Theory”, Physical Review Letters 77, 793 (1996) DOI

  2. [2]

    “Multiple-particle interference and quantum error correction”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452, 2551 (1996) arXiv:quant-ph/9601029 DOI

  3. [3]

    B. Shaw, M. M. Wilde, O. Oreshkov, I. Kremsky, and D. A. Lidar, “Encoding one logical qubit into six physical qubits”, Physical Review A 78, (2008) arXiv:0803.1495 DOI

  4. [4]

    Qiskit Community, “Qiskit QEC framework”, 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]

    R. Duncan and M. Lucas, “Verifying the Steane code with Quantomatic”, Electronic Proceedings in Theoretical Computer Science 171, 33 (2014) arXiv:1306.4532 DOI

  7. [7]

    A. B. Khesin, J. Z. Lu, and P. W. Shor, “Universal Graph Representation of Stabilizer Codes”, PRX Quantum 6, (2025) arXiv:2411.14448 DOI

  8. [8]

    H. Hao, “Investigations on Automorphism Groups of Quantum Stabilizer Codes”, (2021) arXiv:2109.12735

  9. [9]

    S. Yu, Q. Chen, and C. H. Oh, “Graphical Quantum Error-Correcting Codes”, (2007) arXiv:0709.1780

  10. [10]

    M. Nakahara, “Quantum Computing”, (2008) DOI

  11. [11]

    T. Tanamoto, V. M. Stojanović, C. Bruder, and D. Becker, “Strategy for implementing stabilizer-based codes on solid-state qubits”, Physical Review A 87, (2013) arXiv:1301.4796 DOI

  12. [12]

    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

  13. [13]

    A. Rodriguez-Blanco, H. N. Nguyen, and K. B. Whaley, “Fault-tolerant correction-ready encoding of the [[7,1,3]] Steane code on a 2D grid”, (2025) arXiv:2504.01083

  14. [14]

    P. W. Shor, “Fault-tolerant quantum computation”, (1997) arXiv:quant-ph/9605011

  15. [15]

    B. Zeng, A. Cross, and I. L. Chuang, “Transversality versus Universality for Additive Quantum Codes”, (2007) arXiv:0706.1382

  16. [16]

    A. Chakraborty and D. Gottesman, “No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits”, PRX Quantum 7, (2026) arXiv:2602.13395 DOI

  17. [17]

    A. G. Fowler, “Constructing arbitrary Steane code single logical qubit fault-tolerant gates”, (2010) arXiv:quant-ph/0411206

  18. [18]

    A. G. Fowler, “Towards Large-Scale Quantum Computation”, (2005) arXiv:quant-ph/0506126

  19. [19]

    Y. S. Weinstein, “Non-fault-tolerantTgates for the [7,1,3] quantum error-correction code”, Physical Review A 87, (2013) arXiv:1303.4291 DOI

  20. [20]

    H. Goto, “Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code”, Scientific Reports 6, (2016) DOI

  21. [21]

    N. Fazio, R. Harper, and S. D. Bartlett, “Logical Noise Bias in Magic State Injection”, Quantum 9, 1779 (2025) arXiv:2401.10982 DOI

  22. [22]

    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

  23. [23]

    T. J. Yoder, R. Takagi, and I. L. Chuang, “Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes”, Physical Review X 6, (2016) arXiv:1603.03948 DOI

  24. [24]

    Y. S. Weinstein, “Fidelity of an encoded [7,1,3] logical zero”, Physical Review A 84, (2011) arXiv:1101.1950 DOI

  25. [25]

    S. D. Buchbinder, C. L. Huang, and Y. S. Weinstein, “Encoding an Arbitrary State in a [7,1,3] Quantum Error Correction Code”, (2011) arXiv:1109.1714

  26. [26]

    Y. S. Weinstein and S. D. Buchbinder, “Use of Shor states for the [7,1,3] quantum error-correcting code”, Physical Review A 86, (2012) arXiv:1111.3930 DOI

  27. [27]

    A. Ashikhmin, C.-Y. Lai, and T. A. Brun, “Quantum Data-Syndrome Codes”, IEEE Journal on Selected Areas in Communications 38, 449 (2020) arXiv:1907.01393 DOI

  28. [28]

    S. Heußen, D. F. Locher, and M. Müller, “Measurement-Free Fault-Tolerant Quantum Error Correction in Near-Term Devices”, PRX Quantum 5, (2024) arXiv:2307.13296 DOI

  29. [29]

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

  30. [30]

    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

  31. [31]

    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

  32. [32]

    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

  33. [33]

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

  34. [34]

    I. Pogorelov, F. Butt, L. Postler, C. D. Marciniak, P. Schindler, M. Müller, and T. Monz, “Experimental fault-tolerant code switching”, (2024) arXiv:2403.13732

  35. [35]

    J. Hu, Q. Liang, and R. Calderbank, “Divisible Codes for Quantum Computation”, (2022) arXiv:2204.13176

  36. [36]

    R. Chao and B. W. Reichardt, “Quantum Error Correction with Only Two Extra Qubits”, Physical Review Letters 121, (2018) arXiv:1705.02329 DOI

  37. [37]

    B. W. Reichardt, “Fault-tolerant quantum error correction for Steane’s seven-qubit color code with few or no extra qubits”, Quantum Science and Technology 6, 015007 (2020) arXiv:1804.06995 DOI

  38. [38]

    D. Bhatnagar, M. Steinberg, D. Elkouss, C. G. Almudever, and S. Feld, “Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes”, 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 63 (2023) arXiv:2305.00784 DOI

  39. [39]

    B. Poór, B. Rodatz, and A. Kissinger, “Ultra low overhead syndrome extraction for the Steane code”, Quantum Science and Technology 11, 045009 (2026) arXiv:2511.13700 DOI

  40. [40]

    Anonymous, “Quantum error-corrected computation of molecular energies”, PRX Quantum (2026) arXiv:2505.09133 DOI

  41. [41]

    D. Nigg, M. Müller, E. A. Martinez, P. Schindler, M. Hennrich, T. Monz, M. A. Martin-Delgado, and R. Blatt, “Quantum computations on a topologically encoded qubit”, Science 345, 302 (2014) arXiv:1403.5426 DOI

  42. [42]

    C. Ryan-Anderson et al., “Realization of real-time fault-tolerant quantum error correction”, (2021) arXiv:2107.07505

  43. [43]

    P. Ball, “Real-Time Error Correction for Quantum Computing”, Physics 14, (2021) DOI

  44. [44]

    L. Postler et al., “Demonstration of fault-tolerant universal quantum gate operations”, Nature 605, 675 (2022) arXiv:2111.12654 DOI

  45. [45]

    C. Ryan-Anderson et al., “Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code”, (2022) arXiv:2208.01863

  46. [46]

    L. Postler, F. Butt, I. Pogorelov, C. D. Marciniak, S. Heußen, R. Blatt, P. Schindler, M. Rispler, M. Müller, and T. Monz, “Demonstration of Fault-Tolerant Steane Quantum Error Correction”, PRX Quantum 5, (2024) arXiv:2312.09745 DOI

  47. [47]

    A. Paetznick et al., “Demonstration of logical qubits and repeated error correction with better-than-physical error rates”, (2024) arXiv:2404.02280

  48. [48]

    K. Mayer et al., “Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer”, (2024) arXiv:2404.08616

  49. [49]

    C. Ryan-Anderson et al., “High-fidelity and Fault-tolerant Teleportation of a Logical Qubit using Transversal Gates and Lattice Surgery on a Trapped-ion Quantum Computer”, (2024) arXiv:2404.16728

  50. [50]

    D. Miller et al., “Experimental measurement and a physical interpretation of quantum shadow enumerators”, Physical Review Research 8, (2026) arXiv:2408.16914 DOI

  51. [51]

    W. Huang et al., “Logical multi-qubit entanglement with dual-rail superconducting qubits”, Nature Physics (2026) arXiv:2504.12099 DOI

  52. [52]

    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

  53. [53]

    M. A. Perlin et al., “Fault-tolerant execution of error-corrected quantum algorithms”, (2026) arXiv:2603.04584

  54. [54]

    D. Bluvstein et al., “Logical quantum processor based on reconfigurable atom arrays”, Nature 626, 58 (2023) arXiv:2312.03982 DOI

  55. [55]

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

  56. [56]

    J. Preskill, “Reliable quantum computers”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454, 385 (1998) arXiv:quant-ph/9705031 DOI

  57. [57]

    K. Fujii and K. Yamamoto, “Entanglement purification with double selection”, Physical Review A 80, (2009) arXiv:0811.2639 DOI

  58. [58]

    A. Denys and A. Leverrier, “Quantum Error-Correcting Codes with a Covariant Encoding”, Physical Review Letters 133, (2024) arXiv:2306.11621 DOI

  59. [59]

    A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design of additive quantum codes via the code-word-stabilized framework”, Physical Review A 84, (2011) arXiv:1108.5490 DOI

  60. [60]

    M. Grassl, A. Klappenecker, and M. Rotteler, “Graphs, quadratic forms, and quantum codes”, Proceedings IEEE International Symposium on Information Theory, 45 arXiv:quant-ph/0703112 DOI

  61. [61]

    E. Knill, “Quantum computing with realistically noisy devices”, Nature 434, 39 (2005) arXiv:quant-ph/0410199 DOI

  62. [62]

    E. Knill, R. Laflamme, and G. J. Milburn, “A scheme for efficient quantum computation with linear optics”, Nature 409, 46 (2001) DOI

  63. [63]

    M. Silva, “Erasure Thresholds for Efficient Linear Optics Quantum Computation”, (2004) arXiv:quant-ph/0405112

  64. [64]

    M. Silva, M. Rötteler, and C. Zalka, “Thresholds for linear optics quantum computing with photon loss at the detectors”, Physical Review A 72, (2005) arXiv:quant-ph/0502101 DOI

  65. [65]

    A. P. Lund, T. C. Ralph, and H. L. Haselgrove, “Fault-Tolerant Linear Optical Quantum Computing with Small-Amplitude Coherent States”, Physical Review Letters 100, (2008) arXiv:0707.0327 DOI

  66. [66]

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

  67. [67]

    S. Bravyi, B. M. Terhal, and B. Leemhuis, “Majorana fermion codes”, New Journal of Physics 12, 083039 (2010) arXiv:1004.3791 DOI

  68. [68]

    C.-Y. Lai, P.-H. Liou, and Y. Ouyang, “Fault-Tolerant Quantum Error Correction for Constant-Excitation Stabilizer Codes under Coherent Noise”, (2025) arXiv:2507.10395

  69. [69]

    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

  70. [70]

    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

  71. [71]

    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

  72. [72]

    S. Yoshida, S. Tamiya, and H. Yamasaki, “Concatenate codes, save qubits”, npj Quantum Information 11, (2025) arXiv:2402.09606 DOI

  73. [73]

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

  74. [74]

    M. Du, C. Zhang, Y.-T. Poon, and B. Zeng, “Characterizing Quantum Codes via the Coefficients in Knill-Laflamme Conditions”, (2024) arXiv:2410.07983

  75. [75]

    Z. Li, I. Kim, and P. Hayden, “Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction”, Quantum 7, 1089 (2023) arXiv:2209.09390 DOI

  76. [76]

    S. Kundu and B. Reichardt, “Majorana subsystem qubit codes that also correct odd-weight errors”, New Journal of Physics 26, 073029 (2024) DOI

  77. [77]

    C.-Y. Lai and C.-C. Lu, “A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices”, IEEE Transactions on Information Theory 57, 7163 (2011) arXiv:0712.0103 DOI

  78. [78]

    Y. Fujiwara, “Ability of stabilizer quantum error correction to protect itself from its own imperfection”, Physical Review A 90, (2014) arXiv:1409.2559 DOI

  79. [79]

    B. Audoux and A. Couvreur, “On tensor products of CSS Codes”, (2018) arXiv:1512.07081

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: steane

Cite as:
“\([[7,1,3]]\) Steane code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/steane, arXiv:2606.11484
BibTeX:
@incollection{eczoo_steane,
title={\([[7,1,3]]\) Steane 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/steane}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/steane

Cite as:

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

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