# 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}\). Also known as 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\).

The \(\pm\)-basis codewords for the bit-flip code are GHz (a.k.a. cat) states \(|0\rangle^{\otimes n}\pm|1\rangle^{\otimes n}\). These are ground states of the one-dimensional 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}|v_{1},\cdots,v_{n}\rangle~{\phantom{,}}\\ |\overline{-}\rangle =\frac{1}{\sqrt{2^{n-1}}}\sum_{\sum_{i}v_{i}=1}|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.

## Protection

Bit-flip code detects 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 detects 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,d]\) repetition code with classical distance \(d=\left\lfloor (n-1)/2\right\rfloor\) embedded in a quantum system. Nevertheless, the phase-flip code can offer some degree of protection in particular physical systems based on superconducting circuits [2,3].

## Encoding

## Gates

## Decoding

## Fault Tolerance

## Code Capacity Threshold

## Threshold

## Realizations

## Notes

## Parents

- Quantum parity code (QPC) — 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.
- Group-based quantum repetition code — Group-based quantum repetition codes reduce to quantum repetition codes for \(G = \mathbb{Z}_2\).
- GNU PI code — GNU codewords for \(g=1\) reduce to the phase-flip repetition code.
- Frustration-free Hamiltonian code — The codespace of the quantum repetition code is the ground-state space of a frustration-free classical Ising model with nearest-neighbor interactions.
- Commuting-projector Hamiltonian code — The codespace of the quantum repetition code is the ground-state space of a frustration-free classical Ising model with nearest-neighbor interactions.

## Cousins

