[Jump to code hierarchy]

Quantum repetition code [1]

Description

Encodes \(1\) qubit into \(n\) qubits according to \(|0\rangle\to|\phi_0\rangle^{\otimes n}\) and \(|1\rangle\to|\phi_1\rangle^{\otimes n}\). The code is called a bit-flip code when \(|\phi_i\rangle = |i\rangle\), and a phase-flip code when \(|\phi_0\rangle = |+\rangle\) and \(|\phi_1\rangle = |-\rangle\). This repetition-style encoding does not clone an arbitrary quantum state; instead, it extends the copying of computational-basis states linearly to entangled codewords [2; Ch. 2].

The \(\pm\)-basis codewords for the bit-flip code are GHZ states [3–5] (a.k.a. qubit cat states) \(\left(|0\rangle^{\otimes n}\pm|1\rangle^{\otimes n}\right)/\sqrt{2}\). These are ground states of the 1D classical Ising model Hamiltonian \(H=-\sum_{i} Z_{i}Z_{i+1}\).

The \(\pm\)-basis codewords for the phase-flip code are expanded in the computational basis as \begin{align} \begin{split} |\overline{+}\rangle =\frac{1}{\sqrt{2^{n-1}}}\sum_{\sum_{i}v_{i}=0\pmod{2}}|v_{1},\cdots,v_{n}\rangle~{\phantom{,}}\\ |\overline{-}\rangle =\frac{1}{\sqrt{2^{n-1}}}\sum_{\sum_{i}v_{i}=1\pmod{2}}|v_{1},\cdots,v_{n}\rangle~, \end{split}\tag*{$(1)$} \end{align}showing that the phase-flip code stores information in the total parity of the qubits. For example, an early code realized in devices is the 2-qubit phase-flip code [6], whose \(\pm\)-basis codewords are the Bell states \(\left(|00\rangle+|11\rangle\right)/\sqrt{2}\) and \(\left(|01\rangle+|10\rangle\right)/\sqrt{2}\).

Protection

Bit-flip code corrects bit-flip errors \(X\) on \(\left\lfloor (n-1)/2\right\rfloor\) qubits and does not detect any phase-flip errors \(Z\). Phase-flip code corrects phase-flip errors \(Z\) on \(\left\lfloor (n-1)/2\right\rfloor\) qubits and does not detect any bit-flip errors \(X\).

Because they protect against only one type of noise, both codes can be thought of as a classical \([n,1,n]\) repetition code embedded in a quantum system. Nevertheless, the phase-flip code can offer some degree of protection in particular physical systems based on superconducting circuits [7,8].

Encoding

Non-deterministic encoders for various specific states of the 2-qubit phase-flip code [9].Fault-tolerant GHZ-state preparation with small qubit registers [10].Unitary circuit of depth logarithmic in \(n\) [11]. Any circuit has to have range \(n\) because GHZ states are locally indistinguishable [12].Adaptive constant-depth circuit with geometrically local gates and measurements throughout [13,14].Lindbladian-based dissipative encoding and autonomous QEC passively protecting against bit flips [15,16].Error-corrected GHZ state distillation for Steane error correction [17].Approximate Hamiltonian-based encoding of GHZ states [18].

Gates

Toffoli magic-state preparation protocol [19].A circuit of \(Z\)-type Pauli-product \(\pi/8\) rotations implements a logical \(T\) gate on the phase-flip repetition code, up to Clifford corrections, when its supports satisfy a parity condition [20; Sec. III.C]. Every qubit, pair of qubits, and triple of qubits must lie in the support of an odd number of rotations. Applying the circuit to the encoded \(|+\rangle\) state and decoding yields a \(T\)-state distillation protocol whose rotation supports, after conjugation by the decoding circuit, form a triorthogonal matrix with one row per qubit [20; Sec. III.D].

Decoding

