Here is a list of quantum codes that have notable decoders.

[Jump to code graph excerpt]

Name Decoder(s)
2D color code Projection decoder of \(O(n^4)\) complexity [1], modified to account for syndrome errors [2].Exact minimum-weight decoding is \(NP\)-hard for 2D color codes, including for solely Pauli-\(Z\) noise [3,4].Chromöbius, an open-source implementation of the Möbius decoder, works for many 2D color codes [5].Concatenated MWPM decoder [6].Syndrome extraction circuits based on superdense coding and a middle-out strategy [5].
2D hyperbolic surface code Due to the symmetries of hyperbolic surface codes, optimal measurement schedules of the stabilizers can be found [7].Two flag-based decoders [8].
2D lattice stabilizer code Renormalization group (RG) decoder [9].Tensor-network based decoder for 2D codes subject to correlated noise [10].Standard stabilizer-based error correction can be performed even in the presence of perturbations to the codespace [11–13]; see also Refs. [14–16].Real-time geometrically local decoder based on introducing an ancillary buffer and confining spacetime interactions between anyons [17].Layer-decoupling and cell-matching decoders for topological translation-invariant qubit CSS codes match defects on several toric codes and correct errors up to a constant fraction of the distance [18; Secs. IV and V].
2D subsystem color code For the Union-Jack/square-octagon member, decoding can be reduced to correcting \(Z\) errors using stabilizers of the topological color code [19; Sec. 4.1].
3D color code Decoder that projects the 3D color code onto a collection of 3D surface codes, decoding bit-flip errors on one surface code per color and phase-flip errors on one surface code per pair of colors [20].3D concatenated MWPM decoder for codes with boundaries [21], a 3D extension of the concatenated MWPM decoder for 2D color codes [6]. It decodes \(X\) errors from face syndromes merged into cell syndromes, which reduces the effective \(X\) distance to the \(Z\) distance [21].
3D surface code Flip decoder and its modification p-flip [22].Tensor-network decoder [23].Local decoder based on Toom’s rule for bit-flip errors and MWPM decoder for phase-flip errors in the 3D toric code, with extensions to welded surface codes [24].Generalization of linear-time ML erasure decoder [25] to 3D surface codes [24].Equivariant machine learning decoder [26].
Abelian LP code Ensemble BP decoder mitigating the influence of short cycles of length 4 [27].Efficient decoder correcting order \(\Theta(n/\log n)\) errors [28].
Abelian quantum-double stabilizer code Efficient decoder correcting below the code distance [29].
Amplitude-damping CWS code Because the resulting codes are of CWS type, decoding circuits can be obtained from the underlying CWS construction [30].
Analog stabilizer code Homodyne measurement of nullifiers yields real-valued syndromes, and recovery can be performed by displacements conditional on the syndromes.
Approximate quantum error-correcting code (AQECC) Given an encoding and a noise channel, a decoder that yields the optimal entanglement fidelity can be obtained by solving a semi-definite program [31–35]. This optimal decoder is robust to unexpected variations in the noise channel [36].The decoupling approach a.k.a. the Uhlmann decoder [37–39].Quantum machine-learning based decoders such as quantum convolutional neural networks [40] and quantum autoencoders [41].The Leung recovery map [42] for a noise channel whose Kraus operators \(E_j\) yield a diagonal QEC matrix, \(c_{ij}\propto\delta_{ij}\), has Kraus operators \(\Pi V_j^{\dagger}\), where \(\Pi\) is the codespace projection, and where \(V_j\) is the unitary from the polar decomposition of \(E_j \Pi\). This is the recovery used in the proof of the Knill-Laflamme conditions [43; Thm. 10.1].A near-optimal recovery channel can be constructed from a saddle point in the complementary-channel optimization, achieving recovery error \(d(\widetilde{\mathcal{D}}\mathcal{E},\mathcal{M})\leq d(\mathcal{E}^C,\mathcal{E}^C\mathcal{M}^C)\) whenever \(\mathcal{M}^C\) is a projection [44].The Cafaro recovery map [45] can be obtained for noise Kraus operators if there exists a basis of error words with respect to which the uncorrectable piece in the Knill-Laflamme conditions is diagonal; see Ref. [46]. The map recovers information perfectly for strictly correctable noise.The Petz recovery map a.k.a. the transpose map [47–49], a quantum channel determined by the codespace and noise channel, yields an infidelity of recovery that is at most twice away from the infidelity of the best possible recovery [50]. The fidelity can be expressed exactly as a function of the Knill-Laflamme conditions [51; Thm. 1], and it can be used to derive a generalization of the Knill-Laflamme conditions for approximate QECCs [52,53]. Satisfaction of the Knill-Laflamme conditions is sufficient but not necessary for the Petz recovery map to be the optimal recovery, and a necessary and sufficient condition has been derived [54]. The infidelity of a modified Petz recovery map under erasure can be bounded using the conditional mutual information via the approximate Petz theorem [55–57]. In the case of topological codes, the Petz infidelity is related to the topological entanglement entropy [58]. Modifications include the Petz-like decoder [59], the temporal Petz recovery map for dynamical codes [60], and a syndrome-based Petz recovery [61]. The Petz map is related to quantum Bayes’ rule [62].The Yoshida-Kitaev decoder for the Hayden-Preskill protocol [63] can be extended to general QECCs [59].If parts of the Knill-Laflamme conditions are violated, a deterministic recovery operation is not possible. However, a probabilistic recovery and a modified version of the conditions can still be constructed [64].
Approximate secret-sharing code Decoding is analogous to reconstruction in a secret sharing scheme and is done in polynomial time. The only required operations are verification of quantum authentication, which is a pair of polynomial-time quantum algorithms that check if the fidelity of the received state is close to 1, and erasure correction for a stabilizer code, which involves solving a system of linear equations.
Asymmetric quantum code (AQC) Measurement-free error correction has been optimized for biased noise [65].
BPSK c-q modulation format Linear-optical quantum receiver [66].Kennedy receiver [67,68].Photon-number resolving detector [69–71].Non-Gaussian near-optimal receiver [68].Multi-stage quantum receiver [72].Quantum receiver attaining the Helstrom bound in the low-photon regime [73].Green machine receiver [74].
Bacon-Shor code Majority-voting decoder [75].Steane error correction can outperform Shor error correction for this code [76,77].Utilizing the mapping of the effect of the noise to a statistical mechanical model [78,79] yields several copies of the 1D Ising model [80; Sec. V.B].While check operators are few-body, stabilizer weights scale with the number of qubits, and stabilizer expectation values are obtained by taking products of gauge-operator expectation values. It is thus not clear how to extract stabilizer values in a fault-tolerant manner [81,82]. Stabilizers can instead be measured directly and fault tolerantly with a single bare ancilla, using circuits that follow the pattern of the gauge operators [83].Autonomous QEC [84].
Balanced product (BP) code BP-OSD decoder [85].
Barbell quantum code Relay-BP decoder [86] applied to detector error models constructed with Stim [87]. The \(X\)- and \(Z\)-type errors are decoded separately.
Binary quantum Goppa code Farran’s decoder can be used for the underlying AG construction; under the bound \(2\,\mathrm{wt}(e)+1 \leq n-\lfloor \deg G/2 \rfloor\), the relevant minimum-weight error can be recovered in \(O(n^{2.81})\) time [88,89].
Binomial code Photon loss and dephasing errors can be detected by measuring the phase-space rotation \(\exp\left(2\pi\mathrm{i} \hat{n} / (S+1)\right)\) and the check operator \((J_x/J)^2\) in the spin-coherent state language, where \(J\) is the total angular momentum and \(J_x\) is the angular momentum in the \(x\) direction [90]. This type of error correction fails for errors that are products of photon loss/gain and dephasing errors. However, for certain \((N,S)\) instances of the binomial code, detection of these types of errors can be done.Recovery can be done via projective measurements and unitary operations in a version of the Cafaro recovery map [90,91].Fault-tolerant scheme that converts the required POVM into binary measurements whose redundancy is guaranteed by a classical code [92].
Bivariate bicycle (BB) code BP-OSD decoder [85] has been extended [93] to account for measurement errors (i.e., the circuit-based noise model [94]).Decoding under circuit-level noise has been studied for the BP, BP+OSD, and AutDEC decoders [95].Transformer-based neural-network decoder [96].Matching decoder [97].Small-size and intermediate-size matching decoders adapt the cell-matching decoder for 2D lattice stabilizer codes to BB codes [18; Sec. VI].
Bosonic quantum Fourier code The code is stabilized by the two-mode parity operator and annihilated by the operators \(\hat{a}_1^4 - \alpha^4\) and \(\hat{a}_1^2 \hat{a}_2^2 + \alpha^4\) [98].
Bosonic rotation code For qubit rotation codes, one can distinguish the computational-basis codewords destructively by performing a Fock-state number measurement. If a Fock state \(|n\rangle\) is measured, then one rounds to the nearest multiple of \(N\) and infers the logical value from the parity of that multiple [99].One can distinguish states in the dual basis by performing phase estimation on \(\mathrm{e}^{\mathrm{i} \theta \hat n}\). One then rounds the resulting \(\theta\) to the nearest number \(2\pi j / qN\) in order to determine which dual basis state \(j \in \mathbb Z_q\) it came from [99].Autonomous QEC for \(S=1\) codes [100].Decoder [99] based on measuring in the phase-state basis and using Knill error correction (a.k.a. telecorrection [101]), which is based on teleportation [102,103].Performance under non-Markovian noise has been investigated [104].
Branching MERA code Decoding can be formulated as tensor-network contraction and supports successive-cancellation-style decoding inherited from branching-MERA constructions [105,106].A symmetric decoder that jointly uses \(x\)- and \(z\)-error information remains efficiently contractible and improves finite-size performance over standard quantum polar decoding [106].
Brickwork \(XS\) stabilizer code Just-in-time decoder [107].
Camara-Ollivier-Tillich code Iterative error estimation based on the MIN-SUM and SUM-PRODUCT algorithms [108].
Campbell double homological product code The minimum-weight decoder optimizes the recovery operation \( E_{rec} \) to minimize the residual error \( E_{rec} \cdot E \) given a noisy syndrome \( s = \sigma(E) + u \). The decoder’s performance is intrinsically tied to the code’s soundness: when the code is \((t, f)\)-sound, the minimum-weight decoder guarantees that the residual error’s min-weight scales as \( f(2|u|) \) for measurement errors \( |u| < t/2 \) [109]. This property is particularly robust in double homological product codes, where soundness follows a cubic scaling (\( f(x) \sim x^3 \)).A meta-check-based decoder operates through a two-stage process: first, it identifies a minimal correction \( s_{rec} \) to the syndrome \( s \) such that the repaired syndrome \( s + s_{rec} \) satisfies all metachecks (\( H(s + s_{rec}) = 0 \)). Second, it computes a minimal-weight physical error \( E_{rec} \) consistent with the repaired syndrome. This approach uniquely tolerates up to \( \lfloor (d_{ss} - 1)/2 \rfloor \) measurement errors in a single round (where \(d_{ss}\) is the single-shot distance), eliminating the need for repeated syndrome measurements.
Cat code Measuring the Fock-state number modulo \(S+1\) can be used to determine if photon-loss or excitation errors occurred. For \(S=1\), this is the occupation number parity [99].
Cat-repetition code A measurement-code decoder for the repetition layer yields a \(\overline{\mathrm{CX}}\)-gadget threshold of about \(6\times 10^{-3}\) for \(n=5\); reaching a comparable threshold with naive repeated-syndrome decoding requires \(n=11\) and \(r=5\) [110].
Chamon model code Repetition-based decoder, based on the three underlying repetition codes and improved by pre-treatment with a probabilistic greedy local algorithm [111].Generalized MWPM decoder [112] that matches defects on each plane normal to a \((\pm 1,\pm 1,\pm 1)\) direction and corrects the resulting clusters with a sweeping decoder adapted from the broom algorithm [113,114]. Its greedy-matching and belief-matching [115] variants add a greedy or belief-propagation initialization step before matching [114].
Chuang-Leung-Yamamoto (CLY) code Destructive decoding with a photon number measurement on each mode.State can be decoded with a network of beamsplitters, phase shifters, and Kerr media.
Circuit-to-Hamiltonian approximate code Local detection of Pauli errors can be done using circuits of depth of order \(O( polylog(n) )\) based on exact decoders for the random polylog-depth Clifford-circuit code [116; Lemma 3.2].
Classical-quantum (c-q) code Unambiguous state discrimination (USD) [117].
Cluster-state code MBQC syndrome extraction is performed by multiplying certain single-qubit \(X\)-type measurements, which yield syndrome values.
Codeword stabilized (CWS) code There is no known efficient algorithm to decode an arbitrary non-stabilizer CWS code.Clustered bounded-distance decoder [118–120].Structured error recovery [121], which reduces to syndrome-based recovery for additive (i.e., stabilizer) CWS codes. It takes superpolynomial time when correcting errors on \(\omega(\log n)\) qubits [122].Keyed decoder for CWS codes whose secret key is a random Pauli and a random bipartite graph [122]. The graph is the XOR of \(O(\log^2 n)\) random perfect matchings between the two halves of the qubits. The classical code can be any efficiently encodable and decodable code, linear or not, that corrects a constant fraction of bit flips. The classical decoder coherently removes the induced bit error \(e=v\oplus Au\) of a Pauli error \(Z^vX^u\), with \(A\) the adjacency matrix of the graph, and \(e\) is then measured. A bit-flipping algorithm on the graph recovers \(u\) from \(e\), and the residual phase error \(Z^u\) is cancelled. The decoder runs in polynomial time and corrects all key-independent \(o(n\log\log n/\log n)\)-local noise on average over the key [122].
Coherent FSK (CFSK) c-q modulation format Bondurant receiver [123].Cyclic receiver [124].Time-resolving receiver [125–127].Bayesian inference [125].
Coherent-state c-q modulation format Optimal receiver performance in ambiguous state discrimination is determined using the Yuen-Kennedy-Lax (YKL) conditions [128]. See review [129] for details on receivers used for coherent-state c-q codes.Joint-detection receiver that can attain channel capacity [130].Various near-optimal receiver designs that can handle arbitrary constellations of coherent states with possible degeneracies [131].The square-root measurement (a.k.a. pretty good measurement) [132–134] is optimal for geometrically uniform [135–138], direct sums of geometrically uniform [139], and compound geometrically uniform [140] constellations.
Color code In contrast to the surface code, the color code can suffer from unremovable hook errors due to the specifics of its syndrome extraction circuits. Fault-tolerant decoders thus have to utilize additional flag qubits.Restriction decoder, which decodes the color code in \(D\geq 2\) dimensions using any \(D\)-dimensional toric code decoder and a local lifting procedure [141]. It succeeds if and only if the toric code decoding succeeds.
Compass code Asymmetrically-weighted variant of the union-find decoder [142].
Concatenated GKP code Circuit-level soft information decoder [143].
Concatenated Steane code A simple message-passing decoder from level 1 to level 2 corrects all weight-four errors for the \([[49,1,9]]\) code and was used in the comparative threshold study of Ref. [75].There exist fault-tolerant syndrome extraction protocols for the concatenated Steane code [144].Randomized compiling helps reduce logical error rate for some noise models [145].
Concatenated bosonic code Decoder exploiting analog information from the outer code for bosonic codes concatenated with qubit QLDPC codes [146].
Concatenated quantum code Standard decoding proceeds in the reverse order: first decode the outer code blocks and then use the resulting data to decode the inner code.Maximum-likelihood decoding can be formulated as contraction of a tree tensor network, yielding exact decoders that improve on minimum-distance decoding for recursively concatenated block codes [106,147].
Concatenated qubit code Adaptive syndrome extraction for a concatenation of a small error-detecting code and a high-rate, high-distance QLDPC code [148].The effective channel for a concatenation of codes is the composition of the codes’ effective channels [149].Message passing algorithm for concatenated codes can be equivalent to ML decoding [147].In the statistical mechanical mapping of maximum-likelihood decoding, recursively concatenated codes yield classical models on hierarchical lattices, and optimal decoding admits a hierarchical message-passing formulation that, in the fully postselected limit, reduces to an exact real-space renormalization group flow [150].
Constant-excitation (CE) code Modified Shor syndrome extraction measures a weight-\(2w\) or \((2w-1)\) stabilizer of a CE CSS code with the \(w\)-CE cat state \(\frac{1}{\sqrt{2}}(|01\rangle^{\otimes w}+|10\rangle^{\otimes w})\) [151; Thm. 9]. The \(j\)th ancilla qubit controls a Pauli on the \(j\)th data qubit of the support, with zero-controlled gates at even \(j\) [151; Alg. 1]. Modified Steane syndrome extraction for dual-rail-concatenated CE CSS codes, in which each transversal CNOT gate is followed by the Pauli correction \(\prod_j X_{2j}\) [151; Thm. 12].
Cornucopia code Relay belief propagation, with belief propagation and ordered-statistics decoding as a fallback for shots it does not resolve [152].
Coset-based quantum LDPC code BP-OSD decoding; performance under several decoders is compared in Ref. [153].A maximally packed syndrome-extraction circuit of depth \(w+2\), including state initialization and measurement, exists for any code of maximum stabilizer weight \(w\), generalizing the depth-eight bivariate bicycle schedule [153].
Cubic theory code Probabilistic local cellular-automaton decoder [154].
Cyclic hypergraph product code BP-OSD decoder [155].
Cyclic quantum code Linear feedback shift registers [156].Adapted from the Berlekamp decoding algorithm for classical BCH codes [157].
Dense twist-defect surface code Correlated minimum-weight perfect matching via sparse blossom [158], applied to detector error models constructed with Stim [87]. The gauge-operator measurement scheme is designed to keep the code matchable, unlike lower-depth twist implementations that forfeit polynomial-time decoding [159].
Dinur-Hsieh-Lin-Vidick (DHLV) code Linear-time decoder utilizing the small set-flip decoder [160] for \(Z\) errors and a reconstruction procedure for \(X\) errors [161].
Directional code Tesseract search-based decoder [162] with a short beam setting, applied to detector error models constructed with Stim [87].
Directional tile code Routing qubits can be measured during the walk. Nontrivial outcomes flag faults along the routing path and are supplied to the decoder, which improves decoding at relatively high physical error rates [163].
Distance-balanced code If the auxiliary classical LDPC code corrects all error patterns of weight \(<\alpha |A|\), then the resulting product code has a polynomial-time decoder for \(X\)-errors of weight \(< \alpha |A| d_X/2\), where \(d_X\) is the \(X\)-distance of the component quantum code [164].If the component 2D complex has a polynomial-time decoder for \(Z\)-errors of weight \(< w\), then the resulting distance-balanced code also has a polynomial-time decoder for \(Z\)-errors of weight \(< w\) [164].The effective distance of single-ancilla syndrome extraction QLDPC code circuits can be preserved under weight reduction [165]. The distance balancing technique of Ref. [164] preserves the effective distance of single-ancilla syndrome extraction circuits [165].
Doubled color code ML decoder that can utilize a history of syndromes, based on the Walsh-Hadamard transform [166].
Dynamical code Temporal Petz recovery map [60].
EA Galois-qudit stabilizer code Syndrome extraction and computation based on classical additive codes [167].
EA QC-QLDPC code Sum-product algorithm (SPA) decoder [168].
EA QLDPC code Decoder adapted for an all-optical implementation [169].
EA qubit code Decoding algorithm [170].
EA qubit stabilizer code Encoders and decoders of a minimal EA qubit stabilizer code should be realizable using hyper-entangled states [171].
Eigenstate thermalization hypothesis (ETH) code An explicit universal recovery channel for the ETH code is given in [172].
Error-corrected sensing code There is a condition under which autonomous QEC gives rise to metrology with optimal Heisenberg scaling [173].
Expander LP code Linear-time decoder [174].Logarithmic-time subroutine [175].
Fiber-bundle code Greedy algorithm can be used to efficiently decode \(X\) errors, but no known efficient decoding of \(Z\) errors yet [81].
Fibonacci string-net code Clustering decoder (provides best known threshold for this code) [176–178].Fusion-aware iterative minimum-weight perfect matching decoder. Note that ordinary MWPM decoders do not produce a threshold with this code [178].Cellular automaton decoder [179].
Finite-dimensional quantum error-correcting code The operation \(\cal{D}\) in the definition of this code is called the decoder. However, the term decoder can sometimes be used for the unencoder \(\cal{U}\) (i.e., the inverse of the encoder), which does not correct errors.There are several recovery maps which work for noise that is not exactly correctable; see AQECC entry.QECCs are useful [180] for the mean king’s measurement problem [181].Protection can be implemented via autonomous QEC (a.k.a. continuous QEC or continuous-time QEC) [182–186] via, e.g., reservoir engineering [187]; see review [188]. There are analogues of the Knill-Laflamme conditions for autonomous QEC [189,190], and it has been adapted to non-Markovian noise [191]. Information-theoretic bounds have been derived for open-loop control [192]. Machine learning can be used to optimize autonomous QEC encoding and recovery [193].
Floquet color code Period-six measurement sequence utilizing two-qubit measurements [194].
Fock-state OOK c-q modulation format Photon-number detection distinguishes the erasure/loss-degraded output alphabet by detecting whether photons are present in the received mode [195,196].Number-state modulation with photon detection, including the numerical observation that the optimal prior distribution can be multimodal, was studied in Ref. [197; Ch. 5]. Later work on incoherent OOK and PPM quantified improvements from sub-Poissonian nonclassical light and used Fock states as the nonclassical low-photon-number alphabet [196].
Folded quantum RS (FQRS) code Efficiently \(((1-R-\gamma)/2,n^{O(1/\gamma)})\)-quantum list-decodable codes exist for every fixed \(\gamma>0\) and rate \(0<R<1\) [198; Thm. 3.9].
Fractal surface code Sweep local automaton decoder [199].
Fracton Floquet code Period-six measurement sequence utilizing two- and three-qubit measurements [194].
Frobenius code Adapted from the Berlekamp decoding algorithm for classical BCH codes. There exists a polynomial-time quantum algorithm to correct errors of weight at most \(\tau\), where \(\delta=2\tau+1\) is the BCH distance of the code [200].
Fusion-based quantum computing (FBQC) code Surface-code-based FBQC schemes often admit a syndrome-graph description, allowing the use of decoders such as minimum-weight matching and union-find [201,202].
GKP CV-cluster-state code GKP error correction can be naturally combined with CV MBQC protocols since the performance of both is quantified by a squeezing parameter [203].
GKP-surface code Minimum-energy and random-plaquette-gauge-model decoders for the toric-GKP code [204; Secs. IV-V].MWPM closest point decoder [205].
GNU PI code For a family of shifted gnu codes, decoding can be done using projection, probability amplitude rebalancing, and gate teleportation in time \(O(n^2)\) [206].Syndrome extraction protocol for insertion errors [207].
Galois-qudit code For few-qudit codes (\(n\) is small), decoding can be based on a lookup table. For infinite code families, the size of such a table scales exponentially with \(n\), so approximate decoding algorithms scaling polynomially with \(n\) have to be used. The decoder determining the most likely error given a noise channel is called the maximum-likelihood (ML) decoder.RL-on-Greedy decoder based on reinforcement learning [208].
Galois-qudit stabilizer code Syndrome extraction and computation based on classical additive codes [167].
Generalized Shor code Efficient decoder [209].
Generalized bicycle (GB) code BP-OSD decoder [85].
Generalized five-squares code For the original five-squares code, preprocessing maps decoding onto two copies of the toric code, after which one can use minimum-weight matching or renormalization-group decoding [19].Generalized five-squares codes can also be decoded via a mapping to two copies of the surface code [210].
Gottesman-Kitaev-Preskill (GKP) code Syndrome extraction is performed by measuring stabilizers and correcting. Issues arising from the use of finite-energy approximate states can be mitigated [211].The MLD decoder for Gaussian displacement errors is realized by evaluating a lattice theta function, and in general the decision can be approximated by either solving (approximating) the closest vector problem (CVP) [212] (a.k.a. closest lattice point problem) or by using other effective iterative schemes when, e.g., the lattice represents a concatenated GKP code [204,213–215]. While the decoder time scales exponentially with number of modes \(n\) generically, the time can be polynomial in \(n\) for certain codes [205].Babai’s nearest plane algorithm [216] can be used for bounded-distance decoding [205].Combining AD noise with amplification yields displacement noise, the noise that GKP codes are designed to correct [217,218].ML decoder for correcting shift errors in GKP two-qubit gates [219].
Group-action lift with active orthogonality (GALA) code Relay-BP decoding cascade with a mixed-integer linear-programming fallback [220].
Haah cubic code (CC) Hard-decision RG decoder [113].BP-OSD decoder [85].
Hayden-Nezami-Salton-Sanders bosonic code Decoding requires a different circuit for each possible erasure error, with no general circuit decoding any possible erasure error. Every circuit relies on a generalized conditional rotation, which Ref. [221] calls the QND Gate and which is defined as \(QND_c | x , y \rangle = |x + c y, y \rangle\).
Heavy-hexagon code Any graph-based decoder can be used, such as MWPM and Union Find. However, edge weights must be dynamically renormalized using flag-qubit measurement outcomes after each syndrome measurement round.Machine-learning [222] and neural-network [223] decoders.
Hemicubic code Polynomial-time decoding algorithm that corrects arbitrary errors of size up to the minimum distance divided by polylogarithmic factors [224]. This was the first polynomial-time decoding algorithm for quantum locally testable codes.
Heptagon holographic code Optimal erasure decoder [225].
Hierarchical code Decoding is performed as in a standard concatenated code using decoders for the inner and outer codes. The syndrome extraction circuit depth for the inner QLDPC code is optimized using a permutation routing algorithm [226]. The bilayer architecture allows for logical entangling gates between logical surface-code patches.Soft output decoding [227].
High-dimensional expander (HDX) code For HDX codes built from 2D LSV complexes, \(X\)-error decoding reduces to polynomial-time cycle-code decoding on the 1-skeleton together with decoding of the auxiliary classical LDPC code [164].For the 2D construction, \(Z\)-errors of linear weight admit a local decoder based on coboundary expansion; replacing the component complex by the 2-skeleton of a 3D LSV complex preserves 2D-type asymptotic parameters while giving linear-time \(Z\)-decoding with unit-weight local corrections [164].
Homological code Local automaton decoders based on Toom’s rule and its generalization, the sweep rule [228–230].Explicit local algorithm for the sweep-rule correction on \((p,q)\) surface codes with \(p,q\geq 2\) on hypercubic lattices [231; Claim 4.7].Improved BP-OSD decoder [232].Renormalization group (RG) decoder [233].
Homological product code Union-find decoder [234].BP-OSD-like post-processing [85].
Honeycomb (6.6.6) color code Distance-three measurement schedule based on detector error models [235].Message-passing decoder [236].Adaptation of the restriction decoder [237].Neural-network decoder [238,239].Möbius matching decoder gives low logical failure rate [240] and has an open-source implementation called Chromöbius [5].AMBP4, a quaternary version [241] of the MBP decoder [242].MaxSAT-based decoder [243].Height-bound decision-tree decoder (DTD) [244].Most likely error (MLE) decoder [245].Neural network decoder [245].Frontier decoder, a pruned dynamic-programming decoder [246].
Honeycomb Floquet code The ISG has a static subgroup for all time steps \(r\geq 3\) – that is, a subgroup which remains a subgroup of the ISG for all future times – given by so-called plaquette stabilizers. These are stabilizers consisting of products of check operators around homologically trivial paths. The syndrome bits correspond to the eigenvalues of the plaquette stabilizers. Because of the structure of the check operators, only one-third of all plaquettes are measured each round. The syndrome bits must therefore be represented by a lattice in spacetime, to reflect when and where the outcome was obtained.
Hyperbolic Floquet code Syndrome structure allows for MWPM decoding [247,248].
Hyperbolic color code Two flag-based decoders [8].
Hyperbolic surface code Hastings decoder [249].
Hypergraph product (HGP) code Single-ancilla syndrome extraction circuits do not admit distance-reducing hook errors [165].ReShape decoder that uses minimum weight decoders for the classical codes used in the hypergraph construction [250].2D geometrically local syndrome extraction circuits with depth order \(O(\sqrt{n})\) using order \(O(n)\) ancilla qubits [251].BP-OSD decoder [85] and an improved BP-OSD decoder [232].Erasure correction can be implemented approximately with \(O(n^2)\) operations with quantum generalizations [252] of the peeling and pruned peeling decoders [253], with a probabilistic version running in \(O(n^{1.5})\) operations. Other nearly optimal erasure decoders exist [254,255]. Initial hypergraph product codes can be further optimized against the erasure channel using reinforcement learning [256].Syndrome measurements are distance-preserving because syndrome extraction circuits can be designed to avoid distance-reducing hook errors [257].Generalization [258] of Viderman’s algorithm for expander codes [259].Linear time iterative decoder [260].
Kasai code Belief propagation with post-processing, using a library of elementary trapping sets, flip history, and local ordered-statistics decoding [261].
Khesin-Lu-Shor code A greedy graph decoder on the hypercube representation corrects at least \(\lfloor (m-1)/4 \rfloor - 1\) Pauli errors [262].
Kitaev chain code Local automaton decoder based on a self-dual cellular automaton [263].Syndrome extraction of the stabilizers \(S_j=i\gamma_{2j}\gamma_{2j+1}\) can be performed by interfacing with a qubit ancilla and mixed qubit-fermion gates [264].
Kitaev surface code Using data from multiple syndrome measurements prior to decoding allows for correcting syndrome measurement errors. The surface code requires order \(O(d)\) extraction rounds in order to gain a reliable estimate, except for transversal Clifford circuits with correlated decoding [265]. Syndrome measurements are distance-preserving because syndrome extraction circuits can be designed to avoid hook errors [78].Syndrome extraction circuits consist of CNOT gates and ancillary measurements since this is a stabilizer code [266]. Measurement schedules can be optimized using spacetime circuit codes to yield what is known as the 3CX surface code [267]. Schedules can also be optimized via ZX calculus [268,269]. Inspired by the honeycomb Floquet code, various weight-two measurement schemes have been designed [270–272], with the scheme in Ref. [271] being a special case of DWR.Fault-tolerant syndrome extraction circuits using three-qubit gates [273,274].Expanding diamonds decoder correcting errors of some maximum fractal dimension [275]. The sub-threshold failure probability scales as \((p/p_{th})^{d^\beta}\), where \(p_{th}\) is the threshold and \(\beta = \log_3 2\).Minimum weight perfect-matching (MWPM) [78,276–278] (based on work by Edmonds on finding a matching in a graph [279,280]), which takes time up to polynomial in \(n\) for the surface code. For the case of the surface code, minimum-weight decoding reduces to MWPM [78,279,281]. MWPM solves the MPE decoding problem exactly for independent \(X\) and \(Z\) noise. Minimum-weight decoding is \(NP\)-hard for more general Pauli noise and for transversal-CNOT decoding with Pauli-\(Z\) and measurement bit-flip errors [4,282]. PyMatching is a Python software library for implementing MWPM [283].The Bravyi-Suchara-Vargo (BSV) tensor network decoder [284] exactly solves the ML decoding problem under independent \(X,Z\) noise for the surface code and has complexity of order \(O(n^2)\); the decoder provides an efficient tensor-network contraction for the partition function resulting from the statistical mechanical mapping, which is known to be solvable for an Ising model on a planar graph [285]. ML decoding [78] is \(\#P\)-hard in general for the surface code [282].Union-find decoder [286] uses the union-find data structure [287–289], solving the MPE decoding problem exactly for low-weight errors under depolarizing noise. A subsequent modification utilizes the continuous signal obtained in the physical implementation of the stabilizer measurement (as opposed to discretizing the signal into a syndrome bit) [290]. Belief union find is a combination of belief-propagation and union-find [115]. Strictly local (as opposed to partially local) union find [291] has a worst-case runtime of order \(O(d^3)\) in the distance \(d\).Modified MWPM decoders: topological code Autotune [292]; pipeline MWPM (accounting for correlations between events) [293,294]; modification tailored to asymmetric noise [295]; parity blossom MWPM and fusion blossom MWPM [296], a modification utilizing the continuous signal obtained in the physical implementation of the stabilizer measurement (as opposed to discretizing the signal into a syndrome bit) [290]; MWPM with edge weights from BP marginals and multi-path summation [297]; belief perfect matching (a combination of belief-propagation and MWPM) [115]; spanning tree matching (STM) and rapid-fire (RFire) decoders [298]; ordered decoding based on MWPM [299]; Micro Blossom adapted for a parallelized architecture [300]; logical observable MWPM and a windowed version [301]. Combining, or harmonizing, various decoders can improve performance [302]. One such example is the Libra decoder [303], a combination of MWPM decoders and matching synthesis.Renormalization group (RG) [304–306]; see Ref. [307] for the planar surface code.Linear-time ML erasure decoder [25].Linear-time decoder for general noise, including coherent noise and correlated noise [308].Markov-chain Monte Carlo [309,310].Cellular automaton decoders [311–313]; see also [314].Neural network [315–321], reinforcement learning [322–325], and transformer-based [326,327] decoders like the AlphaQubit series [328,329].Lightweight low-latency look-up table (LILLIPUT) decoder for small surface codes [330].Decoders can be augmented with a pre-decoder [331,332], which can allow for some processing to be done inside the cryogenic environment of the quantum system [333].Sliding-window [334,335], parallel-window [334], and predictive-window [336] parallelizable decoders, designed to overcome the backlog problem, can be combined with many inner decoders, such as MWPM or union-find.Modifications of BP: generalized belief propagation (GBP) [337], based on a classical version [338]; AMBP4, a quaternary version [241] of the MBP decoder [242] of complexity \(O(n\log\log n)\); blockBP, a combination of BP and tensor-network decoders [339]; machine-learning inspired modifications [340]. See Ref. [341] for a review of BP decoders. The min-sum decoder, a simple variant of BP, cannot be used to attain the benefits of codes with distance greater than 9 [342].A color-code decoder can be used for the surface code [343].Progressive-Proximity Bit-Flipping (PPBF) decoder [344].Collision clustering decoder [345].Quasi-local Lindbladian decoder based on the approximate Petz theorem [346].Exclusive decoder family incorporating post-selection on decoding instances deemed not too difficult [347].Quantum version of the Tsirelson local automaton decoder [348].Bubble clustering decoder [349].Union-Intersection Union-Find (UIUF) decoder [350].
Ladder Floquet code Syndrome bits are the plaquette-stabilizer eigenvalues, recorded every time they can be inferred from consecutive rounds of measurements [82].Period-four measurement sequence utilizing two-qubit measurements [82].
Lattice stabilizer code A local automaton decoder (a.k.a. measurement-free local error correction) applies local rules to each small region of sites in a lattice geometry. Such decoders do not require any potentially non-local classical post-processing of error syndromes.Clustering decoder [113,311].Quantum neural-network (QNN) decoder [12].Almost linear-time decoder [351].Offline message-passing decoder [352].
Layer code Decoders against stochastic and adversarial noise [353].
Lechner-Hauke-Zoller (LHZ) code BP decoder [354].
Lifted-product (LP) code Linear time iterative decoder [260].
Locally compact Abelian (LCA) stabilizer code Simple LCA codes admit a decoder for pure displacement noise, a decoder for all single-qudit Pauli errors together with a smaller displacement range, and for physical qubits a balanced decoder that trades oscillator against qudit error tolerance by moving syndrome-region boundaries [355].Under Petz (transpose) recovery against photon loss and qubit amplitude damping, \(c=2\) LCA codes can match or outperform comparable GKP codes at low energy for sufficiently large logical dimension [355].
Log-depth geometrically local Clifford-circuit code Minimum-weight decoding using tropical tensor networks [356].
Majorana box qubit Qubit readout can be done by charge sensing [357–360].
Majorana-XYZ code BP-OSD decoder [361] applied to the degree-six Tanner graph of the double-loop stabilizer generators [362].
Mitten code Telescoping decoder, which sends progressively harder shots through successive BP, Relay-BP, and integer-programming stages [363].
Modular-qudit code For few-qudit codes (\(n\) is small), decoding can be based on a lookup table. For infinite code families, the size of such a table scales exponentially with \(n\), so approximate decoding algorithms scaling polynomially with \(n\) have to be used. The decoder determining the most likely error given a noise channel is called the maximum-likelihood (ML) decoder.
Modular-qudit lattice color code Generalized Color Clustering (GCC) decoder [364].
Modular-qudit stabilizer code Trellis decoder for prime-dimensional qudits, which builds a compact representation of the algebraic structure of the normalizer \(\mathsf{N(S)}\) [365].
Modular-qudit surface code Renormalization group decoder [306,366,367].
Monitored random-circuit code With access to the measurement record, recovery operations can reverse the future unraveled evolution with high fidelity; on the code space, the induced dynamics becomes effectively unitary in the thermodynamic limit [368].
Multivariate multicycle (MM) code BP-OSD and Tesseract decoders [369].Few-shot sliding-window decoding [370].Single-shot decoding using metachecks for \(t \geq 4\), with confinement profiles surpassing those of known single-shot-decodable CSS codes of practical block size [369].
NTRU-GKP code Babai’s nearest plane algorithm [216] can be used for bounded-distance decoding.An NTRU-based decoder against stochastic displacement noise is efficient because the decoding problem is equivalent to decrypting the NTRU cryptosystem with knowledge of the encoder.
Niset-Andersen-Cerf code Optical decoder using three beam splitters, electronic gain detectors, and two phase-insensitive amplifiers as described in Ref. [371].
Number-phase code Modular phase measurement done in the logical \(X\), or dual, basis has zero uncertainty in the case of ideal number-phase codes. This is equivalent to a quantum measurement of the spectrum of the Susskind-Glogower phase operator [99]. Approximate number-phase codes are characterized by vanishing phase uncertainty [99]. Such measurements can be utilized for Knill error correction (a.k.a. telecorrection [101]), which is based on teleportation [102,103]. This type of error correction avoids the complicated correction procedures typical in Fock-state codes, but requires a supply of clean codewords [99]. Performance of this method was analyzed in Ref. [372], and it was extended in Ref. [373].Number measurement can be done by extracting modular number information using a CROT gate \(\mathrm{e}^{(2\pi \mathrm{i} / NM) \hat n \otimes \hat n}\) and performing phase measurements [374,375] on an ancillary mode [99].
Numerically optimized four-qubit AD code Analytical recovery channel [376].
On-off keyed (OOK) c-q modulation format Dolinar receiver [377], which attains the Helstrom limit in the ideal model and has been demonstrated in proof-of-principle experiments [378].Superconducting transition edge sensor (TES) photon-number resolving detector [379].
Oscillator-into-oscillator GKP code Syndromes can be read off using ancilla modes, yielding partial information about noise in the logical modes that can then be used in an efficient ML decoding procedure [380].
PI qubit code Schur-Weyl-transform based decoder [381]. Here, one first measures nested total angular momenta, i.e., that of the first qubit, the first and second, followed by the first, second, and third, etc. Then, for codes with spacing, one measures the projection of the angular momentum modulo the spacing. Recovery can be performed by applying geometric phase gates [382] or the quantum Schur transform. This decoder has been generalized to work with insertion errors [207].
PSK c-q modulation format Multi-stage quantum receivers [69,383–387].Bayesian inference [125,387,388].
Pair-cat code Lindbladian-based dissipative encoding and autonomous QEC utilizing two-mode two-photon absorption [389]. Encoding passively protects against cavity dephasing, suppressing dephasing noise exponentially with \(\gamma^2\).
Pair-partition CPM code Sum-product or normalized min-sum BP followed by CPM-aware residual-syndrome decoding, a bounded-weight correction search that exploits invariance under simultaneous cyclic shifts [390; App. F].Hierarchical decoder with BP, relay-BP, and integer-programming stages [390,391].
Pastawski-Yoshida-Harlow-Preskill (HaPPY) code Hierarchical recovery model [392].The greedy algorithm reconstructs bulk operators by iteratively absorbing tensors for which at least half of the legs are already included; the resulting greedy geodesic gives an explicit boundary reconstruction region [392].
Perturbed bivariate bicycle (PBB) code BP-OSD decoder applied to the full symplectic check matrix [393].
Phantom code Spatiotemporal sliding-window correlated list and most-likely-error decoders for Steane-style error correction [394].
Polar c-q code Quantum-limited successive-cancellation (SC) joint-detection receiver [395].
Pulse-position (PPM) c-q modulation format Conditional pulse nulling (CPN) receiver [396].
QLDPC code Non-binary decoding algorithm for CSS-type QLDPC codes [397].GD-CSS Decoder for Galois-qudit CSS QLDPC codes [398,399]
Quantum Tamo-Barg (QTB) code Polynomially efficient decoder for QTB codes against errors acting on a number of subsystems that can go up to half of the distance bound proved for the family [400; Thm. 69]. The decoder is based on decoding RS codes, and its runtime is independent of the locality \(r\).Polynomially efficient decoder for FQTB codes against errors acting on a number of subsystems that can go up to half of the distance bound proved for the family [400; Cor. 72]. The runtime depends on the locality \(r\).
Quantum Tanner code Linear-time potential-based decoder similar to the small-set-flip decoder for quantum expander codes [401].Linear-time decoder [174].Logarithmic-time mismatch decomposition decoder [175].
Quantum convolutional code Quantum Viterbi decoder [402–404].Decoder finding the most likely error over any memoryless channel [403].Degenerate Viterbi decoder, which finds the most likely class of degenerate errors in time linear in the number of qubits [405].
Quantum data-syndrome (QDS) code Syndrome errors are decoded using redundant stabilizer measurements.Syndrome-measurement codes can outperform repeated syndrome extraction; for the Steane code, a \([15,3]\) syndrome-measurement code uses the same 15 measurements as five-fold repetition of three syndrome bits while achieving lower syndrome-decoding error [406; Fig. 1].
Quantum error-correcting code (QECC) The effect of an error is a mapping of the code subspace into another, potentially overlapping, subspace. To determine, or diagnose, the effect of the error in what is known as syndrome-based decoding, one can measure one or more operators called check operators, which resolve code and error spaces without collapsing the quantum information inside the spaces. The eigenvalues of check operators are called error syndromes. One round or cycle of quantum error correction proceeds by extracting syndromes and performing correcting operations to map the error space containing the logical information back into the codespace. For some codes, correcting operations are not necessary because one can instead track which error space contains the logical information.
Quantum expander code Small set-flip linear-time decoder, which corrects order \(\Omega(n^{1/2})\) adversarial errors [160]. The decoder has been generalized to hypergraph products of 3 or more expander codes [407].Log-time decoder [408].Constant-time decoder [409].
Quantum locally recoverable code (QLRC) Codes constructed with the help of AEL distance amplification [410,411] admit efficient decoders [400].
Quantum parity code (QPC) Teleportation-based QEC [412].
Quantum polar code Arikan-style successive-cancellation decoding can be recast as a tensor-network contraction [106].Quantum successive-cancellation list decoder (SCL-E) for quantum polar codes that do not need entanglement assistance [413].Numerics for tensor-network-based decoders on depolarizing and erasure channels indicate that good performance is possible without entanglement assistance, with channel polarization rapidly suppressing channels that are bad in both quadratures [106].
Quantum pseudorandom error-correcting code (QPRC) PRIC decoding uses the graph-based phase recovery of the keyed CWS decoder, with the decoder of \(g\) correcting the induced bit error [122].
Quantum repetition code Fault-tolerant syndrome detection [414].Autonomous QEC for the 3-qubit bit-flip code [415].Machine learning algorithm to implement autonomous QEC for the three-qubit quantum repetition code [416].Quantum cellular automata for majority voting and two-line voting [417].Quantum version of the Tsirelson local automaton decoder [348].Planar decoder designed to work under circuit-level noise [418].Single-rule and shearing-rule local automaton decoders [419].
Quantum spherical code (QSC) Lindbladian scheme stabilizing all points in the constellation and protecting from the AD operator \(E_{0}^{\otimes n}\) [420].
Quantum turbo code Turbo decoder [421; Sec. V].Modified decoder yields improvement over the memoryless depolarizing channel [422].Iterative decoding is analogous to a mean-field treatment of two matrix-product-state chains coupled by random non-local interactions [106].EXIT charts [423].
Quantum-double code For any solvable group \(G\), topological charge measurements can be done with an adaptive constant-depth circuit with geometrically local gates and measurements throughout [424].
Qubit CSS code CSS syndrome decoding splits into two classical decoding problems: measuring the \(Z\)-type stabilizers yields the classical syndrome for bit-flip errors with respect to \(C_X\), while measuring the \(X\)-type stabilizers yields the classical syndrome for phase errors with respect to \(C_Z\). In the Hadamard basis, phase-error decoding is ordinary classical syndrome decoding.Coherent decoders allow for measurement-free error correction [425]. One method is table/multi-control decoding [426], which scales exponentially with the number of ancillas used in syndrome measurement. A fault-tolerant measurement-free scheme for low-distance CSS codes is formulated in Ref. [427]. Another method, the Ising-based decoder, utilizes the mapping of the effect of the noise to a statistical mechanical model [78,79] such that the decoding problem maps to preparation of the ground state of an Ising model. See [428; Table 3.2] for a Rosetta stone comparing statistical mechanical models, CSS codes, and chain complexes. Models for bit- and phase-flip noise can be dual to one another [429].Transformer-based decoder [430].MaxSAT decoder [431].
Qubit QLDPC code Iterative error estimation based on the MIN-SUM and SUM-PRODUCT algorithms [108].Quantum belief propagation (BP) decoder [432–434] is a quantum version of the classical BP decoder, but performance suffers due to degeneracy [435]. Various post-processing algorithms have been proposed (see below and also Refs. [436,437]).BP-OSD decoder, scaling as \(O(n^3)\), adds a post-processing step based on ordered statistics decoding (OSD) to the belief propagation (BP) decoder [85].Neural network BP decoders [438,439] and GNN decoders [440,441] for qubit codes.Partially and fully decoupled BP decoders, which use the decoupling representation, yield improvements against depolarizing noise [442].Message-passing decoder utilizing stabilizer inactivation (MP-SI a.k.a. BP-SI) for CSS-type QLDPC qubit codes [443].BP localized statistics decoding (BP-LSD) that exploits error clustering [444].Syndrome-based linear programming (SB-LP) algorithm can be applied as a post-processing step after syndrome-based min-sum (SM-MS) decoding [445].BP guided decimation (BPGD) decoder [446].SymBreak decoder, which adaptively modifies the decoding graph to break the degeneracy of the BP decoder [447].Ambiguity clustering (AC) decoder, in which measurement data is divided into clusters and decoded independently [448].2D geometrically local syndrome extraction circuits with bounded depth using order \(O(n^2)\) ancilla qubits [251]. For CSS codes, syndrome extraction can be implemented in constant depth [449].Soft (i.e., analog) syndrome iterative BP for CSS-type QLDPC codes, utilizing the continuous signal obtained in the physical implementation of the stabilizer measurement (as opposed to discretizing the signal into a syndrome bit) [450].The MWPM decoder for surface codes may be generalizable to QLDPC codes [112].Extensions of the union-find decoder for qubit QLDPC codes [451–453].Sliding-window decoding [454].Closed-branch decoder [455].BP with guided decimation guessing (GDG) sliding-window decoder for CSS qubit codes [456].Performing \(d\) syndrome extraction rounds obtains an effective distance of \(d\) for a qubit QLDPC code [457].BP plus ordered Tanner forest (BP+OTF) almost-linear time decoder [458].Cluster decoder [255].BP approximate degenerate OSD (BP+ADOSD) decoder [459].Decision tree decoders (DTDs), one that provably finds the minimum-weight correction, and one that is heuristic [244].AutDEC decoder for codes with large automorphism groups [95].Tesseract ML decoder [162].Relay-BP decoder [86].HyperBlossom [460].Post-selection strategies for clustering based decoders [461].Decoder switching between soft-output and higher-accuracy decoders [462].Graph augmentation and rewiring for interference (GARI) framework for circuit-level noise [463].
Qubit c-q code Belief propagation with quantum messages (BPQM) decoder for c-q channel communication [464]. The original BPQM proposal used quantum messages to decode pure-state c-q channels, had c-q polar codes in mind, and yielded explicit capacity-achieving decoders for non-Pauli channels [464]. BPQM was analyzed for a BPSK-modulated pure-loss channel and shown to be optimal for small tree codes [465]. A later quantum message-passing formulation proved optimality of BPQM for any binary linear code with a tree Tanner graph, and proposed an extension to factor graphs with cycles using approximate cloning [466]. BPQM has also been extended to symmetric classical-quantum channels using paired measurements [467].
Qubit code Syndrome measurements are assumed to be perfect in the code-capacity model. Incorporating faulty syndrome measurements can be done using the phenomenological noise model, which simulates errors during syndrome extraction by flipping some of the bits of the measured syndrome bitstring. In the more involved circuit-level noise model, every component of the syndrome extraction circuit can be faulty.The decoder determining the most likely error given a noise channel is called the maximum probability error (MPE) decoder. For few-qubit codes (\(n\) is small), MPE decoding can be based on creating a lookup table. For infinite code families, the size of such a table scales exponentially with \(n\), so approximate decoding algorithms scaling polynomially with \(n\) have to be used.

Effective distance and hook errors: Decoders are characterized by an effective distance (a.k.a. circuit-level distance or fault distance), the minimum number of faulty operations during syndrome measurement that is required to make an undetectable error. A code is distance-preserving if it admits a decoder whose circuit-level distance is equal to the code distance. A particularly dangerous class of syndrome measurement circuit faults are hook errors, which are ancilla faults that cause more than one data-qubit error [78]. Hook errors occur at specific places in a syndrome extraction circuit and can sometimes be removed by re-ordering the gates of the circuit. If not, the use of flag qubits (see [468]) to detect hook errors may be necessary to yield fault-tolerant decoders.

Qubit stabilizer code The size of the circuit extracting the syndrome depends on the weight of its corresponding stabilizer generator. Syndrome extraction circuits can be simulated efficiently using dedicated software (e.g., STIM [87]) and there are many general schemes for generating them [469] (see also [92]). Noise can be characterized without interrupting syndrome extraction [470]. Decoding of qubit stabilizer codes is an approximately optimal strategy for various quantum lights-out (QLO) games that can be played on the codes’ encoder-respecting form [262].Instead of applying the Pauli recovery from a fault-tolerant syndrome-extraction gadget, one can usually track it classically as a Pauli frame; Clifford operations update the frame by conjugation, while measurement-based non-Clifford gadgets must be interpreted relative to the current frame [468].A greedy graph decoder for encoder-respecting forms corrects all recoverable errors for sufficiently sparse graphs, including graphs with girth at least 13 and some lower-girth families with additional spacing constraints [262].DiVincenzo-Aliferis syndrome extraction circuits [471].Greedy syndrome measurement schedule [8].Dynamical weight reduction (DWR) scheme in which measurements of smaller-weight Paulis yield the outcome of a larger-weight Pauli via the use of ZX calculus and ancillary qubits [472].Ancilla modes can be used for syndrome extraction instead of ancilla qubits [473], and using two-component cat codes [474] yields fault-tolerant syndrome extraction circuits.Autonomous QEC protocol [475].MPE decoding, i.e., the process of finding the most likely error, is \(NP\)-complete in the worst case [476,477]. If the noise model is such that the most likely error is the lowest-weight error, then ML decoding is called minimum-weight decoding. Maximum-likelihood (ML) decoding (a.k.a. degenerate maximum-likelihood decoding), i.e., the process of finding the most likely error class (up to degeneracy of errors), is \(\#P\)-complete in the worst case [478]. Decoding a random qubit stabilizer code (i.e., the learning stabilizers with noise, or LSN, problem [479]) is at least as hard as decoding a random classical code at constant rate [480].Incorporating faulty syndrome measurements can be done by performing spacetime decoding, i.e., using data from past rounds for decoding syndromes in any given round. If a decoder does not process syndrome data sufficiently quickly, it can lead to the backlog problem [481], slowing down the computation.Splitting decoders [482].Trellis decoder, which builds a compact representation of the algebraic structure of the normalizer \(\mathsf{N(S)}\) [483].Quantum extension of GRAND decoder [484].Deep neural-network probabilistic decoder [485].Generalized belief propagation (GBP) [337] based on a classical version [338].Integer optimization decoder [486].Autonomous Lindbladian based decoders for codes encoding a single logical qubit [487].For codes encoding a single logical qubit, logical information can be extracted by single-qubit operations and classical communication [488].Correlated decoding can improve performance of Clifford and non-Clifford entangling gates [489].Detector graphs [87,158] and detector error models [235] can be used to design syndrome extraction circuits and logical measurements.Fault-tolerant constant-depth unencoder transforming logical states into physical states using single-qubit measurements [490].Degenerate erasure decoder showing near ML decoding for various codes [491].Tensor-network decoder for non-Markovian noise [492].Delayed-erasure conversion decoder [493].Trickle-down dissipative correction [494].
Qudit-into-oscillator code Given an encoding of a finite-dimensional code, a decoder that yields the optimal entanglement fidelity can be obtained by solving a semi-definite program [31,32] (see also Ref. [34]). This approximate QEC technique can be adapted to bosonic codes as long as they are restricted to a finite-dimensional subspace of the oscillator Hilbert space [90].
Raussendorf-Bravyi-Harrington (RBH) cluster-state code MBQC syndrome extraction consists of single-qubit measurements and classical post-processing. The six \(X\)-measurements of qubits on the faces of a cube of the bcc lattice multiply to the product of the six cluster-state stabilizers whose vertices are on the faces of the cube. Such measurements, if done on a 2D slice, also yield \(Z\)-type syndromes on the next slice.Minimum weight perfect-matching (MWPM) [78,278] (based on work by Edmonds on finding a matching in a graph [279,280]).
Recursive 3D self-correcting code Renormalization-group-like decoder whose locally computable coarse-graining maps apply a correction at one level and pass the residual syndrome to the previous level [495; Sec. 4]. For \(X\)-type errors, coarse-graining at least halves the syndrome weight across an \(X\)-iteration and does not increase it across a \(Z\)-iteration [495; Thms. 4.6 and 4.7].
Rotated surface code Only certain syndrome extraction schedules are distance-preserving [496].Local neural-network using 3D convolutions, combined with a separate global decoder [317].Iterative CNOT decoder [497].Fault-tolerant BP (FTBP) decoder [498].Frontier decoder, a pruned dynamic-programming decoder [246].
Singleton-bound approaching AQECC Efficient decoder based on quantum list decoding together with purity-testing and robust-secret-sharing post-processing [198].
Spacetime circuit code A most-likely error decoder for the spacetime code can be converted into a most-likely fault decoder for the underlying circuit [499].Efficient decoders can be constructed for some circuits, especially when the resulting outcome and spacetime codes are LDPC [499].
Spin cat code Measurement-free error correction protocol [500].
Square-lattice GKP code Syndrome measurement can be done by applying a controlled displacement controlled by an ancilla qubit. The syndrome information can be obtained by measuring the ancilla qubit after the controlled-displacement operation; see [501; Sec. 2D].Decoder [502] based on Knill error correction (a.k.a. telecorrection [101]), which is based on teleportation [102,103].Pauli \(X\), \(Y\), and \(Z\) measurements can be performed by measuring \(-\hat{p}\), \(\hat{x}-\hat{p}\), and \(\hat{x}\), respectively. If the measurement outcome is close to an even multiple of \(\sqrt{\pi}\), then the outcome is +1. If the measurement outcome is close to an odd multiple of \(\sqrt{\pi}\), then the outcome is -1; see [501; Sec. 2D].Reinforcement learning decoder that uses only one ancilla qubit [503]. It has been extended to utilize previously measured syndrome information [504].Knill and Steane error correction have been analytically compared [505].
Square-lattice TQD code A minimum-weight perfect-matching just-in-time decoder commits the required \(X\) corrections using only the syndrome history available at each time step [506].A completing-the-loop and graph-reduction heuristic uses the committed \(X\) corrections to reweight the subsequent global decoder for twisted \(Z\) errors [506].
Square-octagon (4.8.8) color code Fault-tolerant syndrome extraction circuits [507].Matching decoder [508,509].Integer-program (IP) decoder [507].Two-copy surface-code decoder [510].
Squeezed-coherent BPSK c-q modulation format Homodyne detection realizes the field-quadrature measurement advantage of antipodal TCS signals in the ideal model [511].Homodyne and heterodyne receivers for squeezed-state modulation are treated in Ref. [197; Ch. 5].
Squeezed-vacuum code The interleaved photon-number structure, with support on distinct classes modulo \(2m\), enables photon-number-resolving measurements to identify single-photon loss events, which can then be corrected.
Stabilizer code The structure of stabilizer codes allows for straightforward syndrome-based decoding because the stabilizer generators serve as the code’s check operators, and their eigenvalues serve as the error syndromes. The error correction process involves measuring the stabilizer generators and applying correcting Pauli-type operators based on the measurement outcomes.
String-net code Syndrome measurement circuits analyzed in Ref. [512].Clustering decoder [177].
Subsystem Hypergraph Product Simplex (SHYPS) code BPLSD decoder [513].
Subsystem QECC Petz recovery map provides a recovery operation that is near-optimal for certain subsystem codes [53].
Subsystem color code Clustering decoder [514].Erasure decoder [515].Gauge-fixing decoders [515,516].
Subsystem hypergraph product (SHP) code Efficient decoder [209].
Subsystem modular-qudit CSS code Steane-type decoder utilizing data from the underlying classical codes [517].
Subsystem modular-qudit stabilizer code Syndrome measurements are obtained by first measuring gauge operators of the code and taking their products, which give the stabilizer measurement outcomes. The order in which gauge operators are measured is important since they do not commute. There is a necessary and sufficient condition for inferring the stabilizer syndrome from the measurements of the gauge generators [19; Appendix].Decoder for certain geometrically local subsystem codes from hypergraphs [210].
Subsystem qubit CSS code Steane-type decoder utilizing data from the underlying classical codes [517].
Tensor-network code The decoder is created by creating a decoding quantum circuit with dangling legs replaced with input/output wires, and tensors converted to unitary gates. Maximum likelihood decoding can be used when the tensors are stabilizer codes.Tensor-network decoder when the tensor network is contractible via stabilizer isometries [518]. Independent logical qubits can be decoded in parallel [519].Tensor-network-based decoder when the encoding unitary is known [106].
Tetron subsystem code BP-OSD decoder [361], run with belief propagation in the product-sum mode, ordered-statistics post-processing in combination-sweep mode, at most five iterations, and search depth \(2n+1\) for \(n\) tetrons [520].
Transversal-\(CCZ\) Reed-Solomon cubical sheaf code Constant-depth single-shot decoder based on parallel local flips for the construction of an earlier arXiv version of Ref. [521][522; Lemmas 6.8 and 6.11].
Triangular surface code The decoding uses a single decoding graph since the triangle code is not a CSS code. Nodes of the graph are located at each stabilizer (center of the triangle graph) and have red or blue edges, where red associates with \(X\) errors and blue with \(Z\) errors. To take into account any errors from measuring the error syndrome, a three-dimensional stack of decoding graphs is laid on top of the code with vertical edges connecting qubits between layers [523].
Tricycle code BP+LSD decoding combined with cluster-based post-selection [524]. With full error detection, a \([[48,6,(8,4)]]\) code reaches logical error rates of about \(6\times 10^{-10}\) at a \(30\%\) acceptance fraction [524]. MWPM decoder for \(Z\)-type errors of codes with binomial elements, whose \(X\)-type check matrix has column weight two [525].
Triorthogonal code Steane error correction [526].
Twist-defect surface code The gauge-operator measurement schedule of Ref. [527] keeps twist defects decodable by minimum-weight perfect matching, unlike earlier nearest-neighbor schedules that give up matching-based decoding [159].
Twisted XZZX toric code Fault-tolerant syndrome extraction circuits using flag qubits [528].AMBP4, a quaternary version [241] of the MBP decoder [242].Fault-tolerant BP (FTBP) decoder [498].
Two-branch coset CSS code Joint belief propagation with low-complexity deterministic post-processing [529]. For the \([[10240,4108,10 \leq d \leq 32]]\) code, this decoder reaches a frame error rate of \(10^{-7}\) at depolarizing probability \(p=0.058\) [529].
Two-component cat code All-optical decoder [530] based on Knill error correction (a.k.a. telecorrection [101]), which is based on teleportation [102,103].
Union stabilizer (USt) code Error-detection algorithm [118–120].
Very small logical qubit (VSLQ) code The logical qubit can be measured with physical qubit measurements along \(X\). Can be implemented by engineering a coupling of one of the qubits to a readout cavity via the interaction \(\sigma_x (a+a^\dagger)\) [531]. Modulating this coupling at the cavity frequency results in an \(X\)-dependent displacement of the readout cavity field which can be measured.Star-code autonomous correction scheme [532].
Wasilewski-Banaszek code Destructive measurement with photon number measurements on each mode.
X-cube Floquet code Period-six measurement sequence utilizing two-qubit measurements [533].A rewinding period-six schedule \(GBRBGR\) yields ISGs FDLQC-equivalent to the X-cube model together with a 3D surface-code factor and/or a 3-foliated stack of 2D surface codes [534].
X-cube model code Parallelized matching decoder [535].
XYZ color code Efficient ML decoder at infinite bias [536].Cellular-automaton decoder [536].
XYZ\(^2\) hexagonal stabilizer code Maximum-likelihood decoding using the EWD decoder [537].Sequential decoder [538].
XZZX surface code MWPM decoder, which can be used for \(X\) and \(Z\) noise. For \(Y\) noise, a variant of the matching decoder could be used like it is used for the XY code in Ref. [539]. Decoding complexity scales as order \(O(n^3)\) because the code is non-CSS [241][539; Supplement].
Yoked surface code Soft information from the outer surface codes can be utilized via a message passing algorithm [147].Yokes can be measured using lattice surgery [540].
\(((9,12,3))\) qubit code Fault-tolerant scheme that converts the required POVM into 10 binary measurements whose redundancy is guaranteed by a classical code [92].
\((2,2)\) Loop toric code A local recovery procedure that dispenses with fast classical processing, and can even be formulated without explicit measurements, is possible when the code is realized in four or more spatial dimensions [78].Single-shot repair-syndrome decoder for the open-boundary/tesseract code, followed by RG decoding on the repaired syndrome [233].Local automaton decoder [541] based on Toom’s rule for the classical 2D repetition code [542–545].Local automaton decoder obtained from reinforcement learning [546].
\([[1152,580,\leq 12]]\) co-designed Kasai code Hierarchical decoder combining the throughput of belief propagation with an exact integer-programming fallback [391].
\([[12,2,4]]\) carbon code Syndrome extraction circuit based on Knill error correction (a.k.a. telecorrection [101]), but using only one ancillary code block instead of two [547; Fig. 5].
\([[132,30,12]]\) self-dual GALA code At physical error rate \(10^{-3}\), a two-stage Relay-BP cascade with a mixed-integer linear-programming fallback ran five million circuit-level shots without a recorded logical failure [220].
\([[144,12,12]]\) gross code The GDG sliding-window decoder [456], with a realization achieving a worst-case decoding latency of 3ms per window.AC decoder is faster than ordinary BP-OSD with no reduction of fidelity [448].Transformer-based neural-network decoder [96].Frontier decoder, a pruned dynamic-programming decoder, retains on average fewer than 100 states under circuit-level noise at \(p=10^{-3}\) [246].
\([[15,1,3]]\) quantum RM code Decoding has been studied for the BP, BP+OSD, and AutDEC decoders [95].An exact ML decoder based on the Walsh-Hadamard transform was developed for error correction and gauge fixing in the alternating Steane/\([[15,1,3]]\) Clifford + \(T\) protocol [166].
\([[16,6,4]]\) Tesseract color code Post-selected fault-tolerant syndrome extraction [548,549].
\([[23, 1, 7]]\) Quantum Golay code Meggitt decoding for the cyclic CSS structure was used in comparative logical-CNOT simulations [75].
\([[2^r-1, 2^r-2r-1, 3]]\) quantum Hamming code Efficient decoder [550].
\([[2m,2m-2,2]]\) error-detecting code The \([[2m,2m-2,2]]\) error-detecting code [551] and its relative the code with single stabilizer \(XX\cdots X\) [552] admit autonomous QEC against single AD errors.
\([[3,1,2]]_3\) Three-qutrit code The quantum information (the secret) can be recovered from a unitary transformation acting on only two qutrits, \( U_{ij} \otimes I \), where \(U_{ij}\) acts on qutrits \(i,j\) and \(I\) is the identity on the remaining qutrit. By the cyclic structure of the codewords, this unitary transformation performs a permutation that recovers the information and stores it in one of the two qutrits involved in recovery.
\([[30,8,3]]\) Bring code Fault-tolerant parity-check schedules whose performance is similar to those of the surface-17 code, but with qubit overhead reduced by a factor of 2.6 [553].
\([[4,2,2]]\) Four-qubit code Erasure decoder [554].
\([[47,1,11]]\) quantum QR code Algebraic decoder [75].
\([[5,1,3]]\) Five-qubit perfect code Ideal transversal computational-basis measurement distinguishes logical basis states by the parity of the outcome string, but this is not a fault-tolerant measurement gadget because a single faulty measurement bit can flip the decoded logical outcome [468; Sec. 11.4].Fault-tolerant syndrome extraction circuits [555,556].Syndrome extraction circuit optimized for a linear qubit architecture [557].Combined dynamical decoupling and error correction protocol on individually-controlled qubits with always-on Ising couplings [558].Syndrome extraction circuit using only CNOT-SWAP gates [559].Symmetric decoder correcting all weight-one Pauli errors. The resulting logical error channel after coherent noise has been explicitly derived [560].Inspired by the honeycomb Floquet code, various weight-two measurement schemes have been designed [561].
\([[5,1,3]]_{\mathbb{R}}\) Braunstein five-mode code Error correction can be done using linear-optical elements and feedback [562].
\([[5,1,3]]_{\mathbb{Z}_q}\) modular-qudit code Decoder for prime-dimensional qudits [563].
\([[6,1,3]]\) Six-qubit stabilizer code Fault-tolerant syndrome extraction using a single ancilla [564].
\([[6,4,2]]\) error-detecting code Efficient decoder for the many-hypercube code [565].
\([[7,1,3]]\) Steane code Shor error correction fidelity calculation [566–568].A \([15,3]\) syndrome-measurement code yields a QDS extension that uses the same 15 measurements as five-fold repetition of the three syndrome bits while achieving lower syndrome-decoding error [406; Fig. 1].Fault-tolerant measurement-free error-correction cycle [427].
\([[7,1,3]]\) bare code Fault-tolerant syndrome extraction using a single ancilla [569].
\([[72,12,6]]\) half-gross code Frontier decoder, a pruned dynamic-programming decoder, under circuit-level noise [246].
\([[8, 3, 3]]\) Eight-qubit Gottesman code Weight-one lookup-table decoder built from the distinct syndromes of the 24 weight-one Pauli errors [570; Sec. III.A].Bitwise majority vote over repeated syndrome measurement rounds under phenomenological measurement noise [570; Sec. III.A].
\([[8,2,3]]\) Hermitian code Short Shor-style syndrome extraction circuits can be used for syndrome-based decoding [548].
\([[9,1,3]]\) Shor code Bit- and phase-flip circuits utilize CNOT and Hadamard gates [571; Fig. 10.6].
\([[9,1,3]]\) Surface-17 code Lookup table [496].Syndrome extraction using Toffoli gates and qubit reset [572].
\([[9,1,3]]_{\mathbb{R}}\) Lloyd-Slotine code Syndromes are real-valued, and decoding is done by a continuous version of majority voting (a.k.a. triple modular redundancy).
\([[9,1,4,3]]\) Nine-qubit Bacon-Shor code Message passing for \([[9,1,4,3]]\) Bacon-Shor code [573].
\(\chi^{(2)}\) code Linear optics and \(\chi^{(2)}\) interactions.
List (property_set_excluding_descendants): All codes with Decoding that are not descendants of Error-correcting code (ECC).

References

  1. [1]

    N. Delfosse, “Decoding color codes by projection onto surface codes”, Physical Review A 89, (2014) arXiv:1308.6207 DOI

  2. [2]

    A. M. Stephens, “Efficient fault-tolerant decoding of topological color codes”, (2014) arXiv:1402.3037

  3. [3]

    M. Walters and M. L. Turner, “Minimum Weight Decoding in the Colour Code is NP-hard”, (2026) arXiv:2603.04234

  4. [4]

    S. Gu, L. Wang, and A. Kubica, “The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding”, (2026) arXiv:2603.22064

  5. [5]

    C. Gidney and C. Jones, “New circuits and an open source decoder for the color code”, (2023) arXiv:2312.08813

  6. [6]

    S.-H. Lee, A. Li, and S. D. Bartlett, “Color code decoder with improved scaling for correcting circuit-level noise”, Quantum 9, 1609 (2025) arXiv:2404.07482 DOI

  7. [7]

    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

  8. [8]

    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

  9. [9]

    G. Duclos-Cianci and D. Poulin, “A renormalization group decoding algorithm for topological quantum codes”, (2010) arXiv:1006.1362

  10. [10]

    C. T. Chubb and S. T. Flammia, “Statistical mechanical models for quantum codes with correlated noise”, Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions 8, 269 (2021) arXiv:1809.10704 DOI

  11. [11]

    E. Lake, S. Balasubramanian, and S. Choi, “Exact Quantum Algorithms for Quantum Phase Recognition: Renormalization Group and Error Correction”, PRX Quantum 6, (2025) arXiv:2211.09803 DOI

  12. [12]

    W. Zhong, O. Shtanko, and R. Movassagh, “Advantage of Quantum Neural Networks as Quantum Information Decoders”, (2024) arXiv:2401.06300

  13. [13]

    A. Lavasani and S. Vijay, “The Stability of Gapped Quantum Matter and Error-Correction with Adiabatic Noise”, (2024) arXiv:2402.14906

  14. [14]

    A. Kay, “Nonequilibrium Reliability of Quantum Memories”, Physical Review Letters 102, (2009) arXiv:0807.0287 DOI

  15. [15]

    F. Pastawski, A. Kay, N. Schuch, and I. Cirac, “Limitations of Passive Protection of Quantum Information”, (2009) arXiv:0911.3843

  16. [16]

    A. Kay, “Capabilities of a Perturbed Toric Code as a Quantum Memory”, Physical Review Letters 107, (2011) arXiv:1107.3940 DOI

  17. [17]

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

  18. [18]

    S. J. S. Tan, I. Gill, E. Huang, P. Liu, C. Zhao, H. Dehghani, A. Kubica, H. Zhou, and A. Dua, “Generalized matching decoders for 2D topological translationally-invariant codes”, (2026) arXiv:2603.05402

  19. [19]

    M. Suchara, S. Bravyi, and B. Terhal, “Constructions and noise threshold of topological subsystem codes”, Journal of Physics A: Mathematical and Theoretical 44, 155301 (2011) arXiv:1012.0425 DOI

  20. [20]

    A. B. Aloshious and P. K. Sarvepalli, “Projecting three-dimensional color codes onto three-dimensional toric codes”, Physical Review A 98, (2018) arXiv:1606.00960 DOI

  21. [21]

    F. Butt, L. Esser, and M. Müller, “Decoding 3D color codes with boundaries”, (2025) arXiv:2512.13436

  22. [22]

    T. R. Scruby and K. Nemoto, “Local Probabilistic Decoding of a Quantum Code”, Quantum 7, 1093 (2023) arXiv:2212.06985 DOI

  23. [23]

    C. Piveteau, C. T. Chubb, and J. M. Renes, “Tensor-Network Decoding Beyond 2D”, PRX Quantum 5, (2024) arXiv:2310.10722 DOI

  24. [24]

    A. Kulkarni and P. K. Sarvepalli, “Decoding the three-dimensional toric codes and welded codes on cubic lattices”, Physical Review A 100, (2019) arXiv:1808.03092 DOI

  25. [25]

    N. Delfosse and G. Zémor, “Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel”, Physical Review Research 2, (2020) arXiv:1703.01517 DOI

  26. [26]

    O. Weißl and E. Egorov, “An Equivariant Machine Learning Decoder for 3D Toric Codes”, 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC) 672 (2025) arXiv:2409.04300 DOI

  27. [27]

    S. Miao, J. Mandelbaum, H. Jäkel, and L. Schmalen, “A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes”, (2024) arXiv:2401.06874

  28. [28]

    L. Golowich and V. Guruswami, “Decoding Quasi-Cyclic Quantum LDPC Codes”, (2024) arXiv:2411.04464

  29. [29]

    S. X. Cui, C. Galindo, and D. Romero, “Abelian Group Quantum Error Correction in Kitaev’s Model”, (2024) arXiv:2404.08552

  30. [30]

    P. W. Shor, G. Smith, J. A. Smolin, and B. Zeng, “High performance single-error-correcting quantum codes for amplitude damping”, (2009) arXiv:0907.5149

  31. [31]

    K. Audenaert and B. De Moor, “Optimizing completely positive maps using semidefinite programming”, Physical Review A 65, (2002) arXiv:quant-ph/0109155 DOI

  32. [32]

    M. Reimpell and R. F. Werner, “Iterative Optimization of Quantum Error Correcting Codes”, Physical Review Letters 94, (2005) arXiv:quant-ph/0307138 DOI

  33. [33]

    N. Yamamoto, S. Hara, and K. Tsumura, “Suboptimal quantum-error-correcting procedure based on semidefinite programming”, Physical Review A 71, (2005) arXiv:quant-ph/0606105 DOI

  34. [34]

    A. S. Fletcher, “Channel-Adapted Quantum Error Correction”, (2007) arXiv:0706.3400

  35. [35]

    A. S. Fletcher, P. W. Shor, and M. Z. Win, “Structured near-optimal channel-adapted quantum error correction”, Physical Review A 77, (2008) arXiv:0708.3658 DOI

  36. [36]

    G. Balló and P. Gurin, “Robustness of channel-adapted quantum error correction”, Physical Review A 80, (2009) arXiv:0905.3838 DOI

  37. [37]

    P. Hayden, M. Horodecki, A. Winter, and J. Yard, “A Decoupling Approach to the Quantum Capacity”, Open Systems &amp; Information Dynamics 15, 7 (2008) arXiv:quant-ph/0702005 DOI

  38. [38]

    F. Dupuis, “The decoupling approach to quantum information theory”, (2010) arXiv:1004.1641

  39. [39]

    F. Dupuis, M. Berta, J. Wullschleger, and R. Renner, “One-Shot Decoupling”, Communications in Mathematical Physics 328, 251 (2014) arXiv:1012.6044 DOI

  40. [40]

    I. Cong, S. Choi, and M. D. Lukin, “Quantum convolutional neural networks”, Nature Physics 15, 1273 (2019) arXiv:1810.03787 DOI

  41. [41]

    D. F. Locher, L. Cardarelli, and M. Müller, “Quantum Error Correction with Quantum Autoencoders”, Quantum 7, 942 (2023) arXiv:2202.00555 DOI

  42. [42]

    D. W. Leung, M. A. Nielsen, I. L. Chuang, and Y. Yamamoto, “Approximate quantum error correction can lead to better codes”, Physical Review A 56, 2567 (1997) arXiv:quant-ph/9704002 DOI

  43. [43]

    M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2012) DOI

  44. [44]

    C. Bény and O. Oreshkov, “General Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels”, Physical Review Letters 104, (2010) arXiv:0907.5391 DOI

  45. [45]

    C. Cafaro and P. van Loock, “Approximate quantum error correction for generalized amplitude-damping errors”, Physical Review A 89, (2014) arXiv:1308.4582 DOI

  46. [46]

    S. Dutta, D. Biswas, and P. Mandayam, “Noise-adapted qudit codes for amplitude-damping noise”, Physical Review A 111, (2025) arXiv:2406.02444 DOI

  47. [47]

    D. Petz, “Sufficient subalgebras and the relative entropy of states of a von Neumann algebra”, Communications in Mathematical Physics 105, 123 (1986) DOI

  48. [48]

    D. PETZ, “SUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS”, The Quarterly Journal of Mathematics 39, 97 (1988) DOI

  49. [49]

    H. Kwon and M. S. Kim, “Fluctuation Theorems for a Quantum Channel”, Physical Review X 9, (2019) arXiv:1810.03150 DOI

  50. [50]

    H. Barnum and E. Knill, “Reversing quantum dynamics with near-optimal quantum and classical fidelity”, Journal of Mathematical Physics 43, 2097 (2002) arXiv:quant-ph/0004088 DOI

  51. [51]

    G. Zheng, W. He, G. Lee, and L. Jiang, “Near-Optimal Performance of Quantum Error Correction Codes”, Physical Review Letters 132, (2024) arXiv:2401.02022 DOI

  52. [52]

    H. K. Ng and P. Mandayam, “Simple approach to approximate quantum error correction based on the transpose channel”, Physical Review A 81, (2010) arXiv:0909.0931 DOI

  53. [53]

    P. Mandayam and H. K. Ng, “Towards a unified framework for approximate quantum error correction”, Physical Review A 86, (2012) arXiv:1202.5139 DOI

  54. [54]

    B. Li, Z. Wang, G. Zheng, Y. Wong, and L. Jiang, “Optimality Condition for the Petz Map”, Physical Review Letters 134, (2025) arXiv:2410.23622 DOI

  55. [55]

    O. Fawzi and R. Renner, “Quantum Conditional Mutual Information and Approximate Markov Chains”, Communications in Mathematical Physics 340, 575 (2015) arXiv:1410.0664 DOI

  56. [56]

    M. Junge, R. Renner, D. Sutter, M. M. Wilde, and A. Winter, “Universal Recovery Maps and Approximate Sufficiency of Quantum Relative Entropy”, Annales Henri Poincaré 19, 2955 (2018) arXiv:1509.07127 DOI

  57. [57]

    S. T. Flammia, J. Haah, M. J. Kastoryano, and I. H. Kim, “Limits on the storage of quantum information in a volume of space”, Quantum 1, 4 (2017) arXiv:1610.06169 DOI

  58. [58]

    Y. Hu and Y. Zou, “Petz map recovery for long-range entangled quantum many-body states”, Physical Review B 110, (2024) arXiv:2408.00857 DOI

  59. [59]

    T. Utsumi and Y. Nakata, “Explicit decoders using fixed-point amplitude amplification based on QSVT”, Quantum 10, 2024 (2026) arXiv:2405.06051 DOI

  60. [60]

    N. Basak, A. Tanggara, A. Mohan, G. Paul, and K. Bharti, “Approximate Dynamical Quantum Error-Correcting Codes”, (2025) arXiv:2502.09177

  61. [61]

    D. Biswas and P. Mandayam, “Universal syndrome-based recovery for noise-adapted quantum error correction”, (2026) arXiv:2510.08719

  62. [62]

    G. Bai, F. Buscemi, and V. Scarani, “Quantum Bayes’ Rule and Petz Transpose Map from the Minimum Change Principle”, Physical Review Letters 135, (2025) arXiv:2410.00319 DOI

  63. [63]

    B. Yoshida and A. Kitaev, “Efficient decoding for the Hayden-Preskill protocol”, (2017) arXiv:1710.03363

  64. [64]

    S. Dutta, A. Jain, and P. Mandayam, “Smallest quantum codes for amplitude-damping noise”, Physical Review Research 8, (2026) arXiv:2410.00155 DOI

  65. [65]

    K. Brechtelsbauer, F. Butt, D. F. Locher, S. H. Quintero, S. Weber, M. Müller, and H. P. Büchler, “Measurement-Free Quantum Error Correction Optimized for Biased Noise”, PRX Quantum 6, (2025) arXiv:2505.15669 DOI

  66. [66]

    K. Tsujino, D. Fukuda, G. Fujii, S. Inoue, M. Fujiwara, M. Takeoka, and M. Sasaki, “Quantum Receiver beyond the Standard Quantum Limit of Coherent Optical Communication”, Physical Review Letters 106, (2011) arXiv:1103.5592 DOI

  67. [67]

    R. S. Kennedy, “A near-optimum receiver for the binary coherent state quantum channel”, Quarterly Progress Report 108, 219-225 (1973)

  68. [68]

    M. Takeoka and M. Sasaki, “Discrimination of the binary coherent signal: Gaussian-operation limit and simple non-Gaussian near-optimal receivers”, Physical Review A 78, (2008) arXiv:0706.1038 DOI

  69. [69]

    C. Wittmann, U. L. Andersen, and G. Leuchs, “Discrimination of optical coherent states using a photon number resolving detector”, Journal of Modern Optics 57, 213 (2010) arXiv:0905.2496 DOI

  70. [70]

    C. Wittmann, U. L. Andersen, M. Takeoka, D. Sych, and G. Leuchs, “Demonstration of Coherent-State Discrimination Using a Displacement-Controlled Photon-Number-Resolving Detector”, Physical Review Letters 104, (2010) arXiv:0906.2859 DOI

  71. [71]

    M. T. DiMario and F. E. Becerra, “Robust Measurement for the Discrimination of Binary Coherent States”, Physical Review Letters 121, (2018) arXiv:1807.05199 DOI

  72. [72]

    D. Sych and G. Leuchs, “Practical Receiver for Optimal Discrimination of Binary Coherent Signals”, Physical Review Letters 117, (2016) arXiv:1404.5033 DOI

  73. [73]

    A. Warke, J. Nötzel, K. Takase, W. Asavanant, H. Nagayoshi, K. Fukui, S. Takeda, A. Furusawa, and P. van Loock, “Photonic Quantum Receiver Attaining the Helstrom Bound”, (2024) arXiv:2410.21800

  74. [74]

    C. Cui, J. Postlewaite, B. N. Saif, L. Fan, and S. Guha, “Superadditive communication with the green machine as a practical demonstration of nonlocality without entanglement”, Nature Communications 16, (2025) arXiv:2310.05889 DOI

  75. [75]

    A. W. Cross, D. P. DiVincenzo, and B. M. Terhal, “A comparative code study for quantum fault-tolerance”, (2009) arXiv:0711.1556

  76. [76]

    S. Huang, K. R. Brown, and M. Cetina, “Comparing Shor and Steane Error Correction Using the Bacon-Shor Code”, (2023) arXiv:2312.10851

  77. [77]

    G. Escobar-Arrieta and M. Gutiérrez, “Improved performance of the Bacon-Shor code with Steane’s syndrome extraction method”, Physical Review A 111, (2025) arXiv:2403.01659 DOI

  78. [78]

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory”, Journal of Mathematical Physics 43, 4452 (2002) arXiv:quant-ph/0110143 DOI

  79. [79]

    A. T. Schmitz, “Thermal Stability of Dynamical Phase Transitions in Higher Dimensional Stabilizer Codes”, (2020) arXiv:2002.11733

  80. [80]

    H. Bombin, “Topological subsystem codes”, Physical Review A 81, (2010) arXiv:0908.4246 DOI

  81. [81]

    M. B. Hastings, J. Haah, and R. O’Donnell, “Fiber bundle codes: breaking the n \({}^{1/2}\) polylog( n ) barrier for Quantum LDPC codes”, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing 1276 (2021) arXiv:2009.03921 DOI

  82. [82]

    M. B. Hastings and J. Haah, “Dynamically Generated Logical Qubits”, Quantum 5, 564 (2021) arXiv:2107.02194 DOI

  83. [83]

    M. Li, D. Miller, and K. R. Brown, “Direct measurement of Bacon-Shor code stabilizers”, Physical Review A 98, (2018) arXiv:1804.01127 DOI

  84. [84]

    G. Sarma and H. Mabuchi, “Gauge subsystems, separability and robustness in autonomous quantum memories”, New Journal of Physics 15, 035014 (2013) arXiv:1212.3564 DOI

  85. [85]

    P. Panteleev and G. Kalachev, “Degenerate Quantum LDPC Codes With Good Finite Length Performance”, Quantum 5, 585 (2021) arXiv:1904.02703 DOI

  86. [86]

    T. Müller, T. Alexander, M. E. Beverland, M. Bühler, B. R. Johnson, T. Maurer, and D. Vandeth, “Improved belief propagation is sufficient for real-time decoding of quantum memory”, (2025) arXiv:2506.01779

  87. [87]

    C. Gidney, “Stim: a fast stabilizer circuit simulator”, Quantum 5, 497 (2021) arXiv:2103.02202 DOI

  88. [88]

    J. I. Farran, “Decoding Algebraic Geometry codes by a key equation”, (1999) arXiv:math/9910151

  89. [89]

    A. Niehage, “Quantum Goppa Codes over Hyperelliptic Curves”, (2005) arXiv:quant-ph/0501074

  90. [90]

    V. V. Albert et al., “Performance and structure of single-mode bosonic codes”, Physical Review A 97, (2018) arXiv:1708.05010 DOI

  91. [91]

    M. H. Michael, M. Silveri, R. T. Brierley, V. V. Albert, J. Salmilehto, L. Jiang, and S. M. Girvin, “New Class of Quantum Error-Correcting Codes for a Bosonic Mode”, Physical Review X 6, (2016) arXiv:1602.00008 DOI

  92. [92]

    Y. Ouyang, “Robust projective measurements through measuring code-inspired observables”, npj Quantum Information 10, (2024) arXiv:2402.04093 DOI

  93. [93]

    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

  94. [94]

    A. G. Fowler, A. M. Stephens, and P. Groszkowski, “High-threshold universal quantum computation on the surface code”, Physical Review A 80, (2009) arXiv:0803.0272 DOI

  95. [95]

    S. Koutsioumpas, H. Sayginel, M. Webster, and Dan E Browne, “Automorphism Ensemble Decoding of Quantum LDPC Codes”, (2025) arXiv:2503.01738

  96. [96]

    J. Blue, H. Avlani, Z. He, L. Ziyin, and I. L. Chuang, “Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes”, Quantum 10, 2149 (2026) arXiv:2504.13043 DOI

  97. [97]

    K. Sahay, D. J. Williamson, and B. J. Brown, “A matching decoder for bivariate bicycle codes”, (2026) arXiv:2602.22770

  98. [98]

    A. Leverrier, “Bosonic quantum Fourier codes”, Quantum 10, 2000 (2026) arXiv:2505.16618 DOI

  99. [99]

    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

  100. [100]

    S. Kwon, S. Watabe, and J.-S. Tsai, “Autonomous quantum error correction in a four-photon Kerr parametric oscillator”, npj Quantum Information 8, (2022) arXiv:2203.09234 DOI

  101. [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. [102]

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

  103. [103]

    E. Knill, “Scalable Quantum Computation in the Presence of Large Detected-Error Rates”, (2004) arXiv:quant-ph/0312190

  104. [104]

    A. Udupa, T. Hillmann, R. G. Ahmed, A. Smirne, and G. Ferrini, “Performance of rotation-symmetric bosonic codes in the presence of random telegraph noise”, (2025) arXiv:2505.08670

  105. [105]

    A. J. Ferris and D. Poulin, “Branching MERA codes: a natural extension of polar codes”, (2013) arXiv:1312.4575

  106. [106]

    A. J. Ferris and D. Poulin, “Tensor Networks and Quantum Error Correction”, Physical Review Letters 113, (2014) arXiv:1312.4578 DOI

  107. [107]

    M. Davydova, A. Bauer, J. C. Magdalena de la Fuente, M. Webster, D. J. Williamson, and B. J. Brown, “Universal Fault-Tolerant Quantum Computation in 2D without Getting Tied in Knots”, Physical Review X 16, (2026) arXiv:2503.15751 DOI

  108. [108]

    T. Camara, H. Ollivier, and J.-P. Tillich, “Constructions and performance of classes of quantum LDPC codes”, (2005) arXiv:quant-ph/0502086

  109. [109]

    E. T. Campbell, “A theory of single-shot error correction for adversarial noise”, Quantum Science and Technology 4, 025006 (2019) arXiv:1805.09271 DOI

  110. [110]

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

  111. [111]

    J. Zhao, Y.-C. Wu, and G.-P. Guo, “Quantum memory error correction computation based on Chamon model”, (2023) arXiv:2303.05267

  112. [112]

    B. J. Brown, “Conservation Laws and Quantum Error Correction: Toward a Generalized Matching Decoder”, IEEE BITS the Information Theory Magazine 2, 5 (2022) arXiv:2207.06428 DOI

  113. [113]

    S. Bravyi and J. Haah, “Quantum Self-Correction in the 3D Cubic Code Model”, Physical Review Letters 111, (2013) arXiv:1112.3252 DOI

  114. [114]

    Z. Schwartzman-Nowik and B. J. Brown, “Generalizing the matching decoder for the Chamon code”, Quantum 9, 1775 (2025) arXiv:2411.03443 DOI

  115. [115]

    O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, and E. T. Campbell, “Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes”, Physical Review X 13, (2023) arXiv:2203.04948 DOI

  116. [116]

    T. C. Bohdanowicz, E. Crosson, C. Nirkhe, and H. Yuen, “Good approximate quantum LDPC codes from spacetime circuit Hamiltonians”, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing 481 (2019) arXiv:1811.00277 DOI

  117. [117]

    M. Takeoka, H. Krovi, and S. Guha, “Achieving the Holevo capacity of a pure state classical-quantum channel via unambiguous state discrimination”, 2013 IEEE International Symposium on Information Theory 166 (2013) DOI

  118. [118]

    Y. Li, I. Dumer, and L. P. Pryadko, “Clustered Error Correction of Codeword-Stabilized Quantum Codes”, Physical Review Letters 104, (2010) arXiv:0907.2038 DOI

  119. [119]

    Y. Li, I. Dumer, M. Grassl, and L. P. Pryadko, “Clustered bounded-distance decoding of codeword-stabilized quantum codes”, 2010 IEEE International Symposium on Information Theory 2662 (2010) DOI

  120. [120]

    Y. Li, “Codeword Stabilized Quantum Codes and Their Error Correction”, PhD thesis, UC Riverside, 2010.

  121. [121]

    Y. Li, I. Dumer, M. Grassl, and L. P. Pryadko, “Structured error recovery for code-word-stabilized quantum codes”, Physical Review A 81, (2010) arXiv:0912.3245 DOI

  122. [122]

    M.-H. Hsieh and S. Yamada, “Quantum Pseudorandom Error-Correcting Codes”, (2026) arXiv:2609.38986

  123. [123]

    R. S. Bondurant, “Near-quantum optimum receivers for the phase-quadrature coherent-state channel”, Optics Letters 18, 1896 (1993) DOI

  124. [124]

    M. V. Jabir, I. A. Burenkov, N. F. R. Annafianto, A. Battou, and S. V. Polyakov, “Experimental demonstration of the near-quantum optimal receiver”, OSA Continuum 3, 3324 (2020) DOI

  125. [125]

    I. A. Burenkov, O. V. Tikhonova, and S. V. Polyakov, “Quantum receiver for large alphabet communication”, Optica 5, 227 (2018) arXiv:1802.08287 DOI

  126. [126]

    I. A. Burenkov, M. V. Jabir, A. Battou, and S. V. Polyakov, “Time-Resolving Quantum Measurement Enables Energy-Efficient, Large-Alphabet Communication”, PRX Quantum 1, (2020) DOI

  127. [127]

    M. V. Jabir, N. F. R. Annafianto, I. A. Burenkov, A. Battou, and S. V. Polyakov, “Energy and bandwidth efficiency optimization of quantum-enabled optical communication channels”, npj Quantum Information 8, (2022) DOI

  128. [128]

    H. Yuen, R. Kennedy, and M. Lax, “Optimum testing of multiple hypotheses in quantum detection theory”, IEEE Transactions on Information Theory 21, 125 (1975) DOI

  129. [129]

    I. A. Burenkov, M. V. Jabir, and S. V. Polyakov, “Practical quantum-enhanced receivers for classical communication”, AVS Quantum Science 3, (2021) DOI

  130. [130]

    S. Guha, “Structured Optical Receivers to Attain Superadditive Capacity and the Holevo Limit”, Physical Review Letters 106, (2011) arXiv:1101.1550 DOI

  131. [131]

    J. S. Sidhu, M. S. Bullock, S. Guha, and C. Lupo, “Linear optics and photodetection achieve near-optimal unambiguous coherent state discrimination”, Quantum 7, 1025 (2023) arXiv:2109.00008 DOI

  132. [132]

    V. P. Belavkin, “Optimal multiple quantum statistical hypothesis testing”, Stochastics 1, 315 (1975) DOI

  133. [133]

    A. S. Kholevo, “On Asymptotically Optimal Hypothesis Testing in Quantum Statistics”, Theory of Probability &amp; Its Applications 23, 411 (1979) DOI

  134. [134]

    P. Hausladen and W. K. Wootters, “A ‘Pretty Good’ Measurement for Distinguishing Quantum States”, Journal of Modern Optics 41, 2385 (1994) DOI

  135. [135]

    Y. C. Eldar and G. D. Forney, “On Quantum Detection and the Square-Root Measurement”, (2000) arXiv:quant-ph/0005132

  136. [136]

    Y. C. Eldar, A. Megretski, and G. C. Verghese, “Optimal Detection of Symmetric Mixed Quantum States”, (2002) arXiv:quant-ph/0211111

  137. [137]

    M. Rosati, “Performance of Coherent Frequency-Shift Keying for Classical Communication on Quantum Channels”, 2021 IEEE International Symposium on Information Theory (ISIT) 902 (2021) arXiv:2203.09822 DOI

  138. [138]

    J. Zhou, S. Chessa, E. Chitambar, and F. Leditzky, “On the distinguishability of geometrically uniform quantum states”, Journal of Physics A: Mathematical and Theoretical 58, 415303 (2025) arXiv:2501.12376 DOI

  139. [139]

    N. Dalla Pozza and G. Pierobon, “Optimality of square-root measurements in quantum state discrimination”, Physical Review A 91, (2015) arXiv:1504.04908 DOI

  140. [140]

    H. Krovi, S. Guha, Z. Dutton, and M. P. da Silva, “Optimal measurements for symmetric quantum states with applications to optical communication”, Physical Review A 92, (2015) arXiv:1507.04737 DOI

  141. [141]

    A. Kubica and N. Delfosse, “Efficient color code decoders in <mml:math xmlns:mml=”http://www.w3.org/1998/Math/MathML”> <mml:mi>d</mml:mi> <mml:mo>&amp;#x2265;</mml:mo> <mml:mn>2</mml:mn> </mml:math> dimensions from toric code decoders”, Quantum 7, 929 (2023) arXiv:1905.07393 DOI

  142. [142]

    M. Li, D. Miller, M. Newman, Y. Wu, and K. R. Brown, “2D Compass Codes”, Physical Review X 9, (2019) arXiv:1809.01193 DOI

  143. [143]

    S. K. Borah, A. K. Pradhan, N. Raveendran, M. Pacenti, and B. Vasic, “Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information”, (2025) arXiv:2505.06385

  144. [144]

    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

  145. [145]

    A. Jain, P. Iyer, S. D. Bartlett, and J. Emerson, “Improved quantum error correction with randomized compiling”, Physical Review Research 5, (2023) arXiv:2303.06846 DOI

  146. [146]

    L. Berent, T. Hillmann, J. Eisert, R. Wille, and J. Roffe, “Analog Information Decoding of Bosonic Quantum Low-Density Parity-Check Codes”, PRX Quantum 5, (2024) arXiv:2311.01328 DOI

  147. [147]

    D. Poulin, “Optimal and efficient decoding of concatenated quantum block codes”, Physical Review A 74, (2006) arXiv:quant-ph/0606126 DOI

  148. [148]

    N. Berthusen, S. J. S. Tan, E. Huang, and D. Gottesman, “Adaptive Syndrome Extraction”, PRX Quantum 6, (2025) arXiv:2502.14835 DOI

  149. [149]

    B. Rahn, A. C. Doherty, and H. Mabuchi, “Exact performance of concatenated quantum codes”, Physical Review A 66, (2002) arXiv:quant-ph/0206061 DOI

  150. [150]

    L. H. English, H. Luo, Y. Wang, B. Srivastava, S. D. Bartlett, and D. J. Williamson, “Duality constrains optimal thresholds in quantum error correction”, (2026) arXiv:2607.21160

  151. [151]

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

  152. [152]

    Z. Lu, W. Li, and D.-L. Deng, “Quantum error correction at ultra-low overhead”, (2026) arXiv:2608.02773

  153. [153]

    A. Aydin, I. Tamo, and A. Barg, “Breaking the bicycle frame: Coset-based quantum LDPC codes”, (2026) arXiv:2606.17268

  154. [154]

    P.-S. Hsin, R. Kobayashi, and G. Zhu, “Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate Beyond the n \({}^{1/3}\) Distance Barrier”, PRX Quantum 6, (2025) arXiv:2405.11719 DOI

  155. [155]

    A. Aydin, N. Delfosse, and E. Tham, “Cyclic Hypergraph Product Code”, (2026) arXiv:2511.09683

  156. [156]

    M. Grassl and T. Beth, “Cyclic quantum error–correcting codes and quantum shift registers”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 456, 2689 (2000) arXiv:quant-ph/9910061 DOI

  157. [157]

    S. Dutta and P. P. Kurur, “Quantum Cyclic Code”, (2010) arXiv:1007.1697

  158. [158]

    O. Higgott and C. Gidney, “Sparse Blossom: correcting a million errors per core second with minimum-weight matching”, Quantum 9, 1600 (2025) arXiv:2303.15933 DOI

  159. [159]

    G. P. Gehér, O. Crawford, and E. T. Campbell, “Tangling Schedules Eases Hardware Connectivity Requirements for Quantum Error Correction”, PRX Quantum 5, (2024) arXiv:2307.10147 DOI

  160. [160]

    A. Leverrier, J.-P. Tillich, and G. Zemor, “Quantum Expander Codes”, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science 810 (2015) arXiv:1504.00822 DOI

  161. [161]

    I. Dinur, M.-H. Hsieh, T.-C. Lin, and T. Vidick, “Good Quantum LDPC Codes with Linear Time Decoders”, (2022) arXiv:2206.07750

  162. [162]

    L. A. Beni, O. Higgott, and N. Shutty, “Tesseract: A Search-Based Decoder for Quantum Error Correction”, (2025) arXiv:2503.10988

  163. [163]

    B. Gu, T. Noszko, V. Steffan, J. N. Eberhardt, J. Roffe, J. Eisert, and S. Koutsioumpas, “Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid”, (2026) arXiv:2606.19482

  164. [164]

    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

  165. [165]

    S. J. S. Tan and L. Stambler, “Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes”, Quantum 9, 1897 (2025) arXiv:2409.02193 DOI

  166. [166]

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

  167. [167]

    P. J. Nadkarni and S. S. Garani, “Quantum error correction architecture for qudit stabilizer codes”, Physical Review A 103, (2021) DOI

  168. [168]

    M.-H. Hsieh, W.-T. Yen, and L.-Y. Hsu, “High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement”, IEEE Transactions on Information Theory 57, 1761 (2011) arXiv:0906.5532 DOI

  169. [169]

    I. B. Djordjevic, “Photonic entanglement-assisted quantum low-density parity-check encoders and decoders”, Optics Letters 35, 1464 (2010) DOI

  170. [170]

    M. M. Wilde, “Quantum Coding with Entanglement”, (2008) arXiv:0806.4214

  171. [171]

    M. M. Wilde and D. B. Uskov, “Linear-optical hyperentanglement-assisted quantum error-correcting code”, Physical Review A 79, (2009) arXiv:0807.4906 DOI

  172. [172]

    N. Bao and N. Cheng, “Eigenstate thermalization hypothesis and approximate quantum error correction”, Journal of High Energy Physics 2019, (2019) arXiv:1906.03669 DOI

  173. [173]

    H. Kwon, U. R. Fischer, S.-W. Lee, and L. Jiang, “Restoring Heisenberg scaling in time via autonomous quantum error correction”, (2026) arXiv:2504.13168

  174. [174]

    A. Leverrier and G. Zémor, “Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes”, (2022) arXiv:2206.07571

  175. [175]

    A. Leverrier and G. Zémor, “Decoding quantum Tanner codes”, (2022) arXiv:2208.05537

  176. [176]

    S. Burton, C. G. Brell, and S. T. Flammia, “Classical simulation of quantum error correction in a Fibonacci anyon code”, Physical Review A 95, (2017) arXiv:1506.03815 DOI

  177. [177]

    G. Dauphinais and D. Poulin, “Fault-Tolerant Quantum Error Correction for non-Abelian Anyons”, Communications in Mathematical Physics 355, 519 (2017) arXiv:1607.02159 DOI

  178. [178]

    A. Schotte, G. Zhu, L. Burgelman, and F. Verstraete, “Quantum error correction thresholds for the universal Fibonacci Turaev-Viro code”, (2021) arXiv:2012.04610

  179. [179]

    A. Schotte, L. Burgelman, and G. Zhu, “Fault-tolerant error correction for a universal non-Abelian topological quantum computer at finite temperature”, (2022) arXiv:2301.00054

  180. [180]

    M. Yoshida, G. Kimura, T. Miyadera, H. Imai, and J. Cheng, “Solution to the mean king’s problem using quantum error-correcting codes”, Physical Review A 91, (2015) arXiv:1507.07072 DOI

  181. [181]

    L. Vaidman, Y. Aharonov, and D. Z. Albert, “How to ascertain the values ofsigmax,σy, andσzof a spin-1/2particle”, Physical Review Letters 58, 1385 (1987) DOI

  182. [182]

    J. P. Paz and W. H. Zurek, “Continuous error correction”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454, 355 (1998) DOI

  183. [183]

    J. P. Barnes and W. S. Warren, “Automatic Quantum Error Correction”, Physical Review Letters 85, 856 (2000) arXiv:quant-ph/9912104 DOI

  184. [184]

    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

  185. [185]

    M. Sarovar and G. J. Milburn, “Continuous quantum error correction by cooling”, Physical Review A 72, (2005) arXiv:quant-ph/0501038 DOI

  186. [186]

    R. van Handel and H. Mabuchi, “Optimal error tracking via quantum coding and continuous syndrome measurement”, (2005) arXiv:quant-ph/0511221

  187. [187]

    J. F. Poyatos, J. I. Cirac, and P. Zoller, “Quantum Reservoir Engineering with Laser Cooled Trapped Ions”, Physical Review Letters 77, 4728 (1996) DOI

  188. [188]

    O. Oreshkov, “Continuous-time quantum error correction”, (2013) arXiv:1311.2485

  189. [189]

    J.-M. Lihm, K. Noh, and U. R. Fischer, “Implementation-independent sufficient condition of the Knill-Laflamme type for the autonomous protection of logical qudits by strong engineered dissipation”, Physical Review A 98, (2018) arXiv:1711.02999 DOI

  190. [190]

    J. Lebreuilly, K. Noh, C.-H. Wang, S. M. Girvin, and L. Jiang, “Autonomous quantum error correction and quantum computation”, (2021) arXiv:2103.05007

  191. [191]

    O. Oreshkov and T. A. Brun, “Continuous quantum error correction for non-Markovian decoherence”, Physical Review A 76, (2007) arXiv:0705.2342 DOI

  192. [192]

    S. Kawabata, “Information-theoretical approach to control of quantum-mechanical systems”, Physical Review A 68, (2003) arXiv:quant-ph/0409187 DOI

  193. [193]

    A. Lanka, S. Hegde, and T. A. Brun, “Optimizing continuous-time quantum error correction for Markovian and non-Markovian noise models”, Physical Review A 114, (2026) arXiv:2506.21707 DOI

  194. [194]

    M. Davydova, N. Tantivasadakarn, and S. Balasubramanian, “Floquet Codes without Parent Subsystem Codes”, PRX Quantum 4, (2023) arXiv:2210.02468 DOI

  195. [195]

    B. Erkmen, B. Moision, S. J. Dolinar, K. M. Birnbaum, and D. Divsalar, “Approaching the ultimate limits of communication efficiency with a photon-counting detector”, 2012 Information Theory and Applications Workshop 420 (2012) DOI

  196. [196]

    M. Jarzyna, P. Kuszaj, and K. Banaszek, “Incoherent on-off keying with classical and non-classical light”, Optics Express 23, 3170 (2015) arXiv:1410.4575 DOI

  197. [197]

    S. Guha, “Classical capacity of the free-space quantum-optical channel”, S.M. thesis, Massachusetts Institute of Technology (2004), URL

  198. [198]

    T. Bergamaschi, L. Golowich, and S. Gunn, “Approaching the Quantum Singleton Bound with Approximate Error Correction”, (2022) arXiv:2212.09935

  199. [199]

    A. Dua, T. Jochym-O&apos;Connor, and G. Zhu, “Quantum error correction with fractal topological codes”, Quantum 7, 1122 (2023) arXiv:2201.03568 DOI

  200. [200]

    S. Dutta and P. P. Kurur, “Quantum Cyclic Code of length dividing \(p^{t}+1\)”, (2011) arXiv:1011.5814

  201. [201]

    S. Bartolucci et al., “Fusion-based quantum computation”, (2021) arXiv:2101.09310

  202. [202]

    H. Bombín, C. Dawson, R. V. Mishmash, N. Nickerson, F. Pastawski, and S. Roberts, “Logical Blocks for Fault-Tolerant Topological Quantum Computation”, PRX Quantum 4, (2023) arXiv:2112.12160 DOI

  203. [203]

    N. C. Menicucci, “Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States”, Physical Review Letters 112, (2014) arXiv:1310.7596 DOI

  204. [204]

    C. Vuillot, H. Asasi, Y. Wang, L. P. Pryadko, and B. M. Terhal, “Quantum error correction with the toric Gottesman-Kitaev-Preskill code”, Physical Review A 99, (2019) arXiv:1810.00047 DOI

  205. [205]

    M. Lin, C. Chamberland, and K. Noh, “Closest Lattice Point Decoding for Multimode Gottesman-Kitaev-Preskill Codes”, PRX Quantum 4, (2023) arXiv:2303.04702 DOI

  206. [206]

    Y. Ouyang, “Permutation-invariant quantum coding for quantum deletion channels”, 2021 IEEE International Symposium on Information Theory (ISIT) 1499 (2021) arXiv:2102.02494 DOI

  207. [207]

    L. Bulled and Y. Ouyang, “An angular momentum approach to quantum insertion errors”, (2025) arXiv:2509.03413

  208. [208]

    V. Nourozi, “Reinforcement Learning Enhanced Greedy Decoding for Quantum Stabilizer Codes over \(\mathbb{F}_q\)”, (2025) arXiv:2506.03397

  209. [209]

    P. K. Sarvepalli, A. Klappenecker, and M. Rotteler, “New decoding algorithms for a class of subsystem codes and generalized shor codes”, 2009 IEEE International Symposium on Information Theory 804 (2009) DOI

  210. [210]

    V. V. Gayatri and P. K. Sarvepalli, “Decoding Algorithms for Hypergraph Subsystem Codes and Generalized Subsystem Surface Codes”, (2018) arXiv:1805.12542

  211. [211]

    M. Jafarzadeh, J. Conrad, R. N. Alexander, and B. Q. Baragiola, “Logical channels in approximate Gottesman-Kitaev-Preskill error correction”, Physical Review A 112, (2025) arXiv:2504.13383 DOI

  212. [212]

    E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, “Closest point search in lattices”, IEEE Transactions on Information Theory 48, 2201 (2002) DOI

  213. [213]

    K. Noh and C. Chamberland, “Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code”, Physical Review A 101, (2020) arXiv:1908.03579 DOI

  214. [214]

    J. Conrad, J. Eisert, and F. Arzani, “Gottesman-Kitaev-Preskill codes: A lattice perspective”, Quantum 6, 648 (2022) arXiv:2109.14645 DOI

  215. [215]

    N. Raveendran, N. Rengaswamy, F. Rozpędek, A. Raina, L. Jiang, and B. Vasić, “Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound”, Quantum 6, 767 (2022) arXiv:2111.07029 DOI

  216. [216]

    L. Babai, “On Lovász’ lattice reduction and the nearest lattice point problem”, Combinatorica 6, 1 (1986) DOI

  217. [217]

    D. Gottesman and J. Preskill, “Secure quantum key distribution using squeezed states”, Physical Review A 63, (2001) arXiv:quant-ph/0008046 DOI

  218. [218]

    K. Noh, V. V. Albert, and L. Jiang, “Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes”, IEEE Transactions on Information Theory 65, 2563 (2019) arXiv:1801.07271 DOI

  219. [219]

    K. Noh, C. Chamberland, and F. G. S. L. Brandão, “Low-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code”, PRX Quantum 3, (2022) arXiv:2103.06994 DOI

  220. [220]

    W. Yang, C. Duckering, and A. Dua, “Designer Codes from GALA: Compact, Self-Dual, and Rate-1/2 QEC on Reconfigurable Atom Arrays”, (2026) arXiv:2608.07431

  221. [221]

    P. Hayden, S. Nezami, G. Salton, and B. C. Sanders, “Spacetime replication of continuous variable quantum information”, New Journal of Physics 18, 083043 (2016) arXiv:1601.02544 DOI

  222. [222]

    D. Bhoumik, R. Majumdar, D. Madan, D. Vinayagamurthy, S. Raghunathan, and S. Sur-Kolay, “Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning”, ACM Transactions on Quantum Computing 5, 1 (2024) arXiv:2210.09730 DOI

  223. [223]

    B. Hall, S. Gicev, and M. Usman, “Artificial neural network syndrome decoding on IBM quantum processors”, Physical Review Research 6, (2024) arXiv:2311.15146 DOI

  224. [224]

    A. Leverrier, V. Londe, and G. Zémor, “Towards local testability for quantum coding”, Quantum 6, 661 (2022) arXiv:1911.03069 DOI

  225. [225]

    R. J. Harris, N. A. McMahon, G. K. Brennen, and T. M. Stace, “Calderbank-Shor-Steane holographic quantum error-correcting codes”, Physical Review A 98, (2018) arXiv:1806.06472 DOI

  226. [226]

    F. Annexstein and M. Baumslag, “A unified approach to off-line permutation routing on parallel networks”, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA ’90 398 (1990) DOI

  227. [227]

    N. Meister, C. A. Pattison, and J. Preskill, “Efficient soft-output decoders for the surface code”, (2024) arXiv:2405.07433

  228. [228]

    C. S. Ahn, Extending Quantum Error Correction: New Continuous Measurement Protocols and Improved Fault-Tolerant Overhead, California Institute of Technology, 2004 DOI

  229. [229]

    A. Kubica and J. Preskill, “Cellular-Automaton Decoders with Provable Thresholds for Topological Codes”, Physical Review Letters 123, (2019) arXiv:1809.10145 DOI

  230. [230]

    A. M. Kubica, The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases Of Matter, California Institute of Technology, 2018 DOI

  231. [231]

    D. Ponarovsky, “Local Quantum Fault Tolerance Without Expansion”, (2026) arXiv:2610.38847

  232. [232]

    O. Higgott and N. P. Breuckmann, “Improved Single-Shot Decoding of Higher-Dimensional Hypergraph-Product Codes”, PRX Quantum 4, (2023) arXiv:2206.03122 DOI

  233. [233]

    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

  234. [234]

    N. Delfosse and M. B. Hastings, “Union-Find Decoders For Homological Product Codes”, Quantum 5, 406 (2021) arXiv:2009.14226 DOI

  235. [235]

    P.-J. H. S. Derks, A. Townsend-Teague, A. G. Burchards, and J. Eisert, “Designing fault-tolerant circuits using detector error models”, Quantum 9, 1905 (2025) arXiv:2407.13826 DOI

  236. [236]

    P. Sarvepalli and R. Raussendorf, “Efficient decoding of topological color codes”, Physical Review A 85, (2012) arXiv:1111.0831 DOI

  237. [237]

    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

  238. [238]

    A. Davaasuren, Y. Suzuki, K. Fujii, and M. Koashi, “General framework for constructing fast and near-optimal machine-learning-based decoder of the topological stabilizer codes”, Physical Review Research 2, (2020) arXiv:1801.04377 DOI

  239. [239]

    N. Maskara, A. Kubica, and T. Jochym-O’Connor, “Advantages of versatile neural-network decoding for topological codes”, Physical Review A 99, (2019) arXiv:1802.08680 DOI

  240. [240]

    K. Sahay and B. J. Brown, “Decoder for the Triangular Color Code by Matching on a Möbius Strip”, PRX Quantum 3, (2022) arXiv:2108.11395 DOI

  241. [241]

    K.-Y. Kuo and C.-Y. Lai, “Comparison of 2D topological codes and their decoding performances”, 2022 IEEE International Symposium on Information Theory (ISIT) 186 (2022) arXiv:2202.06612 DOI

  242. [242]

    K.-Y. Kuo and C.-Y. Lai, “Exploiting degeneracy in belief propagation decoding of quantum codes”, npj Quantum Information 8, (2022) arXiv:2104.13659 DOI

  243. [243]

    L. Berent, L. Burgholzer, P.-J. H. S. Derks, J. Eisert, and R. Wille, “Decoding quantum color codes with MaxSAT”, Quantum 8, 1506 (2024) arXiv:2303.14237 DOI

  244. [244]

    K. R. Ott, B. Hetényi, and M. E. Beverland, “Decision-tree decoders for general quantum LDPC codes”, (2025) arXiv:2502.16408

  245. [245]

    N. Lacroix et al., “Scaling and logic in the colour code on a superconducting quantum processor”, Nature 645, 614 (2025) arXiv:2412.14256 DOI

  246. [246]

    A. Leverrier and R. Urbanke, “Approximating optimal decoding of quantum LDPC codes with narrow frontiers”, (2026) arXiv:2606.20513

  247. [247]

    O. Higgott and N. P. Breuckmann, “Constructions and Performance of Hyperbolic and Semi-Hyperbolic Floquet Codes”, PRX Quantum 5, (2024) arXiv:2308.03750 DOI

  248. [248]

    A. A. Galimova, “Hyperbolic and Semi-Hyperbolic Floquet Codes for Photonic Quantum Computing”, (2026) arXiv:2602.22906

  249. [249]

    M. B. Hastings, “Decoding in Hyperbolic Spaces: LDPC Codes With Linear Rate and Efficient Error Correction”, (2013) arXiv:1312.2546

  250. [250]

    A. O. Quintavalle and E. T. Campbell, “ReShape: a decoder for hypergraph product codes”, (2022) arXiv:2105.02370

  251. [251]

    N. Delfosse, M. E. Beverland, and M. A. Tremblay, “Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes”, (2021) arXiv:2109.14599

  252. [252]

    N. Connolly, V. Londe, A. Leverrier, and N. Delfosse, “Fast erasure decoder for hypergraph product codes”, Quantum 8, 1450 (2024) arXiv:2208.01002 DOI

  253. [253]

    M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Efficient erasure correcting codes”, IEEE Transactions on Information Theory 47, 569 (2001) DOI

  254. [254]

    M. Gökduman, H. Yao, and H. D. Pfister, “Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation”, 2024 60th Annual Allerton Conference on Communication, Control, and Computing 1 (2024) arXiv:2411.08177 DOI

  255. [255]

    H. Yao, M. Gökduman, and H. D. Pfister, “Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes”, (2024) arXiv:2412.08817

  256. [256]

    B. C. A. Freire, N. Delfosse, and A. Leverrier, “Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning”, (2025) arXiv:2501.09622

  257. [257]

    A. G. Manes and J. Claes, “Distance-preserving stabilizer measurements in hypergraph product codes”, Quantum 9, 1618 (2025) arXiv:2308.15520 DOI

  258. [258]

    A. Krishna, I. L. Navon, and M. Wootters, “Viderman’s algorithm for quantum LDPC codes”, (2023) arXiv:2310.07868

  259. [259]

    M. Viderman, “Linear-time decoding of regular expander codes”, ACM Transactions on Computation Theory 5, 1 (2013) DOI

  260. [260]

    A. K. Pradhan, N. Raveendran, N. Rengaswamy, and B. Vasić, “Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes”, (2025) arXiv:2504.01728

  261. [261]

    K. Kasai, “Breaking the Orthogonality Barrier in Quantum LDPC Codes”, Quantum 10, 2205 (2026) arXiv:2601.08824 DOI

  262. [262]

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

  263. [263]

    N. Lang and H. P. Büchler, “Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata”, SciPost Physics 4, (2018) arXiv:1711.08196 DOI

  264. [264]

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

  265. [265]

    H. Zhou, C. Zhao, M. Cain, D. Bluvstein, N. Maskara, C. Duckering, H.-Y. Hu, S.-T. Wang, A. Kubica, and M. D. Lukin, “Low-overhead transversal fault tolerance for universal quantum computation”, Nature 646, 303 (2025) arXiv:2406.17653 DOI

  266. [266]

    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

  267. [267]

    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

  268. [268]

    B. Coecke and R. Duncan, “Interacting Quantum Observables”, Lecture Notes in Computer Science 298 DOI

  269. [269]

    B. Coecke and R. Duncan, “Interacting quantum observables: categorical algebra and diagrammatics”, New Journal of Physics 13, 043016 (2011) arXiv:0906.4725 DOI

  270. [270]

    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

  271. [271]

    C. Gidney, “A Pair Measurement Surface Code on Pentagons”, Quantum 7, 1156 (2023) arXiv:2206.12780 DOI

  272. [272]

    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

  273. [273]

    J. Old, S. Tasler, M. J. Hartmann, and M. Müller, “Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates”, Physical Review Letters 135, (2025) arXiv:2506.09029 DOI

  274. [274]

    S. Tasler, J. Old, L. Heunisch, V. Feulner, T. Eckstein, M. Müller, and M. J. Hartmann, “Optimizing Superconducting Three-Qubit Gates for Surface-Code Error Correction”, (2025) arXiv:2506.09028

  275. [275]

    A. Landahl, private communication, 2023

  276. [276]

    A. G. Fowler, A. C. Whiteside, and L. C. L. Hollenberg, “Towards Practical Classical Processing for the Surface Code”, Physical Review Letters 108, (2012) arXiv:1110.5133 DOI

  277. [277]

    A. G. Fowler, A. C. Whiteside, and L. C. L. Hollenberg, “Towards practical classical processing for the surface code: Timing analysis”, Physical Review A 86, (2012) arXiv:1202.5602 DOI

  278. [278]

    A. G. Fowler, “Minimum weight perfect matching of fault-tolerant topological quantum error correction in average \(O(1)\) parallel time”, (2014) arXiv:1307.1740

  279. [279]

    J. Edmonds, “Paths, Trees, and Flowers”, Canadian Journal of Mathematics 17, 449 (1965) DOI

  280. [280]

    J. Edmonds, “Maximum matching and a polyhedron with 0,1-vertices”, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics 69B, 125 (1965) DOI

  281. [281]

    F. Barahona, R. Maynard, R. Rammal, and J. P. Uhry, “Morphology of ground states of two-dimensional frustration model”, Journal of Physics A: Mathematical and General 15, 673 (1982) DOI

  282. [282]

    A. Fischer and A. Miyake, “Hardness results for decoding the surface code with Pauli noise”, Quantum 8, 1511 (2024) arXiv:2309.10331 DOI

  283. [283]

    O. Higgott, “PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching”, (2021) arXiv:2105.13082

  284. [284]

    S. Bravyi, M. Suchara, and A. Vargo, “Efficient algorithms for maximum likelihood decoding in the surface code”, Physical Review A 90, (2014) arXiv:1405.4883 DOI

  285. [285]

    M. Kac and J. C. Ward, “A Combinatorial Solution of the Two-Dimensional Ising Model”, Physical Review 88, 1332 (1952) DOI

  286. [286]

    N. Delfosse and N. H. Nickerson, “Almost-linear time decoding algorithm for topological codes”, Quantum 5, 595 (2021) arXiv:1709.06218 DOI

  287. [287]

    B. A. Galler and M. J. Fisher, “An improved equivalence algorithm”, Communications of the ACM 7, 301 (1964) DOI

  288. [288]

    J. E. Hopcroft and J. D. Ullman, “Set Merging Algorithms”, SIAM Journal on Computing 2, 294 (1973) DOI

  289. [289]

    R. E. Tarjan and J. van Leeuwen, “Worst-case Analysis of Set Union Algorithms”, Journal of the ACM 31, 245 (1984) DOI

  290. [290]

    C. A. Pattison, M. E. Beverland, M. P. da Silva, and N. Delfosse, “Improved quantum error correction using soft information”, (2021) arXiv:2107.13589

  291. [291]

    T. Chan and S. C. Benjamin, “Actis: A Strictly Local Union–Find Decoder”, Quantum 7, 1183 (2023) arXiv:2305.18534 DOI

  292. [292]

    A. G. Fowler, A. C. Whiteside, A. L. McInnes, and A. Rabbani, “Topological Code Autotune”, Physical Review X 2, (2012) arXiv:1202.6111 DOI

  293. [293]

    A. G. Fowler, “Optimal complexity correction of correlated errors in the surface code”, (2013) arXiv:1310.0863

  294. [294]

    A. Paler and A. G. Fowler, “Pipelined correlated minimum weight perfect matching of the surface code”, Quantum 7, 1205 (2023) arXiv:2205.09828 DOI

  295. [295]

    X. Xu, Q. Zhao, X. Yuan, and S. C. Benjamin, “High-Threshold Code for Modular Hardware With Asymmetric Noise”, Physical Review Applied 12, (2019) arXiv:1812.01505 DOI

  296. [296]

    Y. Wu and L. Zhong, “Fusion Blossom: Fast MWPM Decoders for QEC”, (2023) arXiv:2305.08307

  297. [297]

    B. Criger and I. Ashraf, “Multi-path Summation for Decoding 2D Topological Codes”, Quantum 2, 102 (2018) arXiv:1709.02154 DOI

  298. [298]

    D. Forlivesi, L. Valentini, and M. Chiani, “Spanning Tree Matching Decoder for Quantum Surface Codes”, IEEE Communications Letters 28, 1509 (2024) arXiv:2405.01151 DOI

  299. [299]

    K. Sahay, Y. Lin, S. Huang, K. R. Brown, and S. Puri, “Error Correction of Transversal cnot Gates for Scalable Surface-Code Computation”, PRX Quantum 6, (2025) arXiv:2408.01393 DOI

  300. [300]

    Y. Wu, N. Liyanage, and L. Zhong, “Micro Blossom: Accelerated Minimum-Weight Perfect Matching Decoding for Quantum Error Correction”, (2025) arXiv:2502.14787

  301. [301]

    M. Serra-Peralta, M. H. Shaw, and B. M. Terhal, “Decoding across Transversal Clifford Gates in the Surface Code”, PRX Quantum 7, (2026) arXiv:2505.13599 DOI

  302. [302]

    N. Shutty, M. Newman, and B. Villalonga, “Efficient near-optimal decoding of the surface code through ensembling”, (2024) arXiv:2401.12434

  303. [303]

    C. Jones, “Improved accuracy for decoding surface codes with matching synthesis”, (2024) arXiv:2408.12135

  304. [304]

    G. Duclos-Cianci and D. Poulin, “Fast Decoders for Topological Quantum Codes”, Physical Review Letters 104, (2010) arXiv:0911.0581 DOI

  305. [305]

    G. Duclos-Cianci and D. Poulin, “Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes”, (2013) arXiv:1304.6100

  306. [306]

    F. H. E. Watson, H. Anwar, and D. E. Browne, “Fast fault-tolerant decoder for qubit and qudit surface codes”, Physical Review A 92, (2015) arXiv:1411.3028 DOI

  307. [307]

    J. Wootton, “A Simple Decoder for Topological Codes”, Entropy 17, 1946 (2015) arXiv:1310.2393 DOI

  308. [308]

    A. S. Darmawan and D. Poulin, “Linear-time general decoding algorithm for the surface code”, Physical Review E 97, (2018) arXiv:1801.01879 DOI

  309. [309]

    J. R. Wootton and D. Loss, “High Threshold Error Correction for the Surface Code”, Physical Review Letters 109, (2012) arXiv:1202.4316 DOI

  310. [310]

    A. Hutter, J. R. Wootton, and D. Loss, “Efficient Markov chain Monte Carlo algorithm for the surface code”, Physical Review A 89, (2014) arXiv:1302.2669 DOI

  311. [311]

    J. W. Harrington, Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes, California Institute of Technology, 2004 DOI

  312. [312]

    M. Herold, E. T. Campbell, J. Eisert, and M. J. Kastoryano, “Cellular-automaton decoders for topological quantum memories”, npj Quantum Information 1, (2015) arXiv:1406.2338 DOI

  313. [313]

    M. Herold, M. J. Kastoryano, E. T. Campbell, and J. Eisert, “Cellular automaton decoders of topological quantum memories in the fault tolerant setting”, New Journal of Physics 19, 063012 (2017) arXiv:1511.05579 DOI

  314. [314]

    C.-E. Bardyn and T. Karzig, “Exponential lifetime improvement in topological quantum memories”, Physical Review B 94, (2016) arXiv:1512.04528 DOI

  315. [315]

    G. Torlai and R. G. Melko, “Neural Decoder for Topological Codes”, Physical Review Letters 119, (2017) arXiv:1610.04238 DOI

  316. [316]

    C. Chamberland and P. Ronagh, “Deep neural decoders for near term fault-tolerant experiments”, Quantum Science and Technology 3, 044002 (2018) arXiv:1802.06441 DOI

  317. [317]

    C. Chamberland, L. Goncalves, P. Sivarajah, E. Peterson, and S. Grimberg, “Techniques for combining fast local decoders with global decoders under circuit-level noise”, Quantum Science and Technology 8, 045011 (2023) arXiv:2208.01178 DOI

  318. [318]

    Y. Ueno, M. Kondo, M. Tanaka, Y. Suzuki, and Y. Tabuchi, “NEO-QEC: Neural Network Enhanced Online Superconducting Decoder for Surface Codes”, (2022) arXiv:2208.05758

  319. [319]

    B. M. Varbanov, M. Serra-Peralta, D. Byfield, and B. M. Terhal, “Neural network decoder for near-term surface-code experiments”, Physical Review Research 7, (2025) arXiv:2307.03280 DOI

  320. [320]

    P.-A. Mouny, M. Benhouria, V. Yon, P. Dufour, L. Huang, Y. Beilliard, S. Rochette, D. Drouin, and P. Ronagh, “Towards a Cryogenic CMOS-Memristor Neural Decoder for Quantum Error Correction”, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 1258 (2024) arXiv:2501.14525 DOI

  321. [321]

    S. Gicev, L. C. L. Hollenberg, and M. Usman, “Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise”, Quantum Science and Technology 11, 025048 (2026) arXiv:2506.16113 DOI

  322. [322]

    R. Sweke, M. S. Kesselring, E. P. L. van Nieuwenburg, and J. Eisert, “Reinforcement learning decoders for fault-tolerant quantum computation”, Machine Learning: Science and Technology 2, 025005 (2020) arXiv:1810.07207 DOI

  323. [323]

    P. Andreasson, J. Johansson, S. Liljestrand, and M. Granath, “Quantum error correction for the toric code using deep reinforcement learning”, Quantum 3, 183 (2019) arXiv:1811.12338 DOI

  324. [324]

    E. S. Matekole, E. Ye, R. Iyer, and S. Y.-C. Chen, “Decoding surface codes with deep reinforcement learning and probabilistic policy reuse”, (2022) arXiv:2212.11890

  325. [325]

    K. Meinerz, C.-Y. Park, and S. Trebst, “Scalable Neural Decoder for Topological Surface Codes”, Physical Review Letters 128, (2022) arXiv:2101.07285 DOI

  326. [326]

    H. Wang, P. Liu, K. Shao, D. Li, J. Gu, D. Z. Pan, Y. Ding, and S. Han, “Transformer-QEC: Quantum Error Correction Code Decoding with Transferable Transformers”, (2023) arXiv:2311.16082

  327. [327]

    W.-W. Zhang, Z. Xia, W. Zhao, W. Pan, and H. Shi, “Self-attention U-Net decoder for toric codes”, Physical Review Applied 23, (2025) arXiv:2506.02734 DOI

  328. [328]

    J. Bausch et al., “Learning high-accuracy error decoding for quantum processors”, Nature 635, 834 (2024) arXiv:2310.05900 DOI

  329. [329]

    A. W. Senior et al., “A scalable and real-time neural decoder for topological quantum codes”, (2026) arXiv:2512.07737

  330. [330]

    P. Das, A. Locharla, and C. Jones, “LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction”, (2021) arXiv:2108.06569

  331. [331]

    N. Delfosse, “Hierarchical decoding to reduce hardware requirements for quantum computing”, (2020) arXiv:2001.11427

  332. [332]

    S. C. Smith, B. J. Brown, and S. D. Bartlett, “Local Predecoder to Reduce the Bandwidth and Latency of Quantum Error Correction”, Physical Review Applied 19, (2023) arXiv:2208.04660 DOI

  333. [333]

    G. S. Ravi, J. M. Baker, A. Fayyazi, S. F. Lin, A. Javadi-Abhari, M. Pedram, and F. T. Chong, “Better Than Worst-Case Decoding for Quantum Error Correction”, (2022) arXiv:2208.08547

  334. [334]

    X. Tan, F. Zhang, R. Chao, Y. Shi, and J. Chen, “Scalable surface code decoders with parallelization in time”, (2022) arXiv:2209.09219

  335. [335]

    L. Skoric, D. E. Browne, K. M. Barnes, N. I. Gillespie, and E. T. Campbell, “Parallel window decoding enables scalable fault tolerant quantum computation”, Nature Communications 14, (2023) arXiv:2209.08552 DOI

  336. [336]

    J. Viszlai, J. D. Chadwick, S. Joshi, G. S. Ravi, Y. Li, and F. T. Chong, “Predictive Window Decoding for Fault-Tolerant Quantum Programs”, (2024) arXiv:2412.05115

  337. [337]

    J. Old and M. Rispler, “Generalized Belief Propagation Algorithms for Decoding of Surface Codes”, Quantum 7, 1037 (2023) arXiv:2212.03214 DOI

  338. [338]

    J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Generalized belief propagation”, in NIPS, Vol. 13 (2000) pp. 689–695

  339. [339]

    A. Kaufmann and I. Arad, “A blockBP decoder for the surface code”, (2024) arXiv:2402.04834

  340. [340]

    J. Chen, Z. Yi, Z. Liang, and X. Wang, “Improved Belief Propagation Decoding Algorithms for Surface Codes”, IEEE Transactions on Quantum Engineering 6, 1 (2025) arXiv:2407.11523 DOI

  341. [341]

    H. D. Pfister, C. Piveteau, J. M. Renes, and N. Rengaswamy, “Belief Propagation for Classical and Quantum Systems: Overview and Recent Results”, IEEE BITS the Information Theory Magazine 2, 20 (2022) DOI

  342. [342]

    J. D. Crest, M. Mhalla, and V. Savin, “A Blindness Property of the Min-Sum Decoding for the Toric Code”, IEEE Journal on Selected Areas in Information Theory 6, 138 (2025) arXiv:2406.14968 DOI

  343. [343]

    A. Benhemou, K. Sahay, L. Lao, and B. J. Brown, “Minimising surface-code failures using a color-code decoder”, Quantum 9, 1632 (2025) arXiv:2306.16476 DOI

  344. [344]

    M. Pacenti, M. F. Flanagan, D. Chytas, and B. Vasić, “Progressive-Proximity Bit-Flipping for Decoding Surface Codes”, IEEE Transactions on Communications 73, 1419 (2025) arXiv:2402.15924 DOI

  345. [345]

    B. Barber et al., “A real-time, scalable, fast and resource-efficient decoder for a quantum computer”, Nature Electronics 8, 84 (2025) arXiv:2309.05558 DOI

  346. [346]

    S. Sang and T. H. Hsieh, “Stability of Mixed-State Quantum Phases via Finite Markov Length”, Physical Review Letters 134, (2025) arXiv:2404.07251 DOI

  347. [347]

    S. C. Smith, B. J. Brown, and S. D. Bartlett, “Mitigating errors in logical qubits”, Communications Physics 7, (2024) arXiv:2405.03766 DOI

  348. [348]

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

  349. [349]

    D. Forlivesi, L. Valentini, and M. Chiani, “Bubble Clustering Decoder for Quantum Topological Codes”, (2025) arXiv:2504.01654

  350. [350]

    T.-H. Lin and C.-Y. Lai, “Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes”, IEEE Journal on Selected Areas in Information Theory 6, 163 (2025) arXiv:2506.14745 DOI

  351. [351]

    Q. Eggerickx, A. Wills, T.-C. Lin, K. De Greve, and M.-H. Hsieh, “Almost linear decoder for optimal geometrically local quantum codes”, Physical Review Research 7, (2025) arXiv:2411.02928 DOI

  352. [352]

    E. Lake, “Fast offline decoding with local message-passing automata”, (2025) arXiv:2506.03266

  353. [353]

    S. Gu, L. Caha, S. H. Choe, Z. He, A. Kubica, and E. Tang, “Layer Codes as Partially Self-Correcting Quantum Memories”, Physical Review Letters 136, (2026) arXiv:2510.06659 DOI

  354. [354]

    F. Pastawski and J. Preskill, “Error correction for encoded quantum annealing”, Physical Review A 93, (2016) arXiv:1511.00004 DOI

  355. [355]

    S. Chakraborty and V. V. Albert, “Hybrid Oscillator-Qudit Quantum Processors: stabilizer states, stabilizer codes, symplectic operations, and non-commutative geometry”, (2026) arXiv:2508.04819

  356. [356]

    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

  357. [357]

    D. Aasen et al., “Milestones Toward Majorana-Based Quantum Computing”, Physical Review X 6, (2016) arXiv:1511.05153 DOI

  358. [358]

    S. Plugge, A. Rasmussen, R. Egger, and K. Flensberg, “Majorana box qubits”, New Journal of Physics 19, 012001 (2017) arXiv:1609.01697 DOI

  359. [359]

    T. Karzig et al., “Scalable designs for quasiparticle-poisoning-protected topological quantum computation with Majorana zero modes”, Physical Review B 95, (2017) arXiv:1610.05289 DOI

  360. [360]

    J. F. Steiner and F. von Oppen, “Readout of Majorana qubits”, Physical Review Research 2, (2020) arXiv:2004.02124 DOI

  361. [361]

    J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum low-density parity-check code landscape”, Physical Review Research 2, (2020) arXiv:2005.07016 DOI

  362. [362]

    T. Busse and L. Toikka, “Majorana-XYZ subsystem code”, (2026) arXiv:2603.26311

  363. [363]

    A. Bhardwaj, M. Ma, N. Meister, R. King, D. Bluvstein, J. Preskill, M. Cain, Q. Xu, and H.-Y. Huang, “High-rate qLDPC processors”, (2026) arXiv:2607.28795

  364. [364]

    J. Marks, T. Jochym-O’Connor, and V. Gheorghiu, “Comparison of memory thresholds for planar qudit geometries”, New Journal of Physics 19, 113022 (2017) arXiv:1701.02335 DOI

  365. [365]

    E. Sabo, A. B. Aloshious, and K. R. Brown, “Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes”, (2022) arXiv:2106.08251

  366. [366]

    G. Duclos-Cianci and D. Poulin, “Kitaev’sZd-code threshold estimates”, Physical Review A 87, (2013) arXiv:1302.3638 DOI

  367. [367]

    H. Anwar, B. J. Brown, E. T. Campbell, and D. E. Browne, “Fast decoders for qudit topological codes”, New Journal of Physics 16, 063038 (2014) arXiv:1311.4895 DOI

  368. [368]

    M. J. Gullans and D. A. Huse, “Dynamical Purification Phase Transition Induced by Quantum Measurements”, Physical Review X 10, (2020) arXiv:1905.05195 DOI

  369. [369]

    F. A. Mian, O. Gwilliam, and S. Krastanov, “Multivariate Multicycle Codes for Complete Single-Shot Decoding”, (2026) arXiv:2601.18879

  370. [370]

    H.-K. Lin, P. K. Lim, A. A. Kovalev, and L. P. Pryadko, “Abelian multi-cycle codes for single-shot error correction”, (2026) arXiv:2506.16910

  371. [371]

    J. Niset, U. L. Andersen, and N. J. Cerf, “Experimentally Feasible Quantum Erasure-Correcting Code for Continuous Variables”, Physical Review Letters 101, (2008) arXiv:0710.4858 DOI

  372. [372]

    T. Hillmann, F. Quijandría, A. L. Grimsmo, and G. Ferrini, “Performance of Teleportation-Based Error-Correction Circuits for Bosonic Codes with Noisy Measurements”, PRX Quantum 3, (2022) arXiv:2108.01009 DOI

  373. [373]

    M. Hanks, S. Lee, N. Lo Piparo, S. Nishio, W. J. Munro, K. Nemoto, and M. S. Kim, “Use of faulty states in cat-code error correction”, Physical Review A 113, (2026) arXiv:2412.15134 DOI

  374. [374]

    C. W. Helstrom, Quantum Detection and Estimation Theory (Elsevier, 1976)

  375. [375]

    A. Holevo, Probabilistic and Statistical Aspects of Quantum Theory (Edizioni della Normale, 2011) DOI

  376. [376]

    X. Mao, Q. Xu, and L. Jiang, “Optimized four-qubit quantum error correcting code for amplitude damping channel”, (2025) arXiv:2411.12952

  377. [377]

    S. J. Dolinar, “An optimum receiver for the binary coherent state quantum channel”, Research Laboratory of Electronics, MIT, Quarterly Progress Report 11, 115-120 (1973)

  378. [378]

    R. L. Cook, P. J. Martin, and J. M. Geremia, “Optical coherent state discrimination using a closed-loop quantum measurement”, Nature 446, 774 (2007) DOI

  379. [379]

    K. Tsujino, D. Fukuda, G. Fujii, S. Inoue, M. Fujiwara, M. Takeoka, and M. Sasaki, “Sub-shot-noise-limit discrimination of on-off keyed coherent signals via a quantum receiver with a superconducting transition edge sensor”, Optics Express 18, 8107 (2010) arXiv:1002.2819 DOI

  380. [380]

    Y. Xu, Y. Wang, E.-J. Kuo, and V. V. Albert, “Qubit-Oscillator Concatenated Codes: Decoding Formalism and Code Comparison”, PRX Quantum 4, (2023) arXiv:2209.04573 DOI

  381. [381]

    Y. Ouyang and G. K. Brennen, “Finite-round quantum error correction on symmetric quantum sensors”, (2026) arXiv:2212.06285

  382. [382]

    X. Wang and P. Zanardi, “Simulation of many-body interactions by conditional geometric phases”, Physical Review A 65, (2002) arXiv:quant-ph/0111017 DOI

  383. [383]

    M. Takeoka, M. Sasaki, P. van Loock, and N. Lütkenhaus, “Implementation of projective measurements with linear optics and continuous photon counting”, Physical Review A 71, (2005) arXiv:quant-ph/0410133 DOI

  384. [384]

    F. E. Becerra, J. Fan, G. Baumgartner, S. V. Polyakov, J. Goldhar, J. T. Kosloski, and A. Migdall, “M-ary-state phase-shift-keying discrimination below the homodyne limit”, Physical Review A 84, (2011) DOI

  385. [385]

    S. Izumi, M. Takeoka, M. Fujiwara, N. D. Pozza, A. Assalini, K. Ema, and M. Sasaki, “Displacement receiver for phase-shift-keyed coherent states”, Physical Review A 86, (2012) arXiv:1208.1815 DOI

  386. [386]

    S. Izumi, M. Takeoka, K. Ema, and M. Sasaki, “Quantum receivers with squeezing and photon-number-resolving detectors forM-ary coherent state discrimination”, Physical Review A 87, (2013) arXiv:1302.2691 DOI

  387. [387]

    K. Li, Y. Zuo, and B. Zhu, “Suppressing the Errors Due to Mode Mismatch for \(M\)-Ary PSK Quantum Receivers Using Photon-Number-Resolving Detector”, IEEE Photonics Technology Letters 25, 2182 (2013) arXiv:1304.7316 DOI

  388. [388]

    C. R. Müller and C. Marquardt, “A robust quantum receiver for phase shift keyed signals”, New Journal of Physics 17, 032003 (2015) arXiv:1412.6242 DOI

  389. [389]

    G. S. Agarwal, “Generation of Pair Coherent States and Squeezing via the Competition of Four-Wave Mixing and Amplified Spontaneous Emission”, Physical Review Letters 57, 827 (1986) DOI

  390. [390]

    J. Y. Lee, K. Okada, N. Maskara, K. Kasai, and H. Zhou, “Design Principles for Ultra-High-Rate Quantum Codes”, (2026) arXiv:2609.30069

  391. [391]

    C. Zhao, C. Duckering, A. Gu, N. Maskara, and H. Zhou, “Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays”, (2026) arXiv:2604.16209

  392. [392]

    F. Pastawski, B. Yoshida, D. Harlow, and J. Preskill, “Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence”, Journal of High Energy Physics 2015, (2015) arXiv:1503.06237 DOI

  393. [393]

    J. Cruz-Benito, A. W. Cross, D. Kremer, and I. Faro, “Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search”, (2026) arXiv:2606.02418

  394. [394]

    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

  395. [395]

    M. M. Wilde and S. Guha, “Polar Codes for Classical-Quantum Channels”, IEEE Transactions on Information Theory 59, 1175 (2013) arXiv:1109.2591 DOI

  396. [396]

    S. J. Dolinar, Jr., “A near-optimum receiver structure for the detection of M-ary optical PPM signals”, The Telecommunications and Data Acquisition Progress Report 42 72: December 1982; NASA: Pasadena, CA, (1983)

  397. [397]

    Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, “Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies”, IEEE Access 3, 2492 (2015) DOI

  398. [398]

    D. Komoto and K. Kasai, “Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding”, (2026) arXiv:2507.11534

  399. [399]

    K. Kasai, “GD-CSS Decoder (Quantum Error Correction using Non-binary LDPC over GF(q)) Software Package”, 2025 URL

  400. [400]

    L. Golowich and V. Guruswami, “Quantum Locally Recoverable Codes”, (2023) arXiv:2311.08653

  401. [401]

    S. Gu, C. A. Pattison, and E. Tang, “An efficient decoder for a linear distance quantum LDPC code”, (2022) arXiv:2206.06557

  402. [402]

    H. F. Chau, “Good quantum-convolutional error-correction codes and their decoding algorithm exist”, Physical Review A 60, 1966 (1999) arXiv:quant-ph/9806032 DOI

  403. [403]

    H. Ollivier and J.-P. Tillich, “Description of a Quantum Convolutional Code”, Physical Review Letters 91, (2003) arXiv:quant-ph/0304189 DOI

  404. [404]

    H. Ollivier and J.-P. Tillich, “Quantum convolutional codes: fundamentals”, (2004) arXiv:quant-ph/0401134

  405. [405]

    E. Pelchat and D. Poulin, “Degenerate Viterbi decoding”, (2012) arXiv:1204.2439

  406. [406]

    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

  407. [407]

    L. Golowich, K. Chang, and G. Zhu, “Constant-Overhead Addressable Gates via Single-Shot Code Switching”, (2025) arXiv:2510.06760

  408. [408]

    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

  409. [409]

    A. Grospellier, “Constant time decoding of quantum expander codes and application to fault-tolerant quantum computation”, PhD thesis, Inria Paris, 2019

  410. [410]

    N. Alon, J. Edmonds, and M. Luby, “Linear time erasure codes with nearly optimal recovery”, Proceedings of IEEE 36th Annual Foundations of Computer Science 512 DOI

  411. [411]

    N. Alon and M. Luby, “A linear time erasure-resilient code with nearly optimal recovery”, IEEE Transactions on Information Theory 42, 1732 (1996) DOI

  412. [412]

    S. Muralidharan, J. Kim, N. Lütkenhaus, M. D. Lukin, and L. Jiang, “Ultrafast and Fault-Tolerant Quantum Communication across Long Distances”, Physical Review Letters 112, (2014) arXiv:1310.5291 DOI

  413. [413]

    A. Gong and J. M. Renes, “Improved Logical Error Rate via List Decoding of Quantum Polar Codes”, 2024 IEEE International Symposium on Information Theory (ISIT) 2496 (2024) arXiv:2304.04743 DOI

  414. [414]

    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

  415. [415]

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

  416. [416]

    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

  417. [417]

    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

  418. [418]

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

  419. [419]

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

  420. [420]

    S. P. Jain, J. T. Iosue, A. Barg, and V. V. Albert, “Quantum spherical codes”, Nature Physics 20, 1300 (2024) arXiv:2302.11593 DOI

  421. [421]

    D. Poulin, J.-P. Tillich, and H. Ollivier, “Quantum serial turbo-codes”, (2009) arXiv:0712.2888

  422. [422]

    M. M. Wilde, M.-H. Hsieh, and Z. Babar, “Entanglement-Assisted Quantum Turbo Codes”, IEEE Transactions on Information Theory 60, 1203 (2014) arXiv:1010.1256 DOI

  423. [423]

    Z. Babar, S. X. Ng, and L. Hanzo, “EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design”, IEEE Transactions on Vehicular Technology 64, 866 (2015) arXiv:1502.00910 DOI

  424. [424]

    S. Bravyi, I. Kim, A. Kliesch, and R. Koenig, “Adaptive constant-depth circuits for manipulating non-abelian anyons”, (2022) arXiv:2205.01933

  425. [425]

    T. Inada, W. Jang, Y. Iiyama, K. Terashi, R. Sawada, J. Tanaka, and S. Asai, “Measurement-Free Ultrafast Quantum Error Correction by Using Multi-Controlled Gates in Higher-Dimensional State Space”, (2021) arXiv:2109.00086

  426. [426]

    G. A. Paz-Silva, G. K. Brennen, and J. Twamley, “Fault Tolerance with Noisy and Slow Measurements and Preparation”, Physical Review Letters 105, (2010) arXiv:1002.1536 DOI

  427. [427]

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

  428. [428]

    K. Fujii, “Quantum Computation with Topological Codes: from qubit to topological fault-tolerance”, (2015) arXiv:1504.01444

  429. [429]

    K. Su, Z. Yang, and C.-M. Jian, “Tapestry of dualities in decohered quantum error correction codes”, Physical Review B 110, (2024) arXiv:2401.17359 DOI

  430. [430]

    Y. Choukroun and L. Wolf, “Deep Quantum Error Correction”, (2023) arXiv:2301.11930

  431. [431]

    M. Noormandipour and T. Haug, “MaxSAT decoders for arbitrary CSS codes”, (2024) arXiv:2410.01673

  432. [432]

    M. B. Hastings, “Quantum belief propagation: An algorithm for thermal quantum systems”, Physical Review B 76, (2007) arXiv:0706.4094 DOI

  433. [433]

    M. S. Leifer and D. Poulin, “Quantum Graphical Models and Belief Propagation”, Annals of Physics 323, 1899 (2008) arXiv:0708.1337 DOI

  434. [434]

    D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes”, (2008) arXiv:0801.1241

  435. [435]

    N. Raveendran and B. Vasić, “Trapping Sets of Quantum LDPC Codes”, Quantum 5, 562 (2021) arXiv:2012.15297 DOI

  436. [436]

    J. Kim, H. Jung, and J. Ha, “Low-Complexity Decoding Algorithm Utilizing Degeneracy for Quantum LDPC Codes”, MILCOM 2023 - 2023 IEEE Military Communications Conference (MILCOM) 115 (2023) DOI

  437. [437]

    T.-H. Huang and Y.-L. Ueng, “A Binary BP Decoding Using Posterior Adjustment for Quantum LDPC Codes”, ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 9001 (2024) DOI

  438. [438]

    Y.-H. Liu and D. Poulin, “Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes”, Physical Review Letters 122, (2019) arXiv:1811.07835 DOI

  439. [439]

    S. Miao, A. Schnerring, H. Li, and L. Schmalen, “Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices”, (2023) arXiv:2212.10245

  440. [440]

    M. Lange, P. Havström, B. Srivastava, I. Bengtsson, V. Bergentall, K. Hammar, O. Heuts, E. van Nieuwenburg, and M. Granath, “Data-driven decoding of quantum error correcting codes using graph neural networks”, Physical Review Research 7, (2025) arXiv:2307.01241 DOI

  441. [441]

    A. Gong, S. Cammerer, and J. M. Renes, “Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes”, 2024 IEEE International Symposium on Information Theory (ISIT) 2700 (2024) arXiv:2310.17758 DOI

  442. [442]

    Z. Yi, Z. Liang, K. Zhong, Y. Wu, Z. Fang, and X. Wang, “Improved belief propagation decoding algorithm based on decoupling representation of Pauli operators for quantum LDPC codes”, (2023) arXiv:2305.17505

  443. [443]

    J. du Crest, M. Mhalla, and V. Savin, “Stabilizer Inactivation for Message-Passing Decoding of Quantum LDPC Codes”, (2023) arXiv:2205.06125

  444. [444]

    T. Hillmann, L. Berent, A. O. Quintavalle, J. Eisert, R. Wille, and J. Roffe, “Localized statistics decoding for quantum low-density parity-check codes”, Nature Communications 16, (2025) arXiv:2406.18655 DOI

  445. [445]

    S. Javed, F. Garcia-Herrero, B. Vasic, and M. F. Flanagan, “Low-Complexity Linear Programming Based Decoding of Quantum LDPC codes”, (2024) arXiv:2311.18488

  446. [446]

    H. Yao, W. A. Laban, C. Häger, A. G. i Amat, and H. D. Pfister, “Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation”, (2024) arXiv:2312.10950

  447. [447]

    K. Yin, X. Fang, J. Ruan, H. Zhang, D. Tullsen, A. Sornborger, C. Liu, A. Li, T. Humble, and Y. Ding, “SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry”, (2024) arXiv:2412.02885

  448. [448]

    S. Wolanski and B. Barber, “Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes”, (2025) arXiv:2406.14527

  449. [449]

    M. A. Tremblay, N. Delfosse, and M. E. Beverland, “Constant-Overhead Quantum Error Correction with Thin Planar Connectivity”, Physical Review Letters 129, (2022) arXiv:2109.14609 DOI

  450. [450]

    N. Raveendran, N. Rengaswamy, A. K. Pradhan, and B. Vasić, “Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors”, (2022) arXiv:2205.02341

  451. [451]

    N. Delfosse, V. Londe, and M. Beverland, “Toward a Union-Find decoder for quantum LDPC codes”, (2021) arXiv:2103.08049

  452. [452]

    L. Berent, L. Burgholzer, and R. Wille, “Software Tools for Decoding Quantum Low-Density Parity-Check Codes”, Proceedings of the 28th Asia and South Pacific Design Automation Conference 709 (2023) arXiv:2209.01180 DOI

  453. [453]

    M. C. Löbl, S. X. Chen, S. Paesani, and A. S. Sørensen, “Breadth-first graph traversal union-find decoder”, (2024) arXiv:2407.15988

  454. [454]

    S. Huang and S. Puri, “Improved Noisy Syndrome Decoding of Quantum LDPC Codes with Sliding Window”, (2023) arXiv:2311.03307

  455. [455]

    A. deMarti iOlius and J. E. Martinez, “The closed-branch decoder for quantum LDPC codes”, (2024) arXiv:2402.01532

  456. [456]

    A. Gong, S. Cammerer, and J. M. Renes, “Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise”, (2024) arXiv:2403.18901

  457. [457]

    D. Gottesman, “Fault-Tolerant Quantum Computation with Constant Overhead”, (2014) arXiv:1310.2984

  458. [458]

    A. deMarti iOlius, I. Etxezarreta Martinez, J. Roffe, and J. Etxezarreta Martinez, “An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise”, npj Quantum Information (2026) arXiv:2409.01440 DOI

  459. [459]

    C.-F. Kung, K.-Y. Kuo, and C.-Y. Lai, “Efficient Approximate Degenerate Ordered Statistics Decoding for Quantum Codes via Reliable Subset Reduction”, (2026) arXiv:2412.21118

  460. [460]

    Y. Wu, B. Li, K. Chang, S. Puri, and L. Zhong, “Minimum-Weight Parity Factor Decoder for Quantum Error Correction”, (2025) arXiv:2508.04969

  461. [461]

    S.-H. Lee, L. H. English, and S. D. Bartlett, “Efficient post-selection for general quantum LDPC Codes”, npj Quantum Information 12, (2026) arXiv:2510.05795 DOI

  462. [462]

    R. Toshio, K. Kishi, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, “Decoder Switching: Breaking the Speed-Accuracy Tradeoff in Real-Time Quantum Error Correction”, (2025) arXiv:2510.25222

  463. [463]

    A. S. Maan, F. M. Garcia Herrero, A. Paler, and V. Savin, “Decoding correlated errors in quantum LDPC codes”, Nature Communications (2026) arXiv:2510.14060 DOI

  464. [464]

    J. M. Renes, “Belief propagation decoding of quantum channels by passing quantum messages”, New Journal of Physics 19, 072001 (2017) arXiv:1607.04833 DOI

  465. [465]

    N. Rengaswamy, K. P. Seshadreesan, S. Guha, and H. D. Pfister, “Belief propagation with quantum messages for quantum-enhanced classical communications”, npj Quantum Information 7, (2021) arXiv:2003.04356 DOI

  466. [466]

    C. Piveteau and J. M. Renes, “Quantum message-passing algorithm for optimal and efficient decoding”, Quantum 6, 784 (2022) arXiv:2109.08170 DOI

  467. [467]

    S. Brandsen, A. Mandal, and H. D. Pfister, “Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels”, (2022) arXiv:2207.04984

  468. [468]

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

  469. [469]

    G. Zhang and Y. Li, “Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes”, Physical Review Letters 134, (2025) arXiv:2408.01339 DOI

  470. [470]

    M.-X. Huo and Y. Li, “Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction”, New Journal of Physics 19, 123032 (2017) arXiv:1710.03636 DOI

  471. [471]

    D. P. DiVincenzo and P. Aliferis, “Effective Fault-Tolerant Quantum Computation with Slow Measurements”, Physical Review Letters 98, (2007) arXiv:quant-ph/0607047 DOI

  472. [472]

    J. C. M. de la Fuente, “Dynamical weight reduction of Pauli measurements”, (2024) arXiv:2410.12527

  473. [473]

    F. Yamaguchi, K. Nemoto, and W. J. Munro, “Quantum error correction via robust probe modes”, Physical Review A 73, (2006) arXiv:quant-ph/0511098 DOI

  474. [474]

    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

  475. [475]

    M. Sarovar, C. Ahn, K. Jacobs, and G. J. Milburn, “Practical scheme for error control using feedback”, Physical Review A 69, (2004) arXiv:quant-ph/0402017 DOI

  476. [476]

    M.-H. Hsieh and F. Le Gall, “NP-hardness of decoding quantum error-correction codes”, Physical Review A 83, (2011) arXiv:1009.1319 DOI

  477. [477]

    K.-Y. Kuo and C.-C. Lu, “On the hardness of decoding quantum stabilizer codes under the depolarizing channel”, 2012 International Symposium on Information Theory and its Applications. IEEE, 2012

  478. [478]

    P. Iyer and D. Poulin, “Hardness of decoding quantum stabilizer codes”, (2013) arXiv:1310.3235

  479. [479]

    A. Poremba, Y. Quek, and P. Shor, “The Learning Stabilizers with Noise problem”, (2025) arXiv:2410.18953

  480. [480]

    A. B. Khesin, J. Z. Lu, A. Poremba, A. Ramkumar, and V. Vaikuntanathan, “Average-Case Complexity of Quantum Stabilizer Decoding”, (2025) arXiv:2509.20697

  481. [481]

    B. M. Terhal, “Quantum error correction for quantum memories”, Reviews of Modern Physics 87, 307 (2015) arXiv:1302.3428 DOI

  482. [482]

    N. Delfosse, A. Paetznick, J. Haah, and M. B. Hastings, “Splitting decoders for correcting hypergraph faults”, (2023) arXiv:2309.15354

  483. [483]

    H. Ollivier and J.-P. Tillich, “Trellises for stabilizer codes: Definition and uses”, Physical Review A 74, (2006) arXiv:quant-ph/0512041 DOI

  484. [484]

    D. Cruz, F. A. Monteiro, and B. C. Coutinho, “Quantum Error Correction Via Noise Guessing Decoding”, IEEE Access 11, 119446 (2023) arXiv:2208.02744 DOI

  485. [485]

    S. Krastanov and L. Jiang, “Deep Neural Network Probabilistic Decoder for Stabilizer Codes”, Scientific Reports 7, (2017) arXiv:1705.09334 DOI

  486. [486]

    R. J. Harris, E. Coupe, N. A. McMahon, G. K. Brennen, and T. M. Stace, “Decoding holographic codes with an integer optimization decoder”, Physical Review A 102, (2020) arXiv:2008.10206 DOI

  487. [487]

    O. Shtanko, Y.-J. Liu, S. Lieu, A. V. Gorshkov, and V. V. Albert, “Bounds on Autonomous Quantum Error Correction”, Quantum 9, 1804 (2025) arXiv:2308.16233 DOI

  488. [488]

    K. Shiraishi, H. Yamasaki, and M. Murao, “Efficient local operations and classical communication extraction of quantum information encoded in stabilizer codes”, Physical Review A 110, (2024) arXiv:2308.14054 DOI

  489. [489]

    M. Cain, C. Zhao, H. Zhou, N. Meister, J. P. B. Ataides, A. Jaffe, D. Bluvstein, and M. D. Lukin, “Correlated decoding of logical algorithms with transversal gates”, (2025) arXiv:2403.03272

  490. [490]

    Y. Shi, A. Patil, and S. Guha, “Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders”, PRX Quantum 6, (2025) arXiv:2408.06299 DOI

  491. [491]

    K.-Y. Kuo and Y. Ouyang, “Degenerate quantum erasure decoding”, npj Quantum Information 12, (2026) arXiv:2411.13509 DOI

  492. [492]

    F. Kobayashi, H. Manabe, G. A. L. White, T. Farrelly, K. Modi, and T. M. Stace, “Tensor-network decoders for process tensor descriptions of non-Markovian noise”, (2024) arXiv:2412.13739

  493. [493]

    G. Baranes, M. Cain, J. P. B. Ataides, D. Bluvstein, J. Sinclair, V. Vuletić, H. Zhou, and M. D. Lukin, “Leveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms”, Physical Review X 16, (2026) arXiv:2502.20558 DOI

  494. [494]

    I. Rojkov, E. Zapusek, and F. Reiter, “Scalable dissipative quantum error correction for qubit codes”, (2026) arXiv:2507.12534

  495. [495]

    S. Balasubramanian, M. Davydova, and T.-C. Lin, “A passive self-correcting quantum memory in three dimensions”, (2026) arXiv:2605.10943

  496. [496]

    Y. Tomita and K. M. Svore, “Low-distance surface codes under realistic quantum noise”, Physical Review A 90, (2014) arXiv:1404.3747 DOI

  497. [497]

    K. H. Wan, M. Webber, A. G. Fowler, and W. K. Hensinger, “An iterative transversal CNOT decoder”, (2025) arXiv:2407.20976

  498. [498]

    K.-Y. Kuo and C.-Y. Lai, “Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory”, Quantum 10, 2207 (2026) arXiv:2409.18689 DOI

  499. [499]

    N. Delfosse and A. Paetznick, “Spacetime codes of Clifford circuits”, (2023) arXiv:2304.05943

  500. [500]

    S. Omanakuttan, V. Buchemmavari, J. A. Gross, I. H. Deutsch, and M. Marvian, “Fault-Tolerant Quantum Computation Using Large Spin-Cat Codes”, PRX Quantum 5, (2024) arXiv:2401.04271 DOI

  501. [501]

    A. L. Grimsmo and S. Puri, “Quantum Error Correction with the Gottesman-Kitaev-Preskill Code”, PRX Quantum 2, (2021) arXiv:2106.12989 DOI

  502. [502]

    B. W. Walshe, B. Q. Baragiola, R. N. Alexander, and N. C. Menicucci, “Continuous-variable gate teleportation and bosonic-code error correction”, Physical Review A 102, (2020) arXiv:2008.12791 DOI

  503. [503]

    V. V. Sivak et al., “Real-time quantum error correction beyond break-even”, Nature 616, 50 (2023) arXiv:2211.09116 DOI

  504. [504]

    M. Puviani, S. Borah, R. Zen, J. Olle, and F. Marquardt, “Non-Markovian Feedback for Optimized Quantum Error Correction”, Physical Review Letters 134, (2025) arXiv:2312.07391 DOI

  505. [505]

    F. K. Marqversen, J. H. Wesenberg, N. T. Zinner, and U. L. Andersen, “Performance analysis of GKP error correction”, (2025) arXiv:2505.14775

  506. [506]

    J. C. M. de la Fuente, N. Feldman, J. Eisert, and A. Bauer, “High-threshold decoding of non-Pauli codes for 2D universality”, (2026) arXiv:2604.02033

  507. [507]

    A. J. Landahl, J. T. Anderson, and P. R. Rice, “Fault-tolerant quantum computing with color codes”, (2011) arXiv:1108.5738

  508. [508]

    D. S. Wang, A. G. Fowler, C. D. Hill, and L. C. L. Hollenberg, “Graphical algorithms and threshold error rates for the 2d colour code”, (2009) arXiv:0907.1708

  509. [509]

    A. J. Landahl and C. Ryan-Anderson, “Quantum computing by color-code lattice surgery”, (2014) arXiv:1407.5103

  510. [510]

    G. Duclos-Cianci, H. Bombın, and D. Poulin, “Fast decoding algorithm for subspace and subsystem color codes and local equivalence of topological phases”, Personal communication (2011)

  511. [511]

    J. Shapiro, H. Yuen, and A. Mata, “Optical communication with two-photon coherent states–Part II: Photoemissive detection and structured receiver performance”, IEEE Transactions on Information Theory 25, 179 (1979) DOI

  512. [512]

    N. E. Bonesteel and D. P. DiVincenzo, “Quantum circuits for measuring Levin-Wen operators”, Physical Review B 86, (2012) arXiv:1206.6048 DOI

  513. [513]

    A. J. Malcolm et al., “Computing Efficiently in QLDPC Codes”, (2025) arXiv:2502.07150

  514. [514]

    B. J. Brown, N. H. Nickerson, and D. E. Browne, “Fault-tolerant error correction with the gauge color code”, Nature Communications 7, (2016) arXiv:1503.08217 DOI

  515. [515]

    H. M. Solanki and P. Kiran Sarvepalli, “Correcting Erasures with Topological Subsystem Color Codes”, 2020 IEEE Information Theory Workshop (ITW) 1 (2021) DOI

  516. [516]

    H. M. Solanki and P. K. Sarvepalli, “Decoding Topological Subsystem Color Codes Over the Erasure Channel using Gauge Fixing”, (2022) arXiv:2111.14594

  517. [517]

    M. L. Liu, N. Tantivasadakarn, and V. V. Albert, “Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat&amp;apos;s Lemma”, Quantum 8, 1403 (2024) arXiv:2311.18003 DOI

  518. [518]

    T. Farrelly, R. J. Harris, N. A. McMahon, and T. M. Stace, “Tensor-Network Codes”, Physical Review Letters 127, (2021) arXiv:2009.10329 DOI

  519. [519]

    T. Farrelly, R. J. Harris, N. A. McMahon, and T. M. Stace, “Parallel decoding of multiple logical qubits in tensor-network codes”, (2020) arXiv:2012.07317

  520. [520]

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

  521. [521]

    Y. Li, Z. Li, Z. Han, and Z.-W. Liu, “Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes”, (2026) arXiv:2609.26691

  522. [522]

    Z. Han and Z.-W. Liu, “Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation”, (2026) arXiv:2609.28461

  523. [523]

    T. J. Yoder and I. H. Kim, “The surface code with a twist”, Quantum 1, 2 (2017) arXiv:1612.04795 DOI

  524. [524]

    V. Menon, J. P. Bonilla Ataides, R. Mehta, A. Gu, D. B. Tan, and M. D. Lukin, “Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes”, Physical Review X 16, (2026) arXiv:2508.10714 DOI

  525. [525]

    C. Li, J. Preskill, and Q. Xu, “Transversal dimension jump for product qLDPC codes”, (2026) arXiv:2510.07269

  526. [526]

    D. Jiao, M. Bayanifar, A. Ashikhmin, and O. Tirkkonen, “Low Overhead Universal Quantum Computation with Triorthogonal Codes”, (2025) arXiv:2510.05708

  527. [527]

    G. H. Low, W. J. Huggins, D. W. Berry, T. Khattar, A. F. White, N. C. Rubin, and R. Babbush, “A Denser Planar Surface Code”, (2026) arXiv:2605.30455

  528. [528]

    Q. Xu, N. Mannucci, A. Seif, A. Kubica, S. T. Flammia, and L. Jiang, “Tailored XZZX codes for biased noise”, Physical Review Research 5, (2023) arXiv:2203.16486 DOI

  529. [529]

    K. Okada and K. Kasai, “A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases”, (2026) arXiv:2605.23894

  530. [530]

    J. Hastrup and U. L. Andersen, “All-optical cat-code quantum error correction”, (2021) arXiv:2108.12225

  531. [531]

    N. Didier, J. Bourassa, and A. Blais, “Fast Quantum Nondemolition Readout by Parametric Modulation of Longitudinal Qubit-Oscillator Interaction”, Physical Review Letters 115, (2015) DOI

  532. [532]

    Z. Li, T. Roy, D. R. Perez, K.-H. Lee, E. Kapit, and D. I. Schuster, “Autonomous error correction of a single logical qubit using two transmons”, (2023) arXiv:2302.06707

  533. [533]

    Z. Zhang, D. Aasen, and S. Vijay, “The X-Cube Floquet Code”, (2022) arXiv:2211.05784

  534. [534]

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

  535. [535]

    B. J. Brown and D. J. Williamson, “Parallelized quantum error correction with fracton topological codes”, Physical Review Research 2, (2020) arXiv:1901.08061 DOI

  536. [536]

    J. F. S. Miguel, D. J. Williamson, and B. J. Brown, “A cellular automaton decoder for a noise-bias tailored color code”, Quantum 7, 940 (2023) arXiv:2203.16534 DOI

  537. [537]

    K. Hammar, A. Orekhov, P. W. Hybelius, A. K. Wisakanto, B. Srivastava, A. F. Kockum, and M. Granath, “Error-rate-agnostic decoding of topological stabilizer codes”, Physical Review A 105, (2022) arXiv:2112.01977 DOI

  538. [538]

    B. Srivastava, Y. Xiao, A. F. Kockum, B. Criger, and M. Granath, “Sequential decoding of the XYZ\(^2\) hexagonal stabilizer code”, (2025) arXiv:2505.03691

  539. [539]

    D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, “Fault-Tolerant Thresholds for the Surface Code in Excess of 5% Under Biased Noise”, Physical Review Letters 124, (2020) arXiv:1907.02554 DOI

  540. [540]

    C. Gidney, M. Newman, P. Brooks, and C. Jones, “Yoked surface codes”, (2023) arXiv:2312.04522

  541. [541]

    N. P. Breuckmann, K. Duivenvoorden, D. Michels, and B. M. Terhal, “Local Decoders for the 2D and 4D Toric Code”, (2016) arXiv:1609.00510

  542. [542]

    A. L. Toom, “Nonergodic Multidimensional System of Automata”, Problemy Peredachi Informatsii 10(3), 70–79 (1974); Problems of Information Transmission 10(3), 239–246 (1974)

  543. [543]

    A. L. Toom, “Stable and attractive trajectories in multicomponent systems”, Multicomponent random systems 6, 549-575 (1980)

  544. [544]

    L. F. Gray, “Toom’s Stability Theorem in Continuous Time”, Perplexing Problems in Probability 331 (1999) DOI

  545. [545]

    G. Grinstein, “Can complex structures be generically stable in a noisy world?”, IBM Journal of Research and Development 48, 5 (2004) DOI

  546. [546]

    M. Park, N. Maskara, M. Kalinowski, and M. D. Lukin, “Enhancing quantum memory lifetime with measurement-free local error correction and reinforcement learning”, Physical Review A 111, (2025) arXiv:2408.09524 DOI

  547. [547]

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

  548. [548]

    N. Delfosse and B. W. Reichardt, “Short Shor-style syndrome sequences”, (2020) arXiv:2008.05051

  549. [549]

    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

  550. [550]

    H. Yamasaki and M. Koashi, “Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation”, Nature Physics 20, 247 (2024) arXiv:2207.08826 DOI

  551. [551]

    C. Ahn, H. Wiseman, and K. Jacobs, “Quantum error correction for continuously detected errors with any number of error channels per qubit”, Physical Review A 70, (2004) arXiv:quant-ph/0402067 DOI

  552. [552]

    C. Ahn, H. M. Wiseman, and G. J. Milburn, “Quantum error correction for continuously detected errors”, Physical Review A 67, (2003) arXiv:quant-ph/0302006 DOI

  553. [553]

    J. Q. Broshuis, “The Small Stellated Dodecahedron Code: Finding Interleaved Measurement Schedules”, Bachelor’s thesis report-link GitHub-link

  554. [554]

    R. M. Gingrich, P. Kok, H. Lee, F. Vatan, and J. P. Dowling, “All Linear Optical Quantum Memory Based on Quantum Error Correction”, Physical Review Letters 91, (2003) arXiv:quant-ph/0306098 DOI

  555. [555]

    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

  556. [556]

    M. B. Plenio, V. Vedral, and P. L. Knight, “Conditional generation of error syndromes in fault-tolerant error correction”, Physical Review A 55, 4593 (1997) arXiv:quant-ph/9608028 DOI

  557. [557]

    A. G. Fowler, C. D. Hill, and L. C. L. Hollenberg, “Quantum-error correction on linear-nearest-neighbor qubit arrays”, Physical Review A 69, (2004) arXiv:quant-ph/0311116 DOI

  558. [558]

    A. De and L. P. Pryadko, “Universal set of dynamically protected gates for bipartite qubit networks: Soft pulse implementation of the [[5,1,3]] quantum error-correcting code”, Physical Review A 93, (2016) arXiv:1509.01239 DOI

  559. [559]

    A. V. Antipov, E. O. Kiktenko, and A. K. Fedorov, “Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity”, Physical Review A 107, (2023) arXiv:2207.13356 DOI

  560. [560]

    C. Liu, “Exact performance of the five-qubit code with coherent errors”, (2022) arXiv:2203.01706

  561. [561]

    L. Grans-Samuelsson, D. Aasen, and P. Bonderson, “A fault-tolerant pairwise measurement-based code on eight qubits”, (2024) arXiv:2409.13681

  562. [562]

    S. L. Braunstein, “Quantum error correction for communication with linear optics”, Nature 394, 47 (1998) DOI

  563. [563]

    J. Keppens, Q. Eggerickx, V. Levajac, G. Simion, and B. Sorée, “Qudit vs. Qubit: Simulated performance of error correction codes in higher dimensions”, (2025) arXiv:2502.05992

  564. [564]

    H. Gupta, M. Bhattacharyya, R. Jain, and A. Raina, “Fault-tolerant syndrome extraction in [[n,1,3]] non-CSS code family generated using measurements on graph states”, (2026) arXiv:2501.12072

  565. [565]

    H. Goto, “High-performance fault-tolerant quantum computing with many-hypercube codes”, Science Advances 10, (2024) arXiv:2403.16054 DOI

  566. [566]

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

  567. [567]

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

  568. [568]

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

  569. [569]

    M. Li, M. Gutiérrez, S. E. David, A. Hernandez, and K. R. Brown, “Fault tolerance with bare ancillary qubits for a [[7,1,3]] code”, Physical Review A 96, (2017) arXiv:1702.01155 DOI

  570. [570]

    Z. Chen and N. Rengaswamy, “Towards Block-Level Fault-Tolerant Quantum Simulation on Small High-Rate Non-CSS Codes”, (2026) arXiv:2609.16159

  571. [571]

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

  572. [572]

    H. E. Ercan, J. Ghosh, D. Crow, V. N. Premakumar, R. Joynt, M. Friesen, and S. N. Coppersmith, “Measurement-free implementations of small-scale surface codes for quantum-dot qubits”, Physical Review A 97, (2018) arXiv:1708.08683 DOI

  573. [573]

    Z. W. E. Evans and A. M. Stephens, “Message passing in fault-tolerant quantum error correction”, Physical Review A 78, (2008) arXiv:0806.2188 DOI

Classical Domain

  • Binary Kingdom
  • Galois-field Kingdom
  • Matrix Kingdom
  • Analog Kingdom
  • Spherical Kingdom
  • Ring Kingdom
  • Group Kingdom
  • Homogeneous-space Kingdom

Quantum Domain

  • Qubit Kingdom
  • Modular-qudit Kingdom
  • Galois-qudit Kingdom
  • Bosonic Kingdom
  • Spin Kingdom
  • Group quantum Kingdom
  • Homogeneous-space quantum Kingdom
  • Category Kingdom

Classical-quantum Domain

  • Binary c-q Kingdom
  • Analog c-q Kingdom

  • Home
  • Code graph
  • Code lists
  • Concepts glossary
  • Handbook
  • Search

  • Team
  • About

  • 🌒
≡
Error correction zoo by Victor V. Albert, Philippe Faist, and many contributors. This work is licensed under a CC-BY-SA License. See how to contribute.