Here is a list of all quantum codes with fault-tolerant gadgets.

Name | Fault-tolerant gadget |
---|---|

3D color code | Fault-tolerant quantum computation using 3D color codes constructed from tetrahedra [1]. |

3D surface code | Fault-tolerant Hadamard gate using teleportation and error correction [2]. |

Abelian TQD stabilizer code | Fault-tolerant circuits for all non-chiral abelian topological phases and the \(\mathbb{Z}_2^3\) code with a type-III cocycle [3]. |

Abelian topological code | Fault-tolerant logical operations can be interpreted as anyon condensation events [4].Modular decoding, designed to overcome the backlog problem, is applicable to fault-tolerant protocols based on topological qubit stabilizer codes [5]. |

Asymmetric quantum code | Fault-tolerant noise-bias-preserving computation scheme [6].Fault-tolerant circuits converting between asymmetric and symmetric subsystem codes [7]. |

Bacon-Shor code | Fault-tolerant teleportation-based computation scheme for asymmetric Bacon-Shor codes that is effective against highly biased noise [8].Pieceably fault-tolerant circuits can be employed to construct non-transversal gates effectively [9]. |

Bivariate bicycle (BB) code | Fault-tolerant state initialization using lattice surgery techniques [10,11] and an ancillary surface code [12]. |

Capped color code (CCC) | Fault-tolerant syndrome extraction and error correction for capped color codes in H form [13].Fault-tolerant T gate implementation [13]. |

Cat code | Universal set of error-corrected operations tolerating a single photon loss and an arbitrary ancilla fault [14]. |

Clifford-deformed surface code (CDSC) | In order to leverage the benefits of CDSCs into practical universal computation, we have to implement syndrome measurement circuits and fault-tolerant logical gates in a bias-preserving way. |

Cluster-state code | Generalized foliation procedures exist for noise-bias preserving MBQC [15]. |

Color code | The 6D color code is a self-correcting quantum memory and admits fault-tolerant universal gate set in 7D [16]. |

Concatenated Steane code | There exist fault-tolerant syndrome extraction protocols for the concatenated Steane code [17]. |

Dual-rail quantum code | Dual-rail qubits can be used to convert leakage and amplitude damping noise into erasure noise [18]. |

Expander code | The flip decoding algorithm is fault tolerant against parity check errors [19]; see also course notes by M. Sudan. |

Five-qubit perfect code | Pieceable fault-tolerant CZ, CNOT, and CCZ gates [20].Syndrome measurement can be done with two ancillary flag qubits [21]. The depth of syndrome extraction circuits can be lowered by using past syndrome values [22]. |

Floquet color code | Fault-tolerant measurement-based computation can be realized using the foliated Floquet color code [23]. |

Fusion-based quantum computing (FBQC) code | Fusion networks are constructed in a fault tolerant way (as a stabilizer code), and they can be created in a way that naturally encodes topological fault tolerance. |

GKP cluster-state code | First encoding demonstrating the possibility of fault-tolerant measurement-based computation with CV cluster states. A fault-tolerance threshold can be achieved by concatenating existing fault-tolerant schemes for qubit-based cluster-state encodings with the GKP code [24].Hybrid cluster state consisting of GKP qubits at some modes and squeezed states at others has been proposed to work in a fault-tolerant scheme [25]. |

Gottesman-Kitaev-Preskill (GKP) code | Logical Clifford operations are given by Gaussian unitaries, which map bounded-size errors to bounded-size errors [26]. |

Hastings-Haah Floquet code | Floquet codes on tri-colorable lattices can be made fault-tolerant in the presence of dead qubits [27]. |

Heavy-hexagon code | All logical gates can be fault-tolerantly implemented using lattice surgery and magic state injection.Stabilizer measurements are measured fault-tolerantly using one-flag circuits since some single-fault events can result in weight-two data qubit errors which are parallel to the code's logical operators. Hence, using information from the flag-qubit measurements is crucial to fault-tolerantly measure the code stabilizers. |