Fault-tolerant syndrome detection [21].Autonomous QEC for the 3-qubit bit-flip code [22].Machine learning algorithm to implement autonomous QEC for the three-qubit quantum repetition code [23].Quantum cellular automata for majority voting and two-line voting [24].Quantum version of the Tsirelson local automaton decoder [25].Planar decoder designed to work under circuit-level noise [26].Single-rule and shearing-rule local automaton decoders [27].

Fault Tolerance

Fault-tolerant syndrome detection [21].An \(m\)-qubit GHZ state, i.e., qubit cat state, can serve as an ancilla for fault-tolerant measurement of a weight-\(m\) Pauli operator by coupling each ancilla qubit to one data qubit, applying Hadamards to the ancilla, and reading out the parity of the measurement outcomes [2].Toffoli magic-state preparation protocol [19].

Code Capacity Threshold

Independent \(X\) noise: \(50\%\) for quantum repetition code arranged on a 1D or 2D lattice [28].A nonzero threshold exists under the single-rule local automaton decoders [27].

Threshold

Phenomenological noise: an upper bound of \(11\%\) in 1D and a lower bound of \(17.2\%\) in 2D. The latter is achieved with an RG decoder [28; Table I].Threshold under real-time geometrically local decoder based on introducing an ancillary buffer and confining spacetime interactions between anyons [29].

Realizations

NMR: 2-qubit phase-flip code [30,31]; 3-qubit bit-flip code [32]; 3-qubit phase-flip code [33,34], with up to two rounds of error correction in liquid-state NMR [35]. Such codes were used to characterize noise [36].Linear optics: 2-qubit phase-flip code [37].Trapped ions: 3-qubit bit-flip code by Wineland group [38], and 3-qubit phase-flip algorithm implemented in 3 cycles on high fidelity gate operations [39]. Both phase- and bit-flip codes for 31 qubits and their stabilizer measurements have been realized by Quantinuum [40]. Multiple rounds of Steane error correction [41]. Superconducting circuits: 3-qubit phase-flip and bit-flip code by Schoelkopf group [42,43]; 3-qubit bit-flip code [44]; 3-qubit phase-flip code up to 3 cycles of error correction [45]; IBM 15-qubit device [46]; IBM Rochester device using 43-qubit code [47]; Google system performing up to 8 error-correction cycles on 5 and 9 qubits [48]; Google Quantum AI Sycamore utilizing up to 11 physical qubits and running 50 correction rounds [49]; Google Quantum AI Sycamore utilizing up to 25 qubits for comparison of logical error scaling with a quantum code [50] (see also [51]). Google Quantum AI follow-up experiment on codes up to (classical) distance 29, demonstrating exponential suppression to an error floor of \(10^{-10}\) [52]. Ising-model Nishimori phase transition realized for GHZ states on 54 qubits on a 127 qubit IBM device [53]. GHZ state on 75 qubits made on an IBM device [54]. Implementation of planar decoder for codes with distances between 3 and 11 on 72-qubit superconducting device [26]. Lattice surgery on the surface-17 code has been realized by splitting the code into two repetition codes by the Wallraff group [55]. 2-qubit bit-flip code error detection realized with one ancilla by the Simakov group [56]. GHZ state of 120 qubits realized on IBM device [57]. Autonomous QEC protocols have been implemented on a 3-qubit superconducting qubit device [58].Semiconductor spin-qubit devices: 3-qubit devices at RIKEN [59] and Delft [60].Nitrogen-vacancy centers in diamond: 3-qubit phase-flip code [61,62] (see also Ref. [63]).Repetition codes are used in quantum annealing protocols [64–66].Neutral atom arrays: 41 rounds of syndrome extraction and heralded logical Bell state preparation [67].

Notes

Repetition codes can be used to benchmark device performance [68].