- Fracton stabilizer code — The 1D quantum repetition code is an ingredient in product constructions that yield several fracton phases [39; Fig. 8].
- Abelian topological code — The 1D quantum repetition code is an ingredient in product constructions that yield several topological phases [39; Fig. 8].
- Repetition code — A quantum repetition code can be thought of as a classical \([n,1,d]\) repetition code with classical distance \(d=\left\lfloor (n-1)/2\right\rfloor\) embedded in a quantum system.
- Two-component cat code — Two-legged cat and quantum repetition codes can be thought of as classical codes because they protect against only one type of noise. Two-legged 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 [40,41].
- 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.
- \(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 [42]. This is related to the fact that the four-bit repetition code yields the \(D_4\) hyper-diamond lattice code via Construction A.
- Self-correcting quantum code — The bit-flip repetition code associated with the 2D classical Ising model is a self-correcting classical memory [43; Sec. V.A].
- XYZ ruby Floquet code — One third of the time during its measurement schedule, the ISG of the XYZ ruby Floquet code is that of the 6.6.6 color code concatenated with a three-qubit repetition code.
- \([[2^D,D,2]]\) hypercube code — The hypercube code can be concatenated with a two-qubit quantum repetition code to yield a \([[2^{D+1},D,4]]\) error-detecting code family [44].
- \([[9,1,3]]\) Shor code — The Shor code is a concatenation of a three-qubit bit-flip with a three-qubit phase-flip repetition 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 TFIM code. However, the TFIM code can be encoded in constant depth.
- X-cube model code — Generalized X-cube models [39] are constructed from a balanced product of the quantum repetion (1D Ising) code and the Newman-Moore code.

## References

- [1]
- A. Peres, “Reversible logic and quantum computers”, Physical Review A 32, 3266 (1985) DOI
- [2]
- K. Keane and A. N. Korotkov, “Simplified quantum error detection and correction for superconducting qubits”, Physical Review A 86, (2012) arXiv:1205.1836 DOI
- [3]
- Á. 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
- [4]
- 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
- [5]
- S. Bravyi et al., “Obstacles to Variational Quantum Optimization from Symmetry Protection”, Physical Review Letters 125, (2020) arXiv:1910.08980 DOI
- [6]
- A. B. Watts et al., “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 (2019) arXiv:1906.08890 DOI
- [7]
- 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
- [8]
- 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
- [9]
- F. Reiter et al., “Dissipative quantum error correction and application to quantum sensing with trapped ions”, Nature Communications 8, (2017) arXiv:1702.08673 DOI
- [10]
- C. Chamberland et al., “Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes”, PRX Quantum 3, (2022) arXiv:2012.04108 DOI
- [11]
- A. L. Toom, “Nonergodic Multidimensional System of Automata”, Probl. Peredachi Inf., 10:3 (1974), 70–79; Problems Inform. Transmission, 10:3 (1974), 239–246
- [12]
- L. F. Gray, “Toom’s Stability Theorem in Continuous Time”, Perplexing Problems in Probability 331 (1999) DOI
- [13]
- P. Gács, Journal of Statistical Physics 103, 45 (2001) DOI
- [14]
- I. Convy et al., “Machine learning for continuous quantum error correction on superconducting qubits”, New Journal of Physics 24, 063019 (2022) arXiv:2110.10378 DOI
- [15]
- 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
- [16]
- D. G. Cory et al., “Experimental Quantum Error Correction”, Physical Review Letters 81, 2152 (1998) arXiv:quant-ph/9802018 DOI
- [17]
- O. Moussa et al., “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
- [18]
- J. Zhang et al., “Experimental quantum error correction with high fidelity”, Physical Review A 84, (2011) arXiv:1109.4821 DOI
- [19]
- J. Chiaverini et al., “Realization of quantum error correction”, Nature 432, 602 (2004) DOI
- [20]
- P. Schindler et al., “Experimental Repetitive Quantum Error Correction”, Science 332, 1059 (2011) DOI
- [21]
- S. A. Moses et al., “A Race-Track Trapped-Ion Quantum Processor”, Physical Review X 13, (2023) arXiv:2305.03828 DOI
- [22]
- L. Postler et al., “Demonstration of fault-tolerant Steane quantum error correction”, (2023) arXiv:2312.09745
- [23]
- M. D. Reed et al., “Realization of three-qubit quantum error correction with superconducting circuits”, Nature 482, 382 (2012) arXiv:1109.4948 DOI
- [24]
- D. Ristè et al., “Detecting bit-flip errors in a logical qubit using stabilizer measurements”, Nature Communications 6, (2015) arXiv:1411.5542 DOI
- [25]
- J. Cramer et al., “Repeated quantum error correction on a continuously encoded qubit by real-time feedback”, Nature Communications 7, (2016) arXiv:1508.01388 DOI
- [26]
- J. R. Wootton and D. Loss, “Repetition code of 15 qubits”, Physical Review A 97, (2018) arXiv:1709.00990 DOI
- [27]
- J. R. Wootton, “Benchmarking near-term devices with quantum error correction”, Quantum Science and Technology 5, 044004 (2020) arXiv:2004.11037 DOI
- [28]
- J. Kelly et al., “State preservation by repetitive error detection in a superconducting quantum circuit”, Nature 519, 66 (2015) arXiv:1411.7403 DOI
- [29]
- “Exponential suppression of bit or phase errors with cyclic error correction”, Nature 595, 383 (2021) arXiv:2102.06132 DOI
- [30]
- R. Acharya et al., “Suppressing quantum errors by scaling a surface code logical qubit”, (2022) arXiv:2207.06431
- [31]
- K. C. Miao et al., “Overcoming leakage in quantum error correction”, Nature Physics 19, 1780 (2023) arXiv:2211.04728 DOI
- [32]
- W. P. Livingston et al., “Experimental demonstration of continuous quantum error correction”, Nature Communications 13, (2022) arXiv:2107.11398 DOI
- [33]
- K. Takeda et al., “Quantum error correction with silicon spin qubits”, Nature 608, 682 (2022) arXiv:2201.08581 DOI
- [34]
- F. van Riggelen et al., “Phase flip code with semiconductor spin qubits”, (2022) arXiv:2202.11530
- [35]
- G. Waldherr et al., “Quantum error correction in a solid-state hybrid spin register”, Nature 506, 204 (2014) arXiv:1309.6424 DOI
- [36]
- T. Nakazato et al., “Quantum error correction of spin quantum memories in diamond under a zero magnetic field”, Communications Physics 5, (2022) DOI
- [37]
- T. H. Taminiau et al., “Universal control and error correction in multi-qubit spin registers in diamond”, Nature Nanotechnology 9, 171 (2014) arXiv:1309.5452 DOI
- [38]
- T. Tomesh et al., “SupermarQ: A Scalable Quantum Benchmark Suite”, (2022) arXiv:2202.11045
- [39]
- T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes II. Product constructions”, (2024) arXiv:2402.16831
- [40]
- F. Minganti et al., “Spectral theory of Liouvillians for dissipative phase transitions”, Physical Review A 98, (2018) arXiv:1804.11293 DOI
- [41]
- S. Lieu et al., “Symmetry Breaking and Error Correction in Open Quantum Systems”, Physical Review Letters 125, (2020) arXiv:2008.02816 DOI
- [42]
- B. Royer, S. Singh, and S. M. Girvin, “Encoding Qubits in Multimode Grid States”, PRX Quantum 3, (2022) arXiv:2201.12337 DOI
- [43]
- B. J. Brown et al., “Quantum memories at finite temperature”, Reviews of Modern Physics 88, (2016) arXiv:1411.6643 DOI
- [44]
- D. Hangleiter et al., “Fault-tolerant compiling of classically hard IQP circuits on hypercubes”, (2024) arXiv:2404.19005

## Page edit log

- Victor V. Albert (2022-09-28) — most recent
- Mazin Karjikar (2022-06-28)
- Victor V. Albert (2022-06-07)
- Victor V. Albert (2022-02-23)
- Victor V. Albert (2021-10-29)

## Cite as:

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