Hermitian qubit code | Characterizing fault-tolerant multi-qubit gates under the \(GF(4)\) representation may involve characterizing all global automorphisms of some number of copies of a code that preserve the symplectic inner product [28; pg. 9]. |

Hierarchical code | 2D geometrically local syndrome extraction circuits of depth \(O(\sqrt{n}/R)\) that utilize Clifford and SWAP gates of range \(R\) and that require order \(O(n)\) data and ancilla qubits. Such parameters (including a range of one) are possible while maintaining a threshold because of the concatenation step. This reduces the noise that would otherwise accumulate within a growing-depth syndrome extraction circuit. A key idea is that constant-depth syndrome extraction is not a necessary condition for fault-tolerance. |

Homological product code | Universal set of gates can be obtained by fault-tolerantly mapping between different encoded representations of a given logical state [29]. |

Honeycomb (6.6.6) color code | Fault-tolerant syndrome extraction circuits using flag qubits [30]. |

Honeycomb Floquet code | One can run a fault-tolerant decoding algorithm by (1) bipartitioning the syndrome lattice into two graphs which are congruent to the Cayley graph of the free Abelian group with three generators (up to boundary conditions) and (2) performing a matching algorithm to deduce errors. |

Kitaev honeycomb code | One can distill ancilla states to arbitrary precision for sufficiently small noise rates and assuming perfect Clifford operations [31]. |

Kitaev surface code | Transversal (non-Clifford) CCZ gate by bringing 2D surface codes together and using just-in-time decoding [32]. Gate can be simulated by taking 2D slices out of 3D surface codes [33].Homomorphic measurement protocols for arbitrary surface codes [34].Non-geometrically local connectivity can reduce overhead cost [35].Fault-tolerant post-selection framework yields magic states with low overhead [36].Framework of fault tolerance utilizing ZX calculus [37,38] that is applicable to MBQC, FBQC, and conventional computation versions of the surface code [39].Single-shot state preparation [40] and MWPM decoding [41].Syndrome extraction circuits consisting of CNOT gates and ancillary measurements [42]. Circuits can be optimized to specific architectures [43] using spacetime circuit codes and ZX calculus [37,38].Inspired by the honeycomb Floquet code, various two-body measurement schemes have been designed [44–46]. |

Low-depth random Clifford-circuit qubit code | Fault-tolerant state preparation [47]. |

Majorana color code | Ordinary and twist-based lattice surgery can be made fault tolerant [48] (see also [49]). |

Majorana surface code | Ordinary and twist-based lattice surgery can be made fault tolerant [48] (see also [49]). |

Number-phase code | Fault-tolerant computation schemes with number-phase codes have been proposed based on concatenation with Bacon-Shor subsystem codes [50]. |

Projective-plane surface code | Fault-tolerant Hadamard gate [51]. |

Quantum Reed-Muller code | Gate switching protocol for universal computation [52]. |

Quantum divisible code | The \(T\) gate realized by concatenating members of the \([[2m − 1, 1 \leq k \leq 1 + \sum_{i=1}^{m-4}(m − i), 3]]\) quantum divisible code family with either the five-qubit \([[5,1,3]]\) or Steane \([[7,1,3]]\) code is fault-tolerant and does not require magic-state distillation [53]. The gate is performed on the inner five-qubit/Steane code and does require encoding and decoding algorithms to pass between the inner and outer codes. |

Quantum expander code | Fault-tolerance with constant overhead can be achieved [54]. |

Quantum low-density parity-check (QLDPC) code | Lattice surgery techniques with ancilla qubits [10,11]. In one such technique, one first performs a logical measurement by code switching into a code whose stabilizer group includes the original stabilizers together with the logical Paulis that are to be measured. Then, one can reduce the weight of the output code using weight reduction.Fault-tolerance with constant overhead can be performed on certain QLDPC codes [55], e.g., quantum expander codes [54].GHZ state distillation for Steane error correction [56]. |

Quantum polar code | State preparation of a single logical qubit [57]. |

Quantum repetition code | Toffoli magic-state preparation protocol [58]. |