Cousins

  • Fracton stabilizer code— Product constructions built from the one-dimensional Ising/repetition code yield several fracton phases [69; Fig. 8].
  • Abelian topological code— Product constructions built from the one-dimensional Ising/repetition code yield several topological phases [69; Fig. 8].
  • Perfect-tensor code— GHZ states are \(1\)-uniform for all \(n\) and AME for \(n=2,3\).
  • Repetition code— A quantum repetition code can be thought of as a classical \([n,1,n]\) repetition code embedded in a quantum system.
  • Dual-rail quantum code— The dual-rail code is an error space of the quantum repetition code for \(n=2\) and is stabilized by \(-ZZ\).
  • Very small logical qubit (VSLQ) code— Parts of the VSLQ codewords resemble the two-qubit phase-flip repetition code, though the code cannot correct phase errors. Unlike the phase-flip code, the VSLQ code can correct for single photon loss because it uses the second excited state in the construction, which remains distinct from the vacuum even after photon loss.
  • Cat-repetition code— The cat-repetition code is obtained by encoding each qubit of a quantum repetition code into a two-component cat code in its cat-state basis [19,70–73].
  • Two-component cat code— Two-component cat and quantum repetition codes can be thought of as classical codes because they protect against only one type of noise. Two-component cat codes (quantum repetition) codes suppress cavity dephasing (bit-flip) noise exponentially with \(|\alpha|^2\) (\(n\)). The stability offered by cat codes has been linked to several favorable properties of phases of matter associated with the repetition-code Hamiltonian [74,75].
  • \(D_4\) hyper-diamond GKP code— The \(D_4\) hyper-diamond GKP code can be seen as a concatenation of a rotated square-lattice GKP code with a repetition code [76]. This is related to the fact that the four-bit repetition code yields the \(D_4\) hyper-diamond lattice via Construction A.
  • Concatenated GKP code— Concatenating a three-qubit quantum repetition code with GKP codes can correct some two-bit-flip errors [77] (see also [78]).
  • Coherent-state repetition code— Two-component cat codes in the coherent-state basis have been concatenated with quantum repetition codes [79,80].
  • Self-correcting quantum code— The bit-flip repetition code associated with the 2D classical Ising model is a self-correcting classical memory [81; Sec. V.A].
  • Ruby Floquet code— One third of the time during the XYZ ruby measurement schedule, the ISG is that of the 6.6.6 color code concatenated with a three-qubit repetition code. One round of the color-code schedule is exactly the 2D color code concatenated with a three-qubit repetition code [82].
  • X-cube Floquet code— The G-round of the rewinding X-cube Floquet code is exactly the canonical X-cube model concatenated with four-qubit repetition codes on composite green edges [82].
  • Kitaev chain code— The Kitaev chain code can be thought of as the Majorana stabilizer analogue of the quantum repetition code [83] and is related to that code via the Jordan-Wigner transformation [84].
  • \([[2^D,D,2]]\) hypercube quantum code— The hypercube quantum code can be concatenated with a two-qubit quantum repetition code to yield a \([[2^{D+1},D,4]]\) error-detecting code family [85].
  • \([[14,3,3]]\) CE phantom code— The outer code in the \([[14,3,3]]\) CE phantom code construction is the two-qubit phase-flip repetition code [86].
  • \([[9,1,3]]\) Shor code— Using the concatenation convention of the Zoo, the Shor code is a concatenation of a three-qubit phase-flip repetition code (inner code) with a three-qubit bit-flip repetition code (outer code).
  • Transverse-field Ising model (TFIM) code— When written in the computational basis, the phase-flip and TFIM codewords are superpositions of qubit states of fixed total parity. The superposition is equal for the phase-flip code, whereas some states appear with a \(-1\) coefficient for the TFIM code. However, the TFIM code can be encoded in constant depth.
  • Cluster-state code— GHZ states can be used as resource states for MBQC protocols [87–89]. In the fault-complex formalism, foliation of a CSS code is expressed as a homological product of the code’s chain complex with a repetition-code complex [90].
  • Modular-qudit shift-resistant code— Both the quantum repetition and modular-qudit shift-resistant codes protect against only one type of noise.

Primary Hierarchy

