Here is a list of all quantum codes with fault-tolerant gadgets.
Name Fault-tolerant gadget
3D surface code Fault-tolerant Hadamard gate using teleportation and error correction [1].
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 [2].
Abelian topological code Fault-tolerant logical operations can be interpreted as anyon condensation events [3].Modular decoding, designed to overcome the backlog problem, is applicable to fault-tolerant protocols based on topological qubit stabilizer codes [4].
Asymmetric quantum code Fault-tolerant noise-bias-preserving computation scheme [5].Fault-tolerant circuits converting between asymmetric and symmetric subsystem codes [6,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].
Bosonic rotation code Decoder based on measuring in the phase-state basis and using Knill error correction [13] is fault-tolerant under circuit-level noise [14].
Brown-Fawzi random Clifford-circuit code Fault-tolerant state preparation [15].
Capped color code (CCC) Fault-tolerant syndrome extraction and error correction for capped color codes in H form [16].Fault-tolerant T gate implementation [16].
Cat code Universal set of error-corrected operations tolerating a single photon loss and an arbitrary ancilla fault [17].Linear-optical noise suppression and mitigation scheme [18].
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 Photonic architecture [19].Generalized foliation procedures exist for noise-bias preserving MBQC [20].
Color code The 6D color code is a self-correcting quantum memory and admits fault-tolerant universal gate set in 7D [21].
Concatenated Steane code There exist fault-tolerant syndrome extraction protocols for the concatenated Steane code [22].
Concatenated qubit code Fault-tolerant message passing between devices [23].
Dihedral \(G=D_m\) quantum-double code Universal topological quantum computation is possible for certain groups such as \(G=D_3=S_3\) [24,25].\(U\)-model gate set [26], which can protect from circuit-level noise with the help of an anyon interferometer for the case of \(G=S_3\) [27].
Distance-balanced code Single-ancilla syndrome extraction circuits that, for the most part, preserve the effective distance of weight-reduced qLDPC codes [28]. The distance balancing technique of Ref. [29] preserves effective distance [28].
Dual-rail quantum code Dual-rail qubits can be used to convert leakage and AD noise into erasure noise [30,31].
Five-qubit perfect code Pieceable fault-tolerant CZ, CNOT, and CCZ gates [32].Syndrome measurement can be done with two ancillary flag qubits [33]. The depth of syndrome extraction circuits can be lowered by using past syndrome values [34].Fault-tolerant logical one and logical minus state preparation in all-to-all and 2D grid connectivity [35].Inspired by the honeycomb Floquet code, various weight-two measurement schemes have been designed [36].
Floquet color code Fault-tolerant measurement-based computation can be realized using the foliated Floquet color code [37].
Freedman-Meyer-Luo code The Freedman-Meter-Luo code has been generalized to a family with rate of order \(O(1/\sqrt{\log n})\) and minimum distance of order \(\Omega(\sqrt{\log n})\) which supports fault-tolerant non-Clifford gates [38].
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. There is a large family of fault-tolerant protocols [39].
Gottesman-Kitaev-Preskill (GKP) code Logical Clifford operations are given by Gaussian unitaries, which map bounded-size errors to bounded-size errors [40]. For single-mode GKP codes, these operations correspond to non-trivial loops in the space of all single-mode GKP codes (the moduli space of elliptic curves, i.e., the three sphere with a trefoil knot removed) [41]. Such gates provide another example of monodromy under the particular notion of parallel transport introduced in Ref. [42].
Hastings-Haah Floquet code Floquet codes on tri-colorable lattices can be made fault-tolerant in the presence of dead qubits [43,44].
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 [45; 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 [46].
Honeycomb (6.6.6) color code Fault-tolerant syndrome extraction circuits using flag qubits [47,48].
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.
Hybrid cat code Photonic architecture based on concatenation with RBH codes [49].
Hypergraph product (HGP) code Single-ancilla syndrome extraction circuits do not admit hook errors [28].
Kitaev honeycomb code One can distill ancilla states to arbitrary precision for sufficiently small noise rates and assuming perfect Clifford operations [50].
Kitaev surface code Transversal (non-Clifford) CCZ gate by bringing 2D surface codes together and using just-in-time decoding [51,52]. Gate can be simulated by taking 2D slices out of 3D surface codes [53].Flag fault-tolerant syndrome extraction [47].Homomorphic measurement protocols for arbitrary surface codes [54].Non-geometrically local connectivity can reduce overhead cost [55].Magic-state distillation protocols [56–59] leading up to magic-state cultivation [60].Framework of fault tolerance utilizing ZX calculus [61,62] that is applicable to MBQC, FBQC, and conventional computation versions of the surface code [63].Single-shot state preparation [64] and MWPM decoding [65].Syndrome extraction circuits consisting of CNOT gates and ancillary measurements [56]. Measurement schedules can be optimized using spacetime circuit codes to yield what is known as the 3CX surface code [66]. Schedules can also be optimized via ZX calculus [61,62]. Inspired by the honeycomb Floquet code, various weight-two measurement schemes have been designed [67–69], with the scheme in Ref. [68] being a special case of DWR.
Majorana color code Ordinary and twist-based lattice surgery can be made fault tolerant [70] (see also [71]).
Majorana surface code Ordinary and twist-based lattice surgery can be made fault tolerant [70] (see also [71]).
Number-phase code Fault-tolerant computation schemes with number-phase codes have been proposed based on concatenation with Bacon-Shor subsystem codes [13].
Projective-plane surface code Fault-tolerant Hadamard gate [72].
Quantum LDPC (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 [73], e.g., quantum expander codes [74].GHZ state distillation for Steane error correction [75].Fault-tolerant logical measurements that generalize a previous construction [10] and that require an order \(O(d/\beta)\) ancilla qubits, where \(\beta\) is the Cheeger constant of the Tanner subgraph supporting the logical operator to be measured.Fault-tolerant constant-depth encoder and unencoder [76].
Quantum Reed-Muller code Gate switching protocol for universal computation [77].Fault-tolerant universal computation can be achieved via code switching between the \([[127,1,15]]\) self-dual doubly even punctured quantum RM code and the \([[127,1,7]]\) triply even punctured quantum RM code [78].
Quantum data-syndrome (QDS) code Shor error correction [79,80], in which fault tolerance against syndrome extraction errors is ensured by simply repeating syndrome measurements \(\ell\) times, can be recast as a QDS code whose underlying matrix \(A\) is the identity matrix \(I_m\) repeated \(\ell\) times [81].
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 [82]. 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 [74].
Quantum polar code State preparation of a single logical qubit [83].
Quantum repetition code Toffoli magic-state preparation protocol [84].
Quasi-hyperbolic color code There exists a family with rate of order \(O(1/\log n)\) and minimum distance of order \(\Omega(\log n)\) which supports fault-tolerant non-Clifford gates [38]. A construction based on the Torelli mapping yields a code with constant rate with similar gates [38].
Qubit CSS code Steane error correction [85], where fault-tolerance is ensured by preparing ancillary encoded states and extracting syndromes via \(CNOT\) gates.Fault-tolerant error correction and logical measurements using flag qubits for distance-three cyclic CSS codes [86]. Parallel syndrome extraction for distance-three codes can be done fault-tolerantly using one flag qubit [87]. Distance-preserving flag fault-tolerant error correction can be done using lookup tables for small codes [88]. Any self-dual CSS code with bounded-weight stabilizer generators admits flag fault-tolerant syndrome extraction [47].Homomorphic gadgets fault-tolerant measurement unify Steane and Shor error correction [54].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\) [89].Fault-tolerant measurement-free scheme for low-distance CSS codes [90].Automated fault-tolerant encoding circuit synthesis [91].Fault-tolerant homological measurement of logical Pauli operators [92].
Qubit code There are lower bounds on the overhead of fault-tolerant QEC in terms of the capacity of the noise channel [93]. 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 [94].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 [95].Fault-tolerant gates can be done for any code supporting a transversal implementation of Pauli gates using generalized gate teleportation [96].
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 [97,98]. Such protocols can be made fault tolerant with the help of magic-state distillation [99].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 [32].Shor error correction [79,80], in which fault tolerance against syndrome extraction errors is ensured by simply repeating syndrome measurements. A modification uses adaptive measurements [100].Generalization of Steane error correction stabilizer codes [9; Sec. 3.6].Fault-tolerant error correction scheme by Knill (a.k.a. telecorrection [101]), which is based on teleportation [102,103]. A variant of it has been termed the Fibonacci scheme [104].Fault-tolerant error correction using flag qubits for codes satisfying certain conditions [47].GHZ state distillation for Steane error correction [105].Syndrome extraction using flag qubits and classical codes [106].Fault-tolerant constant-depth unencoder transforming logical states into physical states using single-qubit measurements [76].Post-selection based algorithm preparing magic state corresponding to arbitrary rotations [107].Code switching can be done using only transversal gates for qubit stabilizer codes [108].Flag-Proxy Networks (FPNs) [109].A logical Pauli can be gauged out to yield a fault-tolerant measurement that requires a qubit overhead linear in the Pauli's support [110].
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 [56,111,112].
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 [40].Error correction scheme is fault-tolerant to displacement noise as long as all input states have displacement errors less than \(\sqrt{\pi}/6\) [113].
Square-octagon (4.8.8) color code Color-code lattice surgery [114].Fault-tolerant syndrome extraction circuits [115].
Subsystem qubit stabilizer code Logical Clifford gates can be implemented fault-tolerantly for subsystem codes of distance at least three [116].
Subsystem spacetime circuit code Fault-tolerant measurement gadget that is a modification based on the DiVincenzo-Shor cat-state method [79,80].
Subsystem surface code Gauge fixing and changing the order in which check operators are measured yields a fault-tolerant decoder [117].
Surface-17 code Measurement-free fault-tolerant logical zero state preparation in nearest-neighbor qubit connectivity [118].Fault-tolerant logical zero and logical plus state preparation in all-to-all and 2D grid connectivity with flag qubits [35].
Tetrahedral color code Fault-tolerant quantum computation designed for a 2D architecture [119].
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 [120].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 [120].Making syndrome extraction fault tolerant requires a specific ordering of syndrome measurements so as to avoid hook errors [120].
Triorthogonal code Universal fault-tolerant gates can be performed without magic-state distillation [116,121].
Twist-defect surface code Fault-tolerant measurement of defects [122].Twisted double covers of codes yield fault-tolerant Clifford gates performed via Dehn twists [123].
Twisted XZZX toric code Fault-tolerant syndrome extraction circuits using flag qubits [124].
Two-component cat code Fault-tolerant error-correction procedure using small amplitude coherent states [125].Bias-preserving Hamiltonian-based CNOT gate is part of a universal noise-bias-preserving gate set that can be made fault tolerant using concatenation [126,127].Ancilla qubits encoded in two-component cat codes yield fault-tolerant syndrome extraction circuits [128].
Zero-pi qubit code One- and two-qubit phase gate errors can be suppressed [129].
\([[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 [130].
\([[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 [131].
\([[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 [77,116,121,132].Fault-tolerant logical zero and logical plus state preparation [35].
\([[16,6,4]]\) Tesseract color code Post-selected fault-tolerant syndrome extraction [133,134].
\([[23, 1, 7]]\) Quantum Golay code Fault-tolerant depth-7 circuit consisting of 57 CNOT gates and preparing a logical-zero state [135].
\([[2^r-1, 2^r-2r-1, 3]]\) quantum Hamming code Syndrome measurement can be done with two ancillary flag qubits [33].Concatenations of quantum Hamming codes with the \([[4,2,2]]\) and \(C_6\) codes yield fault-tolerant quantum computation with constant space and quasi-polylogarithmic time overheads [136].
\([[2^r-1,1,3]]\) simplex code Fault-tolerant syndrome extraction circuits using flag qubits [47].
\([[2m,2m-2,2]]\) error-detecting code Logical SWAP gates can be performed fault tolerantly using an ancilla qubit [137; Sec. VII].Two-qubit fault-tolerant state preparation, error detection and projective measurements [33] (see also [138]).CNOT and Hadamard gates using only two extra qubits and four-qubit fault-tolerant CCZ gate [131].Fault-tolerant Clifford Trotter circuits using flag qubits [139].Weak fault tolerance: any single gate error can be detected by measuring stabilizers and utilizing extra ancillas [140].
\([[4,2,2]]\) Four-qubit 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 [141]. Magic states can be injected into surface and color codes since the code is a small instance of both [142].Concatenations of \([[4,2,2]]\) and \(C_6\) codes yield fault-tolerant quantum computation schemes [102] (see also Ref. [143]).Concatenations of quantum Hamming codes with the \([[4,2,2]]\) and \(C_6\) codes yield fault-tolerant quantum computation with constant space and quasi-polylogarithmic time overheads [136,144].Fault-tolerant implementation of the Deutsch-Josza algorithm [145].
\([[5,1,2]]\) rotated surface code Fault-tolerant implementation of the Clifford group based on transversal gates and SWAPs [146].
\([[6,2,2]]\) \(C_6\) code Concatenations of \([[4,2,2]]\) and \(C_6\) codes yield fault-tolerant quantum computation schemes [102] (see also Ref. [143]).Concatenations of quantum Hamming codes with the \([[4,2,2]]\) and \(C_6\) codes yield fault-tolerant quantum computation with constant space and quasi-polylogarithmic time overheads [136,144].
\([[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 [77,116,121,132].A fault-tolerant universal gate set can be done via code switching between the Steane code and the \([[10,1,2]]\) code [130].Fault-tolerant logical zero and magic state preparation [147]. Magic-state preparation converts unbiased noise into biased noise [148].Fault-tolerant logical zero and logical plus state preparation on all-to-all and 2D grid qubit connectivity [35].Pieceable fault-tolerant CCZ gate [32].Syndrome measurement can be done with ancillary flag qubits [33,120] or with no extra qubits [149]. The depth of syndrome extraction circuits can be lowered by using past syndrome values [34].
\([[8,3,2]]\) CSS code CCZ gate can be distilled in a fault-tolerant manner [150].
\([[9,1,3]]\) Shor code Fault-tolerant logical zero and logical plus state preparation [35].

References

[1]
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
[2]
A. Bauer, “Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases”, (2024) arXiv:2403.12119
[3]
M. S. Kesselring, J. C. Magdalena de la Fuente, F. Thomsen, J. Eisert, S. D. Bartlett, and B. J. Brown, “Anyon Condensation and the Color Code”, PRX Quantum 5, (2024) arXiv:2212.00042 DOI
[4]
H. Bombín, C. Dawson, Y.-H. Liu, N. Nickerson, F. Pastawski, and S. Roberts, “Modular decoding: parallelizable real-time decoding for quantum computers”, (2023) arXiv:2303.04846
[5]
P. Aliferis, F. Brito, D. P. DiVincenzo, J. Preskill, M. Steffen, and B. M. Terhal, “Fault-tolerant computing with biased-noise superconducting qubits: a case study”, New Journal of Physics 11, 013061 (2009) arXiv:0806.0383 DOI
[6]
A. M. Stephens, Z. W. E. Evans, S. J. Devitt, and L. C. L. Hollenberg, “Asymmetric quantum error correction via code conversion”, Physical Review A 77, (2008) arXiv:0708.3969 DOI
[7]
Z. W. E. Evans, A. M. Stephens, J. H. Cole, and L. C. L. Hollenberg, “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, I. H. Kim, S. D. Bartlett, and B. J. Brown, “Low-overhead fault-tolerant quantum computing using long-range connectivity”, Science Advances 8, (2022) arXiv:2110.10794 DOI
[11]
Q. Xu, J. P. B. Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasic, M. D. Lukin, L. Jiang, and H. Zhou, “Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays”, (2023) arXiv:2308.08648
[12]
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, “High-threshold and low-overhead fault-tolerant quantum memory”, Nature 627, 778 (2024) arXiv:2308.07915 DOI
[13]
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
[14]
L. D. H. My, S. Qin, and H. K. Ng, “Circuit-level fault tolerance of cat codes”, (2024) arXiv:2406.04157
[15]
J. Nelson, G. Bentsen, S. T. Flammia, and M. J. Gullans, “Fault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes”, (2023) arXiv:2311.17985
[16]
T. Tansuwannont and D. Leung, “Achieving Fault Tolerance on Capped Color Codes with Few Ancillas”, PRX Quantum 3, (2022) arXiv:2106.02649 DOI
[17]
Q. Xu, P. Zeng, D. Xu, and L. Jiang, “Fault-Tolerant Operation of Bosonic Qubits with Discrete-Variable Ancillae”, (2023) arXiv:2310.20578
[18]
Y. S. Teo, S. U. Shringarpure, S. Cho, and H. Jeong, “Linear-optical protocols for mitigating and suppressing noise in bosonic systems”, (2024) arXiv:2411.11313
[19]
S. J. Devitt, A. G. Fowler, A. M. Stephens, A. D. Greentree, L. C. L. Hollenberg, W. J. Munro, and K. Nemoto, “Architectural design for a topological cluster state quantum computer”, New Journal of Physics 11, 083032 (2009) arXiv:0808.1782 DOI
[20]
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
[21]
H. Bombin, R. W. Chhajlany, M. Horodecki, and M. A. Martin-Delgado, “Self-Correcting Quantum Computers”, (2012) arXiv:0907.5228
[22]
B. Pato, T. Tansuwannont, and K. R. Brown, “Concatenated Steane code with single-flag syndrome checks”, Physical Review A 110, (2024) arXiv:2403.09978 DOI
[23]
M. Christandl, O. Fawzi, and A. Goswami, “Fault-tolerant quantum input/output”, (2024) arXiv:2408.05260
[24]
C. Mochon, “Anyon computers with smaller groups”, Physical Review A 69, (2004) arXiv:quant-ph/0306063 DOI
[25]
G. K. Brennen, M. Aguado, and J. I. Cirac, “Simulations of quantum double models”, New Journal of Physics 11, 053009 (2009) arXiv:0901.1345 DOI
[26]
S. X. Cui, S.-M. Hong, and Z. Wang, “Universal quantum computation with weakly integral anyons”, Quantum Information Processing 14, 2687 (2015) arXiv:1401.7096 DOI
[27]
L. Chen, Y. Ren, R. Fan, and A. Jaffe, “A Universal Circuit Set Using the \(S_3\) Quantum Double”, (2024) arXiv:2411.09697
[28]
S. J. S. Tan and L. Stambler, “Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes”, (2024) arXiv:2409.02193
[29]
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the \(\sqrt{n}\) distance barrier using high dimensional expanders”, (2020) arXiv:2004.07935
[30]
A. S. Fletcher, P. W. Shor, and M. Z. Win, “Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel”, (2007) arXiv:0710.1052
[31]
A. Kubica, A. Haim, Y. Vaknin, H. Levine, F. Brandão, and A. Retzker, “Erasure Qubits: Overcoming the T1 Limit in Superconducting Circuits”, Physical Review X 13, (2023) arXiv:2208.05461 DOI
[32]
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
[33]
R. Chao and B. W. Reichardt, “Quantum Error Correction with Only Two Extra Qubits”, Physical Review Letters 121, (2018) arXiv:1705.02329 DOI
[34]
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) (2023) arXiv:2305.00784 DOI
[35]
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”, (2024) arXiv:2402.17761
[36]
L. Grans-Samuelsson, D. Aasen, and P. Bonderson, “A fault-tolerant pairwise measurement-based code on eight qubits”, (2024) arXiv:2409.13681
[37]
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
[38]
G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown, “Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries”, (2024) arXiv:2310.16982
[39]
H. Bombin, C. Dawson, T. Farrelly, Y. Liu, N. Nickerson, M. Pant, F. Pastawski, and S. Roberts, “Fault-tolerant complexes”, (2023) arXiv:2308.07844
[40]
D. Gottesman, A. Kitaev, and J. Preskill, “Encoding a qubit in an oscillator”, Physical Review A 64, (2001) arXiv:quant-ph/0008040 DOI
[41]
J. Conrad, A. G. Burchards, and S. T. Flammia, “Lattices, Gates, and Curves: GKP codes as a Rosetta stone”, (2024) arXiv:2407.03270
[42]
D. Gottesman and L. L. Zhang, “Fibre bundle framework for unitary quantum fault tolerance”, (2017) arXiv:1309.7062
[43]
D. Aasen, J. Haah, P. Bonderson, Z. Wang, and M. Hastings, “Fault-Tolerant Hastings-Haah Codes in the Presence of Dead Qubits”, (2023) arXiv:2307.03715
[44]
C. McLauchlan, G. P. Gehér, and A. E. Moylett, “Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements”, (2024) arXiv:2405.15854
[45]
E. M. Rains, “Nonbinary quantum codes”, (1997) arXiv:quant-ph/9703048
[46]
T. Jochym-O’Connor, “Fault-tolerant gates via homological product codes”, Quantum 3, 120 (2019) arXiv:1807.09783 DOI
[47]
C. Chamberland and M. E. Beverland, “Flag fault-tolerant error correction with arbitrary distance codes”, Quantum 2, 53 (2018) arXiv:1708.02246 DOI
[48]
C. Chamberland, A. Kubica, T. J. Yoder, and G. Zhu, “Triangular color codes on trivalent graphs with flag qubits”, New Journal of Physics 22, 023019 (2020) arXiv:1911.00355 DOI
[49]
J. Lee, N. Kang, S.-H. Lee, H. Jeong, L. Jiang, and S.-W. Lee, “Fault-tolerant quantum computation by hybrid qubits with bosonic cat-code and single photons”, (2023) arXiv:2401.00450
[50]
S. Bravyi, “Universal quantum computation with theν=5∕2fractional quantum Hall state”, Physical Review A 73, (2006) arXiv:quant-ph/0511178 DOI
[51]
B. J. Brown, “A fault-tolerant non-Clifford gate for the surface code in two dimensions”, Science Advances 6, (2020) arXiv:1903.11634 DOI
[52]
T. R. Scruby and Z. Cai, “Fault-tolerant Quantum Computation without Distillation on a 2D Device”, (2024) arXiv:2412.12529
[53]
T. R. Scruby, D. E. Browne, P. Webster, and M. Vasmer, “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
[54]
S. Huang, T. Jochym-O’Connor, and T. J. Yoder, “Homomorphic Logical Measurements”, (2022) arXiv:2211.03625
[55]
D. Litinski and N. Nickerson, “Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections”, (2022) arXiv:2211.15465
[56]
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation”, Physical Review A 86, (2012) arXiv:1208.0928 DOI
[57]
A. G. Fowler and S. J. Devitt, “A bridge to lower overhead quantum computation”, (2013) arXiv:1209.0510
[58]
H. Bombín, M. Pant, S. Roberts, and K. I. Seetharam, “Fault-Tolerant Postselection for Low-Overhead Magic State Preparation”, PRX Quantum 5, (2024) arXiv:2212.00813 DOI
[59]
T. Itogawa, Y. Takada, Y. Hirano, and K. Fujii, “Even more efficient magic state distillation by zero-level distillation”, (2024) arXiv:2403.03991
[60]
C. Gidney, N. Shutty, and C. Jones, “Magic state cultivation: growing T states as cheap as CNOT gates”, (2024) arXiv:2409.17595
[61]
B. Coecke and R. Duncan, “Interacting Quantum Observables”, Automata, Languages and Programming 298 DOI
[62]
B. Coecke and R. Duncan, “Interacting quantum observables: categorical algebra and diagrammatics”, New Journal of Physics 13, 043016 (2011) arXiv:0906.4725 DOI
[63]
H. Bombin, D. Litinski, N. Nickerson, F. Pastawski, and S. Roberts, “Unifying flavors of fault tolerance with the ZX calculus”, Quantum 8, 1379 (2024) arXiv:2303.08829 DOI
[64]
S. Bravyi, D. Gosset, R. König, and M. Tomamichel, “Quantum advantage with noisy shallow circuits”, Nature Physics 16, 1040 (2020) arXiv:1904.01502 DOI
[65]
S. H. Choe and R. Koenig, “Long-range data transmission in a fault-tolerant quantum bus architecture”, (2022) arXiv:2209.09774
[66]
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
[67]
R. Chao, M. E. Beverland, N. Delfosse, and J. Haah, “Optimization of the surface code design for Majorana-based qubits”, Quantum 4, 352 (2020) arXiv:2007.00307 DOI
[68]
C. Gidney, “A Pair Measurement Surface Code on Pentagons”, Quantum 7, 1156 (2023) arXiv:2206.12780 DOI
[69]
L. Grans-Samuelsson, R. V. Mishmash, D. Aasen, C. Knapp, B. Bauer, B. Lackey, M. P. da Silva, and P. Bonderson, “Improved Pairwise Measurement-Based Surface Code”, Quantum 8, 1429 (2024) arXiv:2310.12981 DOI
[70]
D. Litinski and F. von Oppen, “Quantum computing with Majorana fermion codes”, Physical Review B 97, (2018) arXiv:1801.08143 DOI
[71]
C. McLauchlan and B. Béri, “A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation”, Quantum 8, 1400 (2024) arXiv:2211.11777 DOI
[72]
R. Kobayashi and G. Zhu, “Cross-Cap Defects and Fault-Tolerant Logical Gates in the Surface Code and the Honeycomb Floquet Code”, PRX Quantum 5, (2024) arXiv:2310.06917 DOI
[73]
D. Gottesman, “Fault-Tolerant Quantum Computation with Constant Overhead”, (2014) arXiv:1310.2984
[74]
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) 743 (2018) arXiv:1808.03821 DOI
[75]
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
[76]
Y. Shi, A. Patil, and S. Guha, “Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoder”, (2024) arXiv:2408.06299
[77]
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
[78]
A. Gong and J. M. Renes, “Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays”, (2024) arXiv:2410.23263
[79]
P. W. Shor, “Fault-tolerant quantum computation”, (1997) arXiv:quant-ph/9605011
[80]
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
[81]
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
[82]
J. Hu, Q. Liang, and R. Calderbank, “Divisible Codes for Quantum Computation”, (2022) arXiv:2204.13176
[83]
A. Goswami, M. Mhalla, and V. Savin, “Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit”, (2023) arXiv:2209.06673
[84]
C. Chamberland et al., “Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes”, PRX Quantum 3, (2022) arXiv:2012.04108 DOI
[85]
A. M. Steane, “Active Stabilization, Quantum Computation, and Quantum State Synthesis”, Physical Review Letters 78, 2252 (1997) arXiv:quant-ph/9611027 DOI
[86]
T. Tansuwannont, C. Chamberland, and D. Leung, “Flag fault-tolerant error correction, measurement, and quantum computation for cyclic Calderbank-Shor-Steane codes”, Physical Review A 101, (2020) arXiv:1803.09758 DOI
[87]
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
[88]
B. Pato, T. Tansuwannont, S. Huang, and K. R. Brown, “Optimization Tools for Distance-Preserving Flag Fault-Tolerant Error Correction”, PRX Quantum 5, (2024) arXiv:2306.12862 DOI
[89]
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
[90]
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
[91]
T. Peham, L. Schmid, L. Berent, M. Müller, and R. Wille, “Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes”, (2024) arXiv:2408.11894
[92]
B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, “Fault-tolerant logical measurements via homological measurement”, (2024) arXiv:2410.02753
[93]
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
[94]
N. Baspin, O. Fawzi, and A. Shayeghi, “A lower bound on the overhead of quantum error correction in low dimensions”, (2023) arXiv:2302.04317
[95]
S. H. Choe and R. Koenig, “How to fault-tolerantly realize any quantum circuit with local operations”, (2024) arXiv:2402.13863
[96]
E. Kubischta and I. Teixeira, “Flexible Fault Tolerant Gate Gadgets”, (2024) arXiv:2409.11616
[97]
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
[98]
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
[99]
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
[100]
T. Tansuwannont, B. Pato, and K. R. Brown, “Adaptive syndrome measurements for Shor-style error correction”, Quantum 7, 1075 (2023) arXiv:2208.05601 DOI
[101]
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
[102]
E. Knill, “Quantum computing with realistically noisy devices”, Nature 434, 39 (2005) arXiv:quant-ph/0410199 DOI
[103]
E. Knill, “Scalable Quantum Computation in the Presence of Large Detected-Error Rates”, (2004) arXiv:quant-ph/0312190
[104]
P. Aliferis and J. Preskill, “Fibonacci scheme for fault-tolerant quantum computation”, Physical Review A 79, (2009) arXiv:0809.5063 DOI
[105]
N. Rengaswamy, A. Raina, N. Raveendran, and B. Vasić, “Distilling GHZ States using Stabilizer Codes”, (2022) arXiv:2109.06248
[106]
B. Anker and M. Marvian, “Flag Gadgets based on Classical Codes”, (2024) arXiv:2212.10738
[107]
H. Choi, F. T. Chong, D. Englund, and Y. Ding, “Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations”, (2023) arXiv:2303.17380
[108]
S. Heußen and J. Hilder, “Efficient fault-tolerant code switching via one-way transversal CNOT gates”, (2024) arXiv:2409.13465
[109]
S. Vittal, A. Javadi-Abhari, A. W. Cross, L. S. Bishop, and M. Qureshi, “Flag Proxy Networks: Tackling the Architectural, Scheduling, and Decoding Obstacles of Quantum LDPC codes”, (2024) arXiv:2409.14283
[110]
D. J. Williamson and T. J. Yoder, “Low-overhead fault-tolerant quantum computation by gauging logical operators”, (2024) arXiv:2410.02213
[111]
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI
[112]
Y. Tomita and K. M. Svore, “Low-distance surface codes under realistic quantum noise”, Physical Review A 90, (2014) arXiv:1404.3747 DOI
[113]
S. Glancy and E. Knill, “Error analysis for encoding a qubit in an oscillator”, Physical Review A 73, (2006) arXiv:quant-ph/0510107 DOI
[114]
A. J. Landahl and C. Ryan-Anderson, “Quantum computing by color-code lattice surgery”, (2014) arXiv:1407.5103
[115]
A. J. Landahl, J. T. Anderson, and P. R. Rice, “Fault-tolerant quantum computing with color codes”, (2011) arXiv:1108.5738
[116]
D. Banfield and A. Kay, “Implementing Logical Operators using Code Rewiring”, (2023) arXiv:2210.14074
[117]
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
[118]
H. Goto, Y. Ho, and T. Kanao, “Measurement-free fault-tolerant logical-zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array”, Physical Review Research 5, (2023) arXiv:2303.17211 DOI
[119]
H. Bombin, “2D quantum computation with 3D topological codes”, (2018) arXiv:1810.09571
[120]
T. J. Yoder and I. H. Kim, “The surface code with a twist”, Quantum 1, 2 (2017) arXiv:1612.04795 DOI
[121]
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
[122]
M. B. Hastings and A. Geller, “Reduced Space-Time and Time Costs Using Dislocation Codes and Arbitrary Ancillas”, (2015) arXiv:1408.3379
[123]
S. Burton, E. Durso-Sabina, and N. C. Brown, “Genons, Double Covers and Fault-tolerant Clifford Gates”, (2024) arXiv:2406.09951
[124]
Q. Xu, N. Mannucci, A. Seif, A. Kubica, S. T. Flammia, and L. Jiang, “Tailored XZZX codes for biased noise”, (2022) arXiv:2203.16486
[125]
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
[126]
J. Guillaud and M. Mirrahimi, “Repetition Cat Qubits for Fault-Tolerant Quantum Computation”, Physical Review X 9, (2019) arXiv:1904.09474 DOI
[127]
S. Puri et al., “Bias-preserving gates with stabilized cat qubits”, Science Advances 6, (2020) arXiv:1905.00450 DOI
[128]
S. Puri, A. Grimm, P. Campagne-Ibarcq, A. Eickbusch, K. Noh, G. Roberts, L. Jiang, M. Mirrahimi, M. H. Devoret, and S. M. Girvin, “Stabilized Cat in a Driven Nonlinear Cavity: A Fault-Tolerant Error Syndrome Detector”, Physical Review X 9, (2019) arXiv:1807.09334 DOI
[129]
P. Brooks, A. Kitaev, and J. Preskill, “Protected gates for superconducting qubits”, Physical Review A 87, (2013) arXiv:1302.4122 DOI
[130]
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
[131]
R. Chao and B. W. Reichardt, “Fault-tolerant quantum computation with few qubits”, npj Quantum Information 4, (2018) arXiv:1705.05365 DOI
[132]
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
[133]
N. Delfosse and B. W. Reichardt, “Short Shor-style syndrome sequences”, (2020) arXiv:2008.05051
[134]
P. Prabhu and B. W. Reichardt, “Distance-four quantum codes with combined postselection and error correction”, Physical Review A 110, (2024) arXiv:2112.03785 DOI
[135]
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
[136]
H. Yamasaki and M. Koashi, “Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation”, Nature Physics 20, 247 (2024) arXiv:2207.08826 DOI
[137]
D. Gottesman, “Theory of fault-tolerant quantum computation”, Physical Review A 57, 127 (1998) arXiv:quant-ph/9702029 DOI
[138]
C. N. Self, M. Benedetti, and D. Amaro, “Protecting expressive circuits with a quantum error detection code”, Nature Physics 20, 219 (2024) arXiv:2211.06703 DOI
[139]
Z. Chen and N. Rengaswamy, “Tailoring Fault-Tolerance to Quantum Algorithms”, (2024) arXiv:2404.11953
[140]
C. Gerhard and T. A. Brun, “Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code”, (2024) arXiv:2408.14828
[141]
D. Gottesman, “Quantum fault tolerance in small experiments”, (2016) arXiv:1610.03507
[142]
R. S. Gupta et al., “Encoding a magic state with beyond break-even fidelity”, Nature 625, 259 (2024) arXiv:2305.13581 DOI
[143]
J. Cho, “Fault-tolerant linear optics quantum computation by error-detecting quantum state transfer”, Physical Review A 76, (2007) arXiv:quant-ph/0612073 DOI
[144]
S. Yoshida, S. Tamiya, and H. Yamasaki, “Concatenate codes, save qubits”, (2024) arXiv:2402.09606
[145]
D. Singh and S. Prakash, “Fault-Tolerant Implementation of the Deutsch-Jozsa Algorithm”, (2024) arXiv:2412.04791
[146]
M. Vasmer and A. Kubica, “Morphing Quantum Codes”, PRX Quantum 3, (2022) arXiv:2112.01446 DOI
[147]
H. Goto, “Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code”, Scientific Reports 6, (2016) DOI
[148]
N. Fazio, R. Harper, and S. Bartlett, “Logical Noise Bias in Magic State Injection”, (2024) arXiv:2401.10982
[149]
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
[150]
J. Haah and M. B. Hastings, “Measurement sequences for magic state distillation”, Quantum 5, 383 (2021) arXiv:2007.07929 DOI