Qubit CSS code | Steane error correction [59], where fault-tolerance is ensured by preparing ancillary encoded states and extracting syndromes via \(CNOT\) gates.Homomorphic gadgets fault-tolerant measurement unify Steane and Shor error correction [34].Parallel syndrome extraction for distance-three codes can be done fault-tolerantly using one flag qubit [60].Distance-preserving flag fault-tolerant error correction using lookup tables for small codes [61].A fault-tolerant error-correction protocol using \(O(d\log d)\) syndrome measurements can be applied to any CSS code with distance \(d \geq \Omega(n^{\alpha})\) for any \(\alpha > 0\) [62].Fault-tolerant measurement-free scheme for low-distance CSS codes [63]. |

Qubit Golay code | Fault-tolerant depth-7 circuit consisting of 57 CNOT gates and preparing a logical-zero state [64]. |

Qubit code | There are lower bounds on the overhead of fault-tolerant QEC in terms of the capacity of the noise channel [65]. A more stringent bound applies to geometrically local QEC due to the fact that locality constrains the growth of the entanglement that is needed for protection [66].Arbitrary \(n\)-qubit circuits can be implemented fault-tolerantly in a 3D architecture using \(O(n^{3/2}\log^3 n)\) qubits, and in a 2D architecture using only \(O(n^2 \log^3 n)\) qubits [67]. |

Qubit stabilizer code | Gates in the Clifford hierarchy can be done using gate teleportation, in which a gate can be obtained from a particular magic state [68,69]. Such protocols can be made fault tolerant with the help of magic-state distillation [70].Logical Bell measurements can be done transversally, and thus fault tolerantly, by performing bitwise Bell measurements for each pair of qubits (with each member of the pair taken from one of the two code blocks) and processing the result.With pieceable fault-tolerance, any non-degenerate stabilizer code with a complete set of fault-tolerant single-qubit Clifford gates has a universal set of non-transversal fault-tolerant gates [20].Shor error correction [71,72], in which fault tolerance against syndrome extraction errors is ensured by simply repeating syndrome measurements. A modification uses adaptive measurements [73].Generalization of Steane error correction stabilizer codes [9; Sec. 3.6].Fault-tolerant error correction scheme by Knill (a.k.a. telecorrection [74]), which is based on teleportation [75,76].GHz state distillation for Steane error correction [77].Syndrome extraction using flag qubits and classical codes [78]. |

Repetition code | Triple modular redundancy (TMR) error-correction protocol [79] for fault-tolerant memory operations and classical gate operations; see section 2.6 and 2.7 Ref. [80] for a pedagogical explanation. |

Rotated surface code | A particular choice of CNOT gates during syndrome extraction is required to avoid hook errors and be fault-tolerant to syndrome qubit errors [42,81,82]. |

Square-lattice GKP code | Clifford gates can be realized by performing linear-optical operations, sympletic transformations and displacements, all of which are Gaussian operations. Pauli gates can be performed using displacement operators. Clifford gates are fault tolerant in the sense that they map bounded-size errors to bounded-size errors [26].Error correction scheme is fault-tolerant to displacement noise as long as all input states have displacement errors less than \(\sqrt{\pi}/6\) [83]. |

Square-octagon (4.8.8) color code | Color-code lattice surgery [84].Fault-tolerant syndrome extraction circuits [85]. |

Subsystem qubit stabilizer code | Logical Clifford gates can be implemented fault-tolerantly for subsystem codes of distance at least three [86]. |

Subsystem spacetime circuit code | Fault-tolerant measurement gadget that is a modification based on the DiVincenzo-Shor cat-state method [71,72]. |

Subsystem surface code | Gauge fixing and changing the order in which check operators are measured yields a fault-tolerant decoder [87]. |

Three-fermion (3F) Walker-Wang model code | Fault-tolerant MBQC protocol by encoding in, braiding, and fusing symmetry defects. |