Parents
A \([[m_1 m_2,1,\min(m_1,m_2)]]\) QPC reduces to a repetition code when \(m_1\) or \(m_2\) is one.
The codespace of the quantum repetition code is the ground-state space of a frustration-free 1D classical Ising model with nearest-neighbor interactions.
The codespace of the quantum repetition code is the ground-state space of a frustration-free 1D classical Ising model with nearest-neighbor interactions.
GNU codewords for \(g=1\) and \(m=n\) reduce to the phase-flip repetition code [91].
Group-based quantum repetition codes reduce to quantum repetition codes for \(G = \mathbb{Z}_2\).
Quantum repetition code
Children
The tetron code is a special case of the quantum repetition code with \(n=2\).

References

  1. [1]

    A. Peres, “Reversible logic and quantum computers”, Physical Review A 32, 3266 (1985) DOI

  2. [2]

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

  3. [3]

    D. M. Greenberger, M. A. Horne, A. Shimony, and A. Zeilinger, “Bell’s theorem without inequalities”, American Journal of Physics 58, 1131 (1990) DOI

  4. [4]

    N. D. Mermin, “Quantum mysteries revisited”, American Journal of Physics 58, 731 (1990) DOI

  5. [5]

    D. M. Greenberger, M. A. Horne, and A. Zeilinger, “Going Beyond Bell’s Theorem”, (2007) arXiv:0712.0921

  6. [6]

    E. Knill, R. Laflamme, and G. Milburn, “Efficient Linear Optics Quantum Computation”, (2000) arXiv:quant-ph/0006088

  7. [7]

    K. Keane and A. N. Korotkov, “Simplified quantum error detection and correction for superconducting qubits”, Physical Review A 86, (2012) arXiv:1205.1836 DOI

  8. [8]

    Á. Rozgonyi and G. Széchenyi, “Break-even point of the phase-flip error correcting code”, New Journal of Physics 25, 103004 (2023) arXiv:2303.17810 DOI

  9. [9]

    J. L. O’Brien, G. J. Pryde, A. G. White, and T. C. Ralph, “High-fidelityZ-measurement error encoding of optical qubits”, Physical Review A 71, (2005) arXiv:quant-ph/0408064 DOI

  10. [10]

    L. Jiang, J. M. Taylor, A. S. Sørensen, and M. D. Lukin, “Distributed quantum computation based on small quantum registers”, Physical Review A 76, (2007) arXiv:0709.4539 DOI

  11. [11]

    D. Cruz et al., “Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer”, Advanced Quantum Technologies 2, (2019) arXiv:1807.05572 DOI

  12. [12]

    S. Bravyi, A. Kliesch, R. Koenig, and E. Tang, “Obstacles to Variational Quantum Optimization from Symmetry Protection”, Physical Review Letters 125, (2020) arXiv:1910.08980 DOI

  13. [13]

    A. B. Watts, R. Kothari, L. Schaeffer, and A. Tal, “Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits”, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing 515 (2019) arXiv:1906.08890 DOI

  14. [14]

    R. Verresen, N. Tantivasadakarn, and A. Vishwanath, “Efficiently preparing Schrödinger’s cat, fractons and non-Abelian topological order in quantum devices”, (2022) arXiv:2112.03061

  15. [15]

    C. Ahn, A. C. Doherty, and A. J. Landahl, “Continuous quantum error correction via quantum feedback control”, Physical Review A 65, (2002) arXiv:quant-ph/0110111 DOI

  16. [16]

    F. Reiter, A. S. Sørensen, P. Zoller, and C. A. Muschik, “Dissipative quantum error correction and application to quantum sensing with trapped ions”, Nature Communications 8, (2017) arXiv:1702.08673 DOI

  17. [17]

    N. Rengaswamy, N. Raveendran, A. Raina, and B. Vasić, “Entanglement Purification with Quantum LDPC Codes and Iterative Decoding”, Quantum 8, 1233 (2024) arXiv:2210.14143 DOI

  18. [18]

    C. Yin, “Fast and Accurate Greenberger-Horne-Zeilinger Encoding Using All-to-All Interactions”, Physical Review Letters 134, (2025) arXiv:2406.10336 DOI

  19. [19]

    C. Chamberland et al., “Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes”, PRX Quantum 3, (2022) arXiv:2012.04108 DOI

  20. [20]

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

  21. [21]

    Y. C. Cheng and R. J. Silbey, “Microscopic quantum dynamics study on the noise threshold of fault-tolerant quantum error correction”, Physical Review A 72, (2005) arXiv:quant-ph/0412168 DOI

  22. [22]

    M. Sarovar and G. J. Milburn, “Continuous quantum error correction”, SPIE Proceedings 5842, 158 (2005) arXiv:quant-ph/0501049 DOI

  23. [23]

    I. Convy, H. Liao, S. Zhang, S. Patel, W. P. Livingston, H. N. Nguyen, I. Siddiqi, and K. B. Whaley, “Machine learning for continuous quantum error correction on superconducting qubits”, New Journal of Physics 24, 063019 (2022) arXiv:2110.10378 DOI

  24. [24]

    T. L. M. Guedes, D. Winter, and M. Müller, “Quantum Cellular Automata for Quantum Error Correction and Density Classification”, Physical Review Letters 133, (2024) arXiv:2309.03608 DOI

  25. [25]

    S. Balasubramanian, M. Davydova, and E. Lake, “A local automaton for the 2D toric code”, Quantum 10, 2125 (2026) arXiv:2412.19803 DOI

  26. [26]

    H. Cao et al., “Exact Decoding of Repetition Code under Circuit Level Noise”, (2025) arXiv:2501.03582

  27. [27]

    L. Paletta, A. Leverrier, M. Mirrahimi, and C. Vuillot, “High-performance local decoders for defect matching in 1D”, (2025) arXiv:2505.10162

  28. [28]

    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

  29. [29]

    E. Lake, “Local active error correction from simulated confinement”, (2025) arXiv:2510.08056

  30. [30]

    D. Leung, L. Vandersypen, X. Zhou, M. Sherwood, C. Yannoni, M. Kubinec, and I. Chuang, “Experimental realization of a two-bit phase damping quantum code”, Physical Review A 60, 1924 (1999) arXiv:quant-ph/9811068 DOI

  31. [31]

    D. W. Leung, “Towards Robust Quantum Computation”, (2000) arXiv:cs/0012017

  32. [32]

    Y. Sharf, D. G. Cory, S. S. Somaroo, T. F. Havel, E. Knill, R. Laflamme, and W. H. Zurek, “A study of quantum error correction by geometric algebra and liquid-state NMR spectroscopy”, Molecular Physics 98, 1347 (2000) arXiv:quant-ph/0004030 DOI

  33. [33]

    D. G. Cory, M. D. Price, W. Maas, E. Knill, R. Laflamme, W. H. Zurek, T. F. Havel, and S. S. Somaroo, “Experimental Quantum Error Correction”, Physical Review Letters 81, 2152 (1998) arXiv:quant-ph/9802018 DOI

  34. [34]

    O. Moussa, J. Baugh, C. A. Ryan, and R. Laflamme, “Demonstration of Sufficient Control for Two Rounds of Quantum Error Correction in a Solid State Ensemble Quantum Information Processor”, Physical Review Letters 107, (2011) arXiv:1108.4842 DOI

  35. [35]

    J. Zhang, D. Gangloff, O. Moussa, and R. Laflamme, “Experimental quantum error correction with high fidelity”, Physical Review A 84, (2011) arXiv:1109.4821 DOI

  36. [36]

    M. Laforest, D. Simon, J.-C. Boileau, J. Baugh, M. J. Ditty, and R. Laflamme, “Using error correction to determine the noise model”, Physical Review A 75, (2007) arXiv:quant-ph/0610038 DOI

  37. [37]

    T. B. Pittman, B. C. Jacobs, and J. D. Franson, “Demonstration of quantum error correction using linear optics”, Physical Review A 71, (2005) arXiv:quant-ph/0502042 DOI

  38. [38]

    J. Chiaverini et al., “Realization of quantum error correction”, Nature 432, 602 (2004) DOI

  39. [39]

    P. Schindler, J. T. Barreiro, T. Monz, V. Nebendahl, D. Nigg, M. Chwalla, M. Hennrich, and R. Blatt, “Experimental Repetitive Quantum Error Correction”, Science 332, 1059 (2011) DOI

  40. [40]

    S. A. Moses et al., “A Race-Track Trapped-Ion Quantum Processor”, Physical Review X 13, (2023) arXiv:2305.03828 DOI

  41. [41]

    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

  42. [42]

    L. DiCarlo, M. D. Reed, L. Sun, B. R. Johnson, J. M. Chow, J. M. Gambetta, L. Frunzio, S. M. Girvin, M. H. Devoret, and R. J. Schoelkopf, “Preparation and measurement of three-qubit entanglement in a superconducting circuit”, Nature 467, 574 (2010) arXiv:1004.4324 DOI

  43. [43]

    M. D. Reed, L. DiCarlo, S. E. Nigg, L. Sun, L. Frunzio, S. M. Girvin, and R. J. Schoelkopf, “Realization of three-qubit quantum error correction with superconducting circuits”, Nature 482, 382 (2012) arXiv:1109.4948 DOI

  44. [44]

    D. Ristè, S. Poletto, M.-Z. Huang, A. Bruno, V. Vesterinen, O.-P. Saira, and L. DiCarlo, “Detecting bit-flip errors in a logical qubit using stabilizer measurements”, Nature Communications 6, (2015) arXiv:1411.5542 DOI

  45. [45]

    J. Cramer, N. Kalb, M. A. Rol, B. Hensen, M. S. Blok, M. Markham, D. J. Twitchen, R. Hanson, and T. H. Taminiau, “Repeated quantum error correction on a continuously encoded qubit by real-time feedback”, Nature Communications 7, (2016) arXiv:1508.01388 DOI

  46. [46]

    J. R. Wootton and D. Loss, “Repetition code of 15 qubits”, Physical Review A 97, (2018) arXiv:1709.00990 DOI

  47. [47]

    J. R. Wootton, “Benchmarking near-term devices with quantum error correction”, Quantum Science and Technology 5, 044004 (2020) arXiv:2004.11037 DOI

  48. [48]

    J. Kelly et al., “State preservation by repetitive error detection in a superconducting quantum circuit”, Nature 519, 66 (2015) arXiv:1411.7403 DOI

  49. [49]

    “Exponential suppression of bit or phase errors with cyclic error correction”, Nature 595, 383 (2021) arXiv:2102.06132 DOI

  50. [50]

    “Suppressing quantum errors by scaling a surface code logical qubit”, Nature 614, 676 (2023) arXiv:2207.06431 DOI

  51. [51]

    K. C. Miao et al., “Overcoming leakage in quantum error correction”, Nature Physics 19, 1780 (2023) arXiv:2211.04728 DOI

  52. [52]

    “Quantum error correction below the surface code threshold”, Nature 638, 920 (2024) arXiv:2408.13687 DOI

  53. [53]

    E. H. Chen et al., “Nishimori transition across the error threshold for constant-depth quantum circuits”, Nature Physics 21, 161 (2024) arXiv:2309.02863 DOI

  54. [54]

    H. Liao, G. S. Hartnett, A. Kakkar, A. Tan, M. Hush, P. S. Mundada, M. J. Biercuk, and Y. Baum, “Achieving Computational Gains with Quantum Error-Correction Primitives: Generation of Long-Range Entanglement Enhanced by Error Detection”, PRX Quantum 6, (2025) arXiv:2411.14638 DOI

  55. [55]

    I. Besedin et al., “Lattice surgery realized on two distance-three repetition codes with superconducting qubits”, Nature Physics (2026) arXiv:2501.04612 DOI

  56. [56]

    A. S. Kazmina, A. M. Polyanskiy, E. Yu. Egorova, N. N. Abramov, D. A. Kalacheva, V. B. Lubsanov, A. N. Bolgar, and I. A. Simakov, “Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit”, (2025) arXiv:2506.20529

  57. [57]

    A. Javadi-Abhari, S. Martiel, A. Seif, M. Takita, and K. X. Wei, “Big cats: entanglement in 120 qubits and beyond”, (2025) arXiv:2510.09520

  58. [58]

    W. P. Livingston, M. S. Blok, E. Flurin, J. Dressel, A. N. Jordan, and I. Siddiqi, “Experimental demonstration of continuous quantum error correction”, Nature Communications 13, (2022) arXiv:2107.11398 DOI

  59. [59]

    K. Takeda, A. Noiri, T. Nakajima, T. Kobayashi, and S. Tarucha, “Quantum error correction with silicon spin qubits”, Nature 608, 682 (2022) arXiv:2201.08581 DOI

  60. [60]

    F. van Riggelen, W. I. L. Lawrie, M. Russ, N. W. Hendrickx, A. Sammak, M. Rispler, B. M. Terhal, G. Scappucci, and M. Veldhorst, “Phase flip code with semiconductor spin qubits”, (2022) arXiv:2202.11530

  61. [61]

    G. Waldherr et al., “Quantum error correction in a solid-state hybrid spin register”, Nature 506, 204 (2014) arXiv:1309.6424 DOI

  62. [62]

    T. Nakazato, R. Reyes, N. Imaike, K. Matsuda, K. Tsurumoto, Y. Sekiguchi, and H. Kosaka, “Quantum error correction of spin quantum memories in diamond under a zero magnetic field”, Communications Physics 5, (2022) DOI

  63. [63]

    T. H. Taminiau, J. Cramer, T. van der Sar, V. V. Dobrovitski, and R. Hanson, “Universal control and error correction in multi-qubit spin registers in diamond”, Nature Nanotechnology 9, 171 (2014) arXiv:1309.5452 DOI

  64. [64]

    S. P. Jordan, E. Farhi, and P. W. Shor, “Error-correcting codes for adiabatic quantum computation”, Physical Review A 74, (2006) arXiv:quant-ph/0512170 DOI

  65. [65]

    K. L. Pudenz, T. Albash, and D. A. Lidar, “Error-corrected quantum annealing with hundreds of qubits”, Nature Communications 5, (2014) arXiv:1307.8190 DOI

  66. [66]

    K. L. Pudenz, T. Albash, and D. A. Lidar, “Quantum annealing correction for random Ising problems”, Physical Review A 91, (2015) arXiv:1408.4382 DOI

  67. [67]

    J. A. Muniz et al., “Repeated ancilla reuse for logical computation on a neutral atom quantum computer”, (2025) arXiv:2506.09936

  68. [68]

    T. Tomesh, P. Gokhale, V. Omole, G. S. Ravi, K. N. Smith, J. Viszlai, X.-C. Wu, N. Hardavellas, M. R. Martonosi, and F. T. Chong, “SupermarQ: A Scalable Quantum Benchmark Suite”, (2022) arXiv:2202.11045

  69. [69]

    T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes II. Product constructions”, (2024) arXiv:2402.16831

  70. [70]

    J. Guillaud and M. Mirrahimi, “Repetition Cat Qubits for Fault-Tolerant Quantum Computation”, Physical Review X 9, (2019) arXiv:1904.09474 DOI

  71. [71]

    S. Puri et al., “Bias-preserving gates with stabilized cat qubits”, Science Advances 6, (2020) arXiv:1905.00450 DOI

  72. [72]

    J. Guillaud and M. Mirrahimi, “Error rates and resource overheads of repetition cat qubits”, Physical Review A 103, (2021) arXiv:2009.10756 DOI

  73. [73]

    F.-M. L. Régent, C. Berdou, Z. Leghtas, J. Guillaud, and M. Mirrahimi, “High-performance repetition cat code using fast noisy operations”, Quantum 7, 1198 (2023) arXiv:2212.11927 DOI

  74. [74]

    F. Minganti, A. Biella, N. Bartolo, and C. Ciuti, “Spectral theory of Liouvillians for dissipative phase transitions”, Physical Review A 98, (2018) arXiv:1804.11293 DOI

  75. [75]

    S. Lieu, R. Belyansky, J. T. Young, R. Lundgren, V. V. Albert, and A. V. Gorshkov, “Symmetry Breaking and Error Correction in Open Quantum Systems”, Physical Review Letters 125, (2020) arXiv:2008.02816 DOI

  76. [76]

    B. Royer, S. Singh, and S. M. Girvin, “Encoding Qubits in Multimode Grid States”, PRX Quantum 3, (2022) arXiv:2201.12337 DOI

  77. [77]

    K. Fukui, A. Tomita, and A. Okamoto, “Analog Quantum Error Correction with Encoding a Qubit into an Oscillator”, Physical Review Letters 119, (2017) arXiv:1706.03011 DOI

  78. [78]

    M. P. Stafford and N. C. Menicucci, “Biased Gottesman-Kitaev-Preskill repetition code”, Physical Review A 108, (2023) arXiv:2212.11397 DOI

  79. [79]

    H. Jeong and M. S. Kim, “Efficient quantum computation using coherent states”, Physical Review A 65, (2002) arXiv:quant-ph/0109077 DOI

  80. [80]

    T. C. Ralph, A. Gilchrist, G. J. Milburn, W. J. Munro, and S. Glancy, “Quantum computation with optical coherent states”, Physical Review A 68, (2003) arXiv:quant-ph/0306004 DOI

  81. [81]

    B. J. Brown, D. Loss, J. K. Pachos, C. N. Self, and J. R. Wootton, “Quantum memories at finite temperature”, Reviews of Modern Physics 88, (2016) arXiv:1411.6643 DOI

  82. [82]

    A. Dua, N. Tantivasadakarn, J. Sullivan, and T. D. Ellison, “Engineering 3D Floquet Codes by Rewinding”, PRX Quantum 5, (2024) arXiv:2307.13668 DOI

  83. [83]

    A. Schuckert, E. Crane, A. V. Gorshkov, M. Hafezi, and M. J. Gullans, “Fault-tolerant fermionic quantum computing”, (2025) arXiv:2411.08955

  84. [84]

    A. Kitaev and C. Laumann, “Topological phases and quantum computation”, (2009) arXiv:0904.2771

  85. [85]

    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

  86. [86]

    J. M. Koh, A. Gong, A. C. Diaconu, D. B. Tan, A. A. Geim, M. J. Gullans, N. Y. Yao, M. D. Lukin, and S. Majidy, “Entangling logical qubits without physical operations”, (2026) arXiv:2601.20927

  87. [87]

    M. Gimeno-Segovia, P. Shadbolt, D. E. Browne, and T. Rudolph, “From Three-Photon Greenberger-Horne-Zeilinger States to Ballistic Universal Quantum Computation”, Physical Review Letters 115, (2015) arXiv:1410.3720 DOI

  88. [88]

    S.-W. Lee, K. Park, T. C. Ralph, and H. Jeong, “Nearly Deterministic Bell Measurement for Multiphoton Qubits and its Application to Quantum Information Processing”, Physical Review Letters 114, (2015) arXiv:1502.07437 DOI

  89. [89]

    S. Omkar, S.-H. Lee, Y. S. Teo, S.-W. Lee, and H. Jeong, “All-Photonic Architecture for Scalable Quantum Computing with Greenberger-Horne-Zeilinger States”, PRX Quantum 3, (2022) arXiv:2109.12280 DOI

  90. [90]

    T. Hillmann, G. Dauphinais, I. Tzitrin, and M. Vasmer, “Single-shot and measurement-based quantum error correction via fault complexes”, Physical Review A 112, (2025) arXiv:2410.12963 DOI

  91. [91]

    Y. Ouyang, “Permutation-invariant quantum codes”, Physical Review A 90, (2014) arXiv:1302.3247 DOI

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: quantum_repetition

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

Cite as:

“Quantum repetition code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/quantum_repetition, arXiv:2606.11484

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