Triangular surface code | The symmetry of triangle codes allows for fault-tolerant measurement and encoding in any Pauli basis [88].A non-fault-tolerant curcuit initializes the triangle code. To guarantee fault-tolerance, postselection is performed on trivial measurements of the syndrome and of the logical Pauli, depending on the basis of the logical states [88].Making syndrome extraction fault tolerant requires a specific ordering of syndrome measurements so as to avoid hook errors [88]. |

Triorthogonal code | Universal fault-tolerant gates can be performed without magic-state distillation [86,89]. |

Twisted XZZX toric code | Fault-tolerant syndrome extraction circuits using flag qubits [90]. |

Two-component cat code | Fault-tolerant error-correction procedure using small amplitude coherent states [91].Bias-preserving Hamiltonian-based CNOT gate is part of a universal noise-bias-preserving gate set that can be made fault tolerant using concatenation [92,93].Ancilla qubits encoded in two-component cat codes yield fault-tolerant syndrome extraction circuits [94]. |

Zero-pi qubit code | One- and two-qubit phase gate errors can be suppressed [95]. |

\([[10,1,2]]\) CSS code | A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[10,1,2]]\) code [96]. |

\([[15, 7, 3]]\) quantum Hamming code | Clifford gates can be performed fault-tolerantly using two ancillary flag qubits, and a CCZ gate can be performed using four ancilla qubits [97]. |

\([[15,1,3]]\) quantum Reed-Muller code | A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[15,1,3]]\) code [52,86,89,98]. |

\([[2^r-1, 2^r-2r-1, 3]]\) quantum Hamming code | Syndrome measurement can be done with two ancillary flag qubits [21].Concatenations of quantum Hamming codes with the \([[4,2,2]]\) and \([[6,2,2]]\) codes yield fault-tolerant quantum computation with constant space and quasi-polylogarithmic time overheads [99]. |

\([[2m,2m-2,2]]\) error-detecting code | Two-qubit fault-tolerant state preparation, error detection and projective measurements [21] (see also [100]).CNOT and Hadamard gates using only two extra qubits and four-qubit fault-tolerant CCZ gate [97]. |

\([[4,2,2]]\) CSS code | Preparation of certain states, both magic and non-magic, along with transversal gates can be performed fault-tolerantly, but requires post-selection because the code cannot correct errors [101]. Magic states can be injected into surface and color codes since the code is a small instance of both [102].Concatenations of \([[4,2,2]]\) and \([[6,2,2]]\) \(C_6\) codes yield fault-tolerant quantum computation schemes [75].Concatenations of quantum Hamming codes with the \([[4,2,2]]\) and \([[6,2,2]]\) \(C_6\) codes yield fault-tolerant quantum computation with constant space and quasi-polylogarithmic time overheads [99,103]. |

\([[6,2,2]]\) \(C_6\) code | Concatenations of \([[4,2,2]]\) and \([[6,2,2]]\) \(C_6\) codes yield fault-tolerant quantum computation schemes [75].Concatenations of quantum Hamming codes with the \([[4,2,2]]\) and \([[6,2,2]]\) \(C_6\) codes yield fault-tolerant quantum computation with constant space and quasi-polylogarithmic time overheads [99,103]. |

\([[7,1,3]]\) Steane code | A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[15,1,3]]\) code [52,86,89,98].A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[10,1,2]]\) code [96].Fault-tolerant logical zero and magic state preparation [104]. Magic-state preparation converts unbiased noise into biased noise [105].Pieceable fault-tolerant CCZ gate [20].Syndrome measurement can be done with ancillary flag qubits [21,88] or with no extra qubits [106]. The depth of syndrome extraction circuits can be lowered by using past syndrome values [22]. |

\([[8,3,2]]\) CSS code | CCZ gate can be distilled in a fault-tolerant manner [107]. |

## References

- [1]
- H. Bombin, “2D quantum computation with 3D topological codes”, (2018) arXiv:1810.09571
- [2]
- M. Vasmer and D. E. Browne, “Three-dimensional surface codes: Transversal gates and fault-tolerant architectures”, Physical Review A 100, (2019) arXiv:1801.04255 DOI
- [3]
- A. Bauer, “Low-overhead non-Clifford topological fault-tolerant circuits for all non-chiral abelian topological phases”, (2024) arXiv:2403.12119
- [4]
- M. S. Kesselring et al., “Anyon Condensation and the Color Code”, PRX Quantum 5, (2024) arXiv:2212.00042 DOI
- [5]
- H. Bombín et al., “Modular decoding: parallelizable real-time decoding for quantum computers”, (2023) arXiv:2303.04846
- [6]
- P. Aliferis et al., “Fault-tolerant computing with biased-noise superconducting qubits: a case study”, New Journal of Physics 11, 013061 (2009) arXiv:0806.0383 DOI
- [7]
- Z. W. E. Evans et al., “Error correction optimisation in the presence of X/Z asymmetry”, (2007) arXiv:0709.3875
- [8]
- P. Brooks and J. Preskill, “Fault-tolerant quantum computation with asymmetric Bacon-Shor codes”, Physical Review A 87, (2013) arXiv:1211.1400 DOI
- [9]
- Yoder, Theodore., DSpace@MIT Practical Fault-Tolerant Quantum Computation (2018)
- [10]
- L. Z. Cohen et al., “Low-overhead fault-tolerant quantum computing using long-range connectivity”, Science Advances 8, (2022) arXiv:2110.10794 DOI
- [11]
- Q. Xu et al., “Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays”, (2023) arXiv:2308.08648
- [12]
- S. Bravyi et al., “High-threshold and low-overhead fault-tolerant quantum memory”, (2024) arXiv:2308.07915
- [13]
- T. Tansuwannont and D. Leung, “Achieving Fault Tolerance on Capped Color Codes with Few Ancillas”, PRX Quantum 3, (2022) arXiv:2106.02649 DOI
- [14]
- Q. Xu et al., “Fault-Tolerant Operation of Bosonic Qubits with Discrete-Variable Ancillae”, (2023) arXiv:2310.20578
- [15]
- J. Claes, J. E. Bourassa, and S. Puri, “Tailored cluster states with high threshold under biased noise”, npj Quantum Information 9, (2023) arXiv:2201.10566 DOI
- [16]
- H. Bombin et al., “Self-Correcting Quantum Computers”, (2012) arXiv:0907.5228
- [17]
- B. Pato, T. Tansuwannont, and K. R. Brown, “Concatenated Steane code with single-flag syndrome checks”, (2024) arXiv:2403.09978
- [18]
- A. Kubica et al., “Erasure qubits: Overcoming the \(T_1\) limit in superconducting circuits”, (2022) arXiv:2208.05461
- [19]
- D. A. Spielman, “Linear-time encodable and decodable error-correcting codes”, IEEE Transactions on Information Theory 42, 1723 (1996) DOI
- [20]
- 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
- [21]
- R. Chao and B. W. Reichardt, “Quantum Error Correction with Only Two Extra Qubits”, Physical Review Letters 121, (2018) arXiv:1705.02329 DOI
- [22]
- D. Bhatnagar et al., “Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes”, 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) (2023) arXiv:2305.00784 DOI
- [23]
- S. Paesani and B. J. Brown, “High-Threshold Quantum Computing by Fusing One-Dimensional Cluster States”, Physical Review Letters 131, (2023) arXiv:2212.06775 DOI
- [24]
- N. C. Menicucci, “Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States”, Physical Review Letters 112, (2014) arXiv:1310.7596 DOI
- [25]
- J. E. Bourassa et al., “Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer”, Quantum 5, 392 (2021) arXiv:2010.02905 DOI
- [26]
- D. Gottesman, A. Kitaev, and J. Preskill, “Encoding a qubit in an oscillator”, Physical Review A 64, (2001) arXiv:quant-ph/0008040 DOI
- [27]
- D. Aasen et al., “Fault-Tolerant Hastings-Haah Codes in the Presence of Dead Qubits”, (2023) arXiv:2307.03715
- [28]
- E. M. Rains, “Nonbinary quantum codes”, (1997) arXiv:quant-ph/9703048
- [29]
- T. Jochym-O’Connor, “Fault-tolerant gates via homological product codes”, Quantum 3, 120 (2019) arXiv:1807.09783 DOI
- [30]
- C. Chamberland et al., “Triangular color codes on trivalent graphs with flag qubits”, New Journal of Physics 22, 023019 (2020) arXiv:1911.00355 DOI
- [31]
- S. Bravyi, “Universal quantum computation with theν=5∕2fractional quantum Hall state”, Physical Review A 73, (2006) arXiv:quant-ph/0511178 DOI
- [32]
- B. J. Brown, “A fault-tolerant non-Clifford gate for the surface code in two dimensions”, Science Advances 6, (2020) arXiv:1903.11634 DOI
- [33]
- T. R. Scruby et al., “Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code”, Quantum 6, 721 (2022) arXiv:2012.08536 DOI
- [34]
- S. Huang, T. Jochym-O’Connor, and T. J. Yoder, “Homomorphic Logical Measurements”, (2022) arXiv:2211.03625
- [35]
- D. Litinski and N. Nickerson, “Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections”, (2022) arXiv:2211.15465
- [36]
- H. Bombín et al., “Fault-Tolerant Postselection for Low-Overhead Magic State Preparation”, PRX Quantum 5, (2024) arXiv:2212.00813 DOI
- [37]
- B. Coecke and R. Duncan, “Interacting Quantum Observables”, Automata, Languages and Programming 298 DOI
- [38]
- B. Coecke and R. Duncan, “Interacting quantum observables: categorical algebra and diagrammatics”, New Journal of Physics 13, 043016 (2011) arXiv:0906.4725 DOI
- [39]
- H. Bombin et al., “Unifying flavors of fault tolerance with the ZX calculus”, (2023) arXiv:2303.08829
- [40]
- S. Bravyi et al., “Quantum advantage with noisy shallow circuits”, Nature Physics 16, 1040 (2020) arXiv:1904.01502 DOI
- [41]
- S. H. Choe and R. Koenig, “Long-range data transmission in a fault-tolerant quantum bus architecture”, (2022) arXiv:2209.09774
- [42]
- A. G. Fowler et al., “Surface codes: Towards practical large-scale quantum computation”, Physical Review A 86, (2012) arXiv:1208.0928 DOI
- [43]
- M. McEwen, D. Bacon, and C. Gidney, “Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics”, Quantum 7, 1172 (2023) arXiv:2302.02192 DOI
- [44]
- R. Chao et al., “Optimization of the surface code design for Majorana-based qubits”, Quantum 4, 352 (2020) arXiv:2007.00307 DOI
- [45]
- C. Gidney, “A Pair Measurement Surface Code on Pentagons”, Quantum 7, 1156 (2023) arXiv:2206.12780 DOI
- [46]
- L. Grans-Samuelsson et al., “Improved Pairwise Measurement-Based Surface Code”, (2023) arXiv:2310.12981
- [47]
- J. Nelson et al., “Fault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes”, (2023) arXiv:2311.17985
- [48]
- D. Litinski and F. von Oppen, “Quantum computing with Majorana fermion codes”, Physical Review B 97, (2018) arXiv:1801.08143 DOI
- [49]
- C. McLauchlan and B. Béri, “A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation”, (2023) arXiv:2211.11777
- [50]
- A. L. Grimsmo, J. Combes, and B. Q. Baragiola, “Quantum Computing with Rotation-Symmetric Bosonic Codes”, Physical Review X 10, (2020) arXiv:1901.08071 DOI
- [51]
- R. Kobayashi and G. Zhu, “Fault-tolerant logical gates via constant depth circuits and emergent symmetries on non-orientable topological stabilizer and Floquet codes”, (2023) arXiv:2310.06917
- [52]
- 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
- [53]
- J. Hu, Q. Liang, and R. Calderbank, “Divisible Codes for Quantum Computation”, (2022) arXiv:2204.13176
- [54]
- O. Fawzi, A. Grospellier, and A. Leverrier, “Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes”, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) arXiv:1808.03821 DOI
- [55]
- D. Gottesman, “Fault-Tolerant Quantum Computation with Constant Overhead”, (2014) arXiv:1310.2984
- [56]
- N. Rengaswamy et al., “Entanglement Purification with Quantum LDPC Codes and Iterative Decoding”, Quantum 8, 1233 (2024) arXiv:2210.14143 DOI
- [57]
- A. Goswami, M. Mhalla, and V. Savin, “Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit”, (2023) arXiv:2209.06673
- [58]
- C. Chamberland et al., “Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes”, PRX Quantum 3, (2022) arXiv:2012.04108 DOI
- [59]
- A. M. Steane, “Active Stabilization, Quantum Computation, and Quantum State Synthesis”, Physical Review Letters 78, 2252 (1997) arXiv:quant-ph/9611027 DOI
- [60]
- P.-H. Liou and C.-Y. Lai, “Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three”, Physical Review A 107, (2023) arXiv:2208.00581 DOI
- [61]
- B. Pato et al., “Optimization tools for distance-preserving flag fault-tolerant error correction”, (2024) arXiv:2306.12862
- [62]
- N. Delfosse, B. W. Reichardt, and K. M. Svore, “Beyond Single-Shot Fault-Tolerant Quantum Error Correction”, IEEE Transactions on Information Theory 68, 287 (2022) arXiv:2002.05180 DOI
- [63]
- S. Heußen, D. F. Locher, and M. Müller, “Measurement-free fault-tolerant quantum error correction in near-term devices”, (2023) arXiv:2307.13296
- [64]
- A. Paetznick and B. W. Reichardt, “Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code”, (2013) arXiv:1106.2190
- [65]
- O. Fawzi, A. Müller-Hermes, and A. Shayeghi, “A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation”, (2022) arXiv:2202.00119 DOI
- [66]
- N. Baspin, O. Fawzi, and A. Shayeghi, “A lower bound on the overhead of quantum error correction in low dimensions”, (2023) arXiv:2302.04317
- [67]
- S. H. Choe and R. Koenig, “How to fault-tolerantly realize any quantum circuit with local operations”, (2024) arXiv:2402.13863
- [68]
- D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations”, Nature 402, 390 (1999) arXiv:quant-ph/9908010 DOI
- [69]
- X. Zhou, D. W. Leung, and I. L. Chuang, “Methodology for quantum logic gate construction”, Physical Review A 62, (2000) arXiv:quant-ph/0002039 DOI
- [70]
- 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
- [71]
- P. W. Shor, “Fault-tolerant quantum computation”, (1997) arXiv:quant-ph/9605011
- [72]
- D. P. DiVincenzo and P. W. Shor, “Fault-Tolerant Error Correction with Efficient Quantum Codes”, Physical Review Letters 77, 3260 (1996) arXiv:quant-ph/9605031 DOI
- [73]
- T. Tansuwannont, B. Pato, and K. R. Brown, “Adaptive syndrome measurements for Shor-style error correction”, Quantum 7, 1075 (2023) arXiv:2208.05601 DOI
- [74]
- C. M. Dawson, H. L. Haselgrove, and M. A. Nielsen, “Noise thresholds for optical cluster-state quantum computation”, Physical Review A 73, (2006) arXiv:quant-ph/0601066 DOI
- [75]
- E. Knill, “Quantum computing with realistically noisy devices”, Nature 434, 39 (2005) arXiv:quant-ph/0410199 DOI
- [76]
- E. Knill, “Scalable Quantum Computation in the Presence of Large Detected-Error Rates”, (2004) arXiv:quant-ph/0312190
- [77]
- N. Rengaswamy et al., “Distilling GHZ States using Stabilizer Codes”, (2022) arXiv:2109.06248
- [78]
- B. Anker and M. Marvian, “Flag Gadgets based on Classical Codes”, (2024) arXiv:2212.10738
- [79]
- R. E. Lyons and W. Vanderkulk, “The Use of Triple-Modular Redundancy to Improve Computer Reliability”, IBM Journal of Research and Development 6, 200 (1962) DOI
- [80]
- S. M. Girvin, “Introduction to quantum error correction and fault tolerance”, SciPost Physics Lecture Notes (2023) arXiv:2111.08894 DOI
- [81]
- E. Dennis et al., “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI
- [82]
- Y. Tomita and K. M. Svore, “Low-distance surface codes under realistic quantum noise”, Physical Review A 90, (2014) arXiv:1404.3747 DOI
- [83]
- S. Glancy and E. Knill, “Error analysis for encoding a qubit in an oscillator”, Physical Review A 73, (2006) arXiv:quant-ph/0510107 DOI
- [84]
- A. J. Landahl and C. Ryan-Anderson, “Quantum computing by color-code lattice surgery”, (2014) arXiv:1407.5103
- [85]
- A. J. Landahl, J. T. Anderson, and P. R. Rice, “Fault-tolerant quantum computing with color codes”, (2011) arXiv:1108.5738
- [86]
- D. Banfield and A. Kay, “Implementing Logical Operators using Code Rewiring”, (2023) arXiv:2210.14074
- [87]
- O. Higgott and N. P. Breuckmann, “Subsystem Codes with High Thresholds by Gauge Fixing and Reduced Qubit Overhead”, Physical Review X 11, (2021) arXiv:2010.09626 DOI
- [88]
- T. J. Yoder and I. H. Kim, “The surface code with a twist”, Quantum 1, 2 (2017) arXiv:1612.04795 DOI
- [89]
- 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
- [90]
- Q. Xu et al., “Tailored XZZX codes for biased noise”, (2022) arXiv:2203.16486
- [91]
- 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
- [92]
- J. Guillaud and M. Mirrahimi, “Repetition Cat Qubits for Fault-Tolerant Quantum Computation”, Physical Review X 9, (2019) arXiv:1904.09474 DOI
- [93]
- S. Puri et al., “Bias-preserving gates with stabilized cat qubits”, Science Advances 6, (2020) arXiv:1905.00450 DOI
- [94]
- S. Puri et al., “Stabilized Cat in a Driven Nonlinear Cavity: A Fault-Tolerant Error Syndrome Detector”, Physical Review X 9, (2019) arXiv:1807.09334 DOI
- [95]
- P. Brooks, A. Kitaev, and J. Preskill, “Protected gates for superconducting qubits”, Physical Review A 87, (2013) arXiv:1302.4122 DOI
- [96]
- I. Pogorelov et al., “Experimental fault-tolerant code switching”, (2024) arXiv:2403.13732
- [97]
- R. Chao and B. W. Reichardt, “Fault-tolerant quantum computation with few qubits”, npj Quantum Information 4, (2018) arXiv:1705.05365 DOI
- [98]
- D.-X. Quan et al., “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
- [99]
- H. Yamasaki and M. Koashi, “Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation”, Nature Physics 20, 247 (2024) arXiv:2207.08826 DOI
- [100]
- C. N. Self, M. Benedetti, and D. Amaro, “Protecting expressive circuits with a quantum error detection code”, Nature Physics (2024) arXiv:2211.06703 DOI
- [101]
- D. Gottesman, “Quantum fault tolerance in small experiments”, (2016) arXiv:1610.03507
- [102]
- R. S. Gupta et al., “Encoding a magic state with beyond break-even fidelity”, Nature 625, 259 (2024) arXiv:2305.13581 DOI
- [103]
- S. Yoshida, S. Tamiya, and H. Yamasaki, “Concatenate codes, save qubits”, (2024) arXiv:2402.09606
- [104]
- H. Goto, “Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code”, Scientific Reports 6, (2016) DOI
- [105]
- N. Fazio, R. Harper, and S. Bartlett, “Logical Noise Bias in Magic State Injection”, (2024) arXiv:2401.10982
- [106]
- 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) DOI
- [107]
- J. Haah and M. B. Hastings, “Measurement sequences for magic state distillation”, Quantum 5, 383 (2021) arXiv:2007.07929 DOI