betaFeedback

WorksPhysics and Astronomy

Parity Push Post-Selection with Soft Parity Constraints for Quantum LDPC Codes

Abstract

Post-selection lowers the logical error rate of a quantum error-correcting code by rejecting unreliable shots. For a code with KK logical observables, the logical gap, a standard post-selection criterion, involves 2K2^K logical classes, and existing approximations to it suffer from a non-convergence error floor or a shielding effect. We introduce a decoder-agnostic post-selection strategy for quantum low-density parity-check (qLDPC) codes, called parity push post-selection (PPPS), which re-decodes a shot once per logical observable with a push toward the opposite parity. Each push adds one check node and one variable node to the Tanner graph of the detector error model, and we accept a shot only when every re-decoding returns a solution in the original logical class. We show that, with degenerate maximum-likelihood decoding, PPPS accepts a shot exactly when the logical gap exceeds the push strength λλ. Applied with the Relay-BP decoder to the [[72,12,6]] bivariate bicycle code at p=10−3p=10^{-3} and the [[144,12,12]] code at p=3×10−3p=3\times10^{-3} under circuit-level depolarizing noise, PPPS lowers the logical error rate by factors of about 50 and 75, respectively, at rejection rates near 1%. We observe that PPPS rejects failures that prior post-selection strategies cannot reject, and thus shows improved performance.

Introduction

Post-selection rejects low-confidence shots and in return lowers the logical error rate (LER) of the accepted shots [1, 2, 3]. For quantum low-density parity-check (qLDPC) codes [4, 5], sacrificing approximately 1% of shots yields a 10- to 100-fold reduction in LER at physical error rates around 10−310^{-3} [6, 7, 8]. Such a trade-off is beneficial wherever a rejected attempt can be discarded and repeated, most notably in the preparation of magic states [9, 10, 11] and in lattice-surgery-based logical operations [12, 13]. In fact, a circuit with NgN_g logical gates keeps a reasonable overall success probability only when the rejection rate per logical gate is at most of order 1/Ng1/N_g [8], which makes LER suppression at low rejection rates particularly important.

The logical gap (or complementary gap), the log-likelihood difference between the two most probable logical classes consistent with the observed syndrome, is a standard criterion for post-selection [10, 14, 15, 16, 17]. For a degenerate maximum-likelihood (DML) decoder, which returns the most probable logical class, the logical gap gives the failure probability of a shot through a logistic function (Eq. (1)) [18]. Thus, we can set a threshold on the gap and bound the failure probability of an accepted shot. The surface code encodes one logical qubit, so one additional decoding run with flipped boundary conditions suffices to estimate the gap from the minimum-weight solutions of the two logical classes [15, 18]. However, a qLDPC code with KK logical observables has 2K2^K logical classes, and computing the gap over all of them becomes infeasible as KK grows.

Three recent strategies avoid the 2K2^K enumeration. Forced-gap post-selection (FG) [7] re-decodes once per logical observable under a hard parity constraint with K+1K + 1 decoding runs in total, and estimates the logical gap from the resulting solutions. Argument reweighting (AR) [8] penalizes the initial solution, re-decodes once or twice, and accepts a shot when its logical class remains unchanged. Cluster-based post-selection [6] quantifies decoding confidence from the cluster structure that clustering-based decoders produce, and rejects low-confidence shots. It relies on clustering-based decoders such as the union-find decoder [19] and belief propagation plus localized statistics decoding (BP+LSD) [20]. We instead build on FG and AR, which probe the logical gap by re-decoding with the same decoder, so that our strategy applies to a broad range of decoders.

Physical CorrectionLogical Classes
Hard Constraint—Forced gap
Soft PenaltyArgument reweightingParity push

Table 1. Post-selection strategies for qLDPC codes, organized by what they manipulate (physical correction or logical classes) and how they do it (hard constraint or soft penalty). Parity push post-selection occupies the soft-penalty/logical-classes cell. As λ→∞\lambda\to\infty a parity push becomes the forced run of Ref. [7].

Yet, both FG and AR have limitations acknowledged in the original papers [7, 8]: a non-convergence error floor in the former and a shielding effect in the latter. The floor in FG arises because the hard constraint prevents the forced runs from converging on most shots, including almost every correctly decoded one, so FG must accept such shots by convention, and failures among them pass any gap threshold. AR suffers from the shielding effect because its soft penalty applies to a single solution, so other probable errors in the same logical class can shield errors of competing logical classes.

Table 1 categorizes these schemes by what they manipulate (a physical correction or logical classes) and how they do it (hard constraint or soft penalty). We propose parity push post-selection (PPPS), which applies a soft penalty to the logical sector of the initially decoded solution, that is, the 2K−12^{K-1} logical classes that agree with it on a given logical observable. For each logical observable, we perform a push by adding one auxiliary check and one slack variable to the detector error model (DEM) [21] Tanner graph. Here, we define the slack variable as an additional variable node that connects only to the auxiliary check. Each auxiliary check requires the observable parity to flip, and its slack variable, with prior log-likelihood ratio (LLR) λ\lambda, allows this requirement to be violated at an LLR penalty of λ\lambda. We call each re-decoding run under a push a probe, and we accept a shot only if all probes return to the logical class of the initial solution. The push strength λ\lambda is the only parameter of PPPS.

In principle, PPPS addresses both limitations of FG and AR. Applying the penalty to an entire logical sector prevents another solution of the same logical class from shielding errors of a competing class. Also, the initial solution still satisfies every check including the auxiliary check with only an LLR penalty of λ\lambda, so a probe can converge without finding a solution with the observable flipped. Therefore, unlike in FG, we expect the probes of a correctly decoded shot to converge in most cases, so we can reject shots whose probes fail to converge.

Under DML decoding, all KK probes return to the initial logical class if and only if the logical gap over all 2K2^K logical classes exceeds λ\lambda. PPPS therefore reduces a threshold on this gap to KK additional decoding runs and, through Eq. (1), bounds the failure probability of every accepted shot. DML decoding is itself intractable in general [22], so we run PPPS with heuristic BP-family decoders. For such decoders λ\lambda thresholds a weight difference rather than the exact gap, and we evaluate the resulting trade-off between the LER and the rejection rate numerically.

In this work, we formalize PPPS and evaluate it in simulations of the [[72,12,6]][[72, 12, 6]] and [[144,12,12]][[144, 12, 12]] bivariate bicycle codes [5, 23] with the Relay-BP decoder [24]. The results show a 50- to 75-fold LER suppression at rejection rates of about 1%. At the same decoding cost as FG, PPPS reaches LERs below the error floor of FG in every setting that we simulate and below or close to those of AR, which indicates that it addresses the limitations of both strategies. Comparing two physical error rates on the [[72,12,6]][[72, 12, 6]] code, we find that PPPS rejects failures increasingly through non-convergence as the error rate rises, which is the signal that FG cannot use.

Furthermore, we show that a decoder’s ability to reject failures determines the LER, and its ability to return correctly decoded shots determines the rejection rate. Numerical simulations on plain BP and belief propagation plus ordered statistics decoding (BP+OSD) [25, 26] confirm this, demonstrating that PPPS is broadly compatible with various BP-family decoders and enhances their performance.

The main contributions of this work are:

(i) We introduce PPPS, which structurally addresses the limitations of previous logical-gap-based methods by adding one variable node and one check node to the DEM Tanner graph for each probe.

(ii) We provide numerical evidence of the effectiveness of PPPS on bivariate bicycle codes with the Relay-BP decoder, in particular large LER reductions at moderate rejection rates.

(iii) We show through numerical simulations that PPPS is applicable to BP-family decoders in general, and that the rejection rate depends on whether correctly decoded shots return under the push, and the LER on how many failures still return.

Results

Detector error model and logical gap

The DEM [21] of a depolarizing circuit-level noise model consists of a detector matrix H∈F2M×NH \in\mathbb{F}_2^{M \times N}, an observable matrix A∈F2K×NA \in\mathbb{F}_2^{K \times N}, and a prior probability pip_i for each fault mechanism ii. Here NN, MM, and KK are the numbers of fault mechanisms, detectors, and logical observables, respectively. A fault configuration e=(e1,…,eN)∈F2Ne = (e_1,\ldots,e_N) \in\mathbb{F}_2^N produces the syndrome σ=He\sigma= He and the logical outcome c=Aec = Ae. The decoder has access only to σ\sigma and returns a predicted error e^\hat{e} satisfying He^=σH\hat{e} = \sigma, and decoding succeeds when Ae^=AeA\hat{e} = Ae.

We assume independent fault mechanisms so that P(e)=∏ipiei(1−pi)1−eiP(e) = \prod_i p_i^{e_i}(1-p_i)^{1-e_i}, where pip_i stands for the probability that fault mechanism ii occurs (ei=1e_i = 1). The weight

w(e)=∑i∈supp⁡(e)ln⁡1−pipi=−ln⁡P(e)+∑iln⁡(1−pi),w(e) = \sum_{i \in\operatorname{supp}(e)} \ln\frac{1-p_i}{p_i} = -\ln P(e) + \sum_i \ln(1-p_i),

where supp⁡(e)={i:ei=1}\operatorname{supp}(e) = \{i:e_i = 1\}, differs from −ln⁡P(e)-\ln P(e) by a term that sums over all fault mechanisms and does not depend on ee. Thus, the configuration of smallest weight is most probable. Each term ln⁡1−pipi\ln\frac{1-p_i}{p_i} is the prior LLR of the ii-th fault mechanism, and a positive LLR favors ei=0e_i = 0, that is, the fault not occurring.

Two solutions ee and e′e' of the same syndrome differ by x=e+e′∈ker⁡Hx = e + e' \in\ker H, satisfying Hx=0Hx = 0, and they have different logical effects when xx changes the logical outcome, Ax≠0Ax \ne0. The solution set {e:He=σ}\{e:He = \sigma\} therefore splits into 2K2^K logical classes according to the value of c=Aec = Ae. We write e(0)e^{(0)} for the solution that the initial decoding run, which we also call the baseline decoding, returns and L(0)=Ae(0)L^{(0)} = Ae^{(0)} for its logical class. We define the mass of logical class cc as

Zc(σ)=∑e:He=σ, Ae=cP(e),Z_c(\sigma) = \sum_{e:He=\sigma,\ Ae=c} P(e),

and the actual fault lies in logical class cc with probability Zc/∑c′Zc′Z_c/\sum_{c'} Z_{c'}, where the denominator is the total probability of observing σ\sigma.

Let Z(1)≥Z(2)Z^{(1)} \ge Z^{(2)} be the two largest logical class masses, so that DML decoding returns the class of mass Z(1)Z^{(1)}. We define the logical gap as g=ln⁡(Z(1)/Z(2))g = \ln(Z^{(1)}/Z^{(2)}), which coincides with the “exact gap” of Ref. [7]. In the literature, the logical (or complementary) gap more commonly denotes the weight difference between the minimum-weight solutions of the two classes [10, 15, 17], which keeps only the largest term of each ZcZ_c. With our definition, DML decoding fails with probability

P(fail∣g,α)=1+αeg+1+α,(1)\mathcal{P}(\mathrm{fail}\mid g,\alpha) = \frac{1+\alpha}{e^g+1+\alpha}, \tag*{(1)}

where α\alpha is the total mass of the remaining 2K−22^K-2 classes divided by Z(2)Z^{(2)}. We derive Eq. (1) in § 4.2. Setting α=0\alpha= 0 recovers the two-class expression of Ref. [18], derived for the free-energy difference between two homology classes of the toric code under DML decoding. Equation (1) shows that the gap is more than a ranking score: if we accept shots satisfying g>λg > \lambda, every accepted shot fails with probability below (1+α)/(eλ+1+α)(1+\alpha)/(e^\lambda+1+\alpha). However, computing gg exactly requires the masses of all 2K2^K logical classes, which is infeasible for codes with large KK. We therefore aim to post-select on the logical gap without computing the mass of every logical class.

Parity push for DML decoding

The key idea of PPPS is to penalize every solution that agrees with the initial solution on one logical observable and to check whether the decoder still returns the initial logical class. For each logical observable jj, the value of cjc_j splits the 2K2^K logical classes into two logical sectors of 2K−12^{K-1} classes each. We call the sector {c:cj=Lj(0)}\{c : c_j = L_j^{(0)}\}, which contains L(0)L^{(0)}, the baseline logical sector of observable jj. We call the other sector, {c:cj≠Lj(0)}\{c : c_j \ne L_j^{(0)}\}, the opposite logical sector. We add one auxiliary check and one slack variable zz to the DEM Tanner graph for each logical observable jj to push the entire baseline logical sector [Fig. 1(a)]. The detector matrix HH transforms to

H′=[H0Aj1](2)H' = \begin{bmatrix} H & 0 \\ A_j & 1 \end{bmatrix} \tag*{(2)}

where the new row consists of the jj-th row AjA_j of AA and an additional 1. The row AjA_j marks the fault mechanisms that flip the jj-th observable, and the additional 1 connects the slack variable to the auxiliary check. We append the bit 1⊕Lj(0)1 \oplus L_j^{(0)} to the syndrome as the value of the auxiliary check, so that the check enforces Aje⊕z=1⊕Lj(0)A_j e \oplus z = 1 \oplus L_j^{(0)}. The slack variable zz connects only to the auxiliary check and carries the prior probability pz=1/(1+eλ)p_z = 1/(1 + e^\lambda), corresponding to a prior LLR of λ≥0\lambda\ge0. In DEM terms, zz is one more fault mechanism with probability pzp_z, and it corresponds to no physical fault. Other edge connections and prior LLR values remain unchanged.

Since the auxiliary check enforces Aje⊕z=1⊕Lj(0)A_j e \oplus z = 1 \oplus L_j^{(0)}, the value of the slack variable zz is determined by the resulting error configuration ee: a configuration that retains the baseline parity (Aje=Lj(0)A_j e = L_j^{(0)}) corresponds to z=1z = 1, while a configuration that flips it (Aje≠Lj(0)A_j e \ne L_j^{(0)}) corresponds to z=0z = 0. As P(z=1)=e−λP(z=0)P(z=1) = e^{-\lambda}P(z=0) by the definition of the LLR, every ee with He=σHe = \sigma has probability P′(e)=P(e)P(z)P'(e) = P(e)P(z) in the deformed Tanner graph:

P′(e)={11+eλP(e)if Aje=Lj(0),eλ1+eλP(e)if Aje≠Lj(0).(3)P'(e) = \begin{cases} \frac{1}{1 + e^\lambda}P(e) & \text{if } A_j e = L_j^{(0)}, \\ \frac{e^\lambda}{1 + e^\lambda}P(e) & \text{if } A_j e \ne L_j^{(0)}. \end{cases} \tag*{(3)}

Equation (3) holds exactly, and we derive Eqs. (3)–(6) in § 4.2.

Thus, the mass of logical class cc becomes

Zc′={11+eλZcif cj=Lj(0),eλ1+eλZcif cj≠Lj(0).(4)Z'_c = \begin{cases} \frac{1}{1+e^\lambda} Z_c & \text{if } c_j = L_j^{(0)},\\ \frac{e^\lambda}{1+e^\lambda} Z_c & \text{if } c_j \ne L_j^{(0)}. \end{cases} \tag*{(4)}

Equation (4) shows that the mass of every logical class in the baseline logical sector of observable jj decreases by the factor e−λe^{-\lambda} relative to the classes of the opposite logical sector, that is, by exactly λ\lambda in log-mass. The remaining factor eλ/(1+eλ)e^\lambda/(1+e^\lambda) is common to all classes and does not change their order. Thus, unlike AR, which pushes a single solution, our gadget pushes an entire logical sector by λ\lambda nats relative to the opposite logical sector and thereby avoids the shielding effect. Figure 1(b) illustrates the class masses before and after the push.

The parity-push gadget

Figure 1. The parity-push gadget. (a) We add one auxiliary check (red square) and one slack variable zz (red circle, prior LLR λ\lambda) to the DEM Tanner graph. The auxiliary check connects to the fault mechanisms in supp⁡(Aj)\operatorname{supp}(A_j) (thick red edges) and carries the syndrome bit 1⊕Lj(0)1 \oplus L_j^{(0)}. (b) Class masses before and after the push, drawn for four logical classes. Blue bars show the classes of the baseline logical sector, which contains the baseline logical class L(0)L^{(0)}, and gray bars show the logical classes of the opposite logical sector. Up to a factor common to all classes, the push lowers every class of the baseline logical sector by λ\lambda and leaves the opposite sector unchanged [Eq. (4)]. The probe returns if L(0)L^{(0)} still exceeds the class of largest mass in the opposite sector [Eq. (5)].

We regard a shot as reliable when the probes for all logical observables return to the logical class L(0)L^{(0)} under the push. If a DML decoder performs both the initial decoding and the probes, Eq. (4) directly gives the outcome of each probe. Under the assumption that the class of largest mass is unique in each decoding run, the initial decoding step returns logical class L(0)L^{(0)}, and the probe on logical observable jj returns to that class if and only if

e−λZL(0)>max⁡c: cj≠Lj(0)Zc.(5)e^{-\lambda} Z_{L^{(0)}} > \max_{c:\,c_j\ne L_j^{(0)}} Z_c. \tag*{(5)}

Every logical class other than L(0)L^{(0)} differs from it in at least one logical observable, so the KK opposite logical sectors cover all 2K−12^K-1 competing classes. Hence,

all probes return⟺e−λZ(1)>Z(2)⟺g>λ.(6)\text{all probes return} \Longleftrightarrow e^{-\lambda}Z^{(1)} > Z^{(2)} \Longleftrightarrow g > \lambda. \tag*{(6)}

Therefore, under DML decoding, KK additional decoding steps place a threshold on the gap over 2K2^K logical classes, and the push strength λ\lambda is that threshold.

We note two limiting cases of the construction: λ=0\lambda=0 and λ=∞\lambda=\infty. At λ=0\lambda=0 Eq. (3) gives P′(e)∝P(e)P'(e)\propto P(e), so the deformed problem remains equivalent to the initial problem. For λ=∞\lambda=\infty, the slack variable zz can no longer take the value 1. Consequently, the auxiliary check becomes a hard parity constraint, and the probes become forced runs of Ref. [7].

Parity push for practical decoders

DML decoding remains impractical for qLDPC codes, so we first adapt our strategy to a minimum-weight decoder, which ignores degeneracy. A minimum-weight decoder returns the minimum-weight solution e(0)e^{(0)} [27], and we take its logical class L(0)L^{(0)} as the most probable one. After the initial decoding returns e(0)e^{(0)}, the jj-th probe increases the weight of every solution in the baseline logical sector of observable jj by λ\lambda. A probe therefore flips only if the minimum-weight solution of the opposite logical sector has weight below w(e(0))+λw(e^{(0)})+\lambda, and all probes return if and only if the minimum weight outside class L(0)L^{(0)} exceeds w(e(0))w(e^{(0)}) by more than λ\lambda. In this case, λ\lambda thresholds the weight difference between the minimum-weight solutions inside and outside class L(0)L^{(0)} rather than the exact logical gap, so PPPS becomes equivalent to post-selection on the conventional logical gap [10, 15, 17]. Thus, Eq. (1) no longer converts the threshold into a strict bound on the failure probability and gives only an approximation.

Exact minimum-weight decoding is also intractable for general qLDPC codes, so we use practical BP-family decoders. Such a decoder is heuristic: within its iteration budget it returns a solution that typically has low weight, with no guarantee that the weight is minimal. Practical decoders therefore give no guarantee on the failure probability, and the threshold becomes an even rougher approximation than with a minimum-weight decoder.

The slack variable and the auxiliary check are ordinary nodes of the Tanner graph, so any decoder that returns a correction satisfying the syndrome on this Tanner graph can run the probes. Within its budget, such a decoder may fail to find the minimum-weight solution of a logical sector, or even to find any solution at all [28, 29]. A practical probe therefore has three possible outcomes: it may return if it converges to a solution in class L(0)L^{(0)}, flip if it converges to a solution in a class other than L(0)L^{(0)}, or abstain if it does not converge within its budget. We accept a shot only if every probe returns, and reject it if any probe flips or abstains. While we do not read the hard decision of an abstaining probe, § 2.8 evaluates a relaxed rule that does. Figure 2 summarizes the overall procedure of our strategy, and Algorithm 1 in § 4.1 gives its pseudocode.

Overview of parity push post-selection

Figure 2. Overview of parity push post-selection. Phase 1: the decoder runs on the syndrome σ\sigma and returns a baseline correction e(0)e^{(0)} with logical class L(0)=Ae(0)L^{(0)} = A e^{(0)}. The shot is rejected at once if the baseline decoding does not converge. Phase 2: for each of the KK logical observables, a probe decodes the modified problem (Hj′,σj′)(H'_j,\sigma'_j) with one auxiliary check and one slack variable of prior LLR λ\lambda [Figure 1(a)]. The probes need only L(0)L^{(0)} and therefore run independently of each other. Phase 3: each probe returns, flips or abstains, and the shot is accepted only if all KK probes return. As λ→∞\lambda\to\infty each probe becomes a forced run of Ref. [7].

We add three remarks on the rule. First, we compare the full logical class Ae^(j)A\hat{e}^{(j)} of each probe solution with L(0)L^{(0)} and not only bit jj. A probe can converge to a class that keeps bit jj of L(0)L^{(0)} but differs in another observable. Such a probe does not support L(0)L^{(0)}, so we count it as a flip. Second, we push every observable with the same λ\lambda. Each probe depends on (σ,L(0),j,λ)(\sigma,L^{(0)},j,\lambda), and the probes are independent and differ only in the observable jj. Third, we run each probe from a cold start: we initialize all messages from the priors and carry over no messages from the initial run, sharing only its seed (§ 4.4). Since each probe is independent, the decision does not depend on the order in which the probes run.

Relation to the forced run. When the baseline run and the forced runs find only one logical class, which requires that no forced run converges, FG sets the gap to infinity by convention and accepts the shot [7]. A forced run under a hard constraint fails to converge on almost every correctly decoded shot (§ 4.5), so rejecting non-converged shots instead would reject nearly all correctly decoded shots. Failures with an infinite gap therefore pass for any choice of the gap threshold, which produces the error floor. In PPPS the initial solution with z=1z = 1 still satisfies every check including the auxiliary check, and its weight increases only by λ\lambda. With this solution available, a probe tends to converge on correctly decoded shots, and we can treat one that fails to converge as unreliable and reject the shot. Consequently, PPPS can reject failures that FG accepts. This signal has a price: a correctly decoded shot whose probe fails to converge under the push is also rejected, and we expect this cost to grow with λ\lambda. Whether the advantage or the cost dominates depends on how often correctly decoded shots and failures return under the push, which we examine numerically via simulation.

Computational cost. PPPS runs the decoder K+1K + 1 times per shot. The probes start after the initial decoding, and they are independent of each other. If they run in parallel, the latency is that of two decoding stages, as for FG [7]. Each probe adds one row and one column to the check matrix, which raises the number of edges of the Tanner graph by about 2%2\%. A sequential implementation can stop at the first flip or abstention, but this saves runs only on rejected shots. An accepted shot always runs all KK probes. § 2.4 gives the resulting cost for our decoder budgets, and § 4.7 derives it.

Simulation setup

We benchmark our post-selection strategy via simulations on bivariate bicycle codes [5] with BP-family decoders. The simulation consists of Z-basis memory experiments whose K=12K = 12 logical observables are the logical Z operators. We simulate the [[72,12,6]][[72, 12, 6]] and [[144,12,12]][[144, 12, 12]] codes with 6 and 12 rounds of syndrome extraction, respectively, under circuit-level depolarizing noise of strength pp (§ 4.3). We consider three settings: the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3} and 3×10−33 \times10^{-3} and the [[144,12,12]][[144, 12, 12]] code at p=3×10−3p = 3 \times10^{-3} (Figure 3). We report the LER per round and the rejection rate per shot, as in Ref. [7]. A shot of the [[144,12,12]][[144, 12, 12]] code runs twice as many rounds as a shot of the [[72,12,6]][[72, 12, 6]] code, so the rejection rates per shot of the two codes are not directly comparable.

Figure 3. Post-selection with Relay-BP on bivariate bicycle codes. Logical error rate per round against rejection rate per shot for the [[72,12,6]][[72, 12, 6]] code at (a) p=10−3p = 10^{-3} and (b) p=3×10−3p = 3 \times10^{-3} with six rounds, and (c) the [[144,12,12]][[144, 12, 12]] code at p=3×10−3p = 3 \times10^{-3} with twelve rounds. The dashed line is the logical error rate without post-selection (2.17×10−62.17 \times10^{-6}, 2.71×10−42.71 \times10^{-4} and 1.12×10−61.12 \times10^{-6}). PPPS points are labeled by the push strength λ\lambda. The FG curve sweeps the gap threshold and stays flat beyond the point where every finite gap is rejected. AR points sweep the reweighting strength zz. Open markers show points with no accepted failure. They are placed at the logical error rate that half a failure would give, and their bars extend to the upper confidence limit. The rejection rate includes the shots on which the baseline decoder does not converge, which is the same for all three methods. Shaded regions are 95% confidence intervals (Wilson for the rejection rate, Garwood for the logical error rate [30, 31]). Correctly decoded shots are sampled: 19,999 for all methods in (a), 9,936 for all methods in (b), and 5,292 for PPPS and 9,890 for FG and AR in (c).

We use Relay-BP [24] to compare PPPS with FG and AR. All three methods run on the same shots, start from the same initial solution, and use the same decoder settings for every re-decoding run. The only exception is the [[144,12,12]][[144, 12, 12]] code, where PPPS runs on fewer correctly decoded shots than FG and AR (§ 4.6). For PPPS, the probes use a smaller Relay-BP budget than the baseline, with the same parameters for every probe so that all probes apply the same push. Table 2 lists the parameter values, and § 4.4 describes the implementation of the probes. With these budgets, PPPS runs about 2 and 5 times the operations of the baseline decoding on the [[72,12,6]][[72, 12, 6]] and [[144,12,12]][[144, 12, 12]] codes, respectively. Its latency with parallel probes is about 1.1 and 1.3 times that of the baseline (§ 4.7).

Running each post-selection method on every shot is infeasible, so we evaluate the performance on two sets of shots. The first set holds the failures of the baseline decoder, which we collect with a two-pass procedure for the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3} and the [[144,12,12]][[144, 12, 12]] code and with the full baseline decoder for the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3} (§ 4.6). The two-pass procedure gives lower bounds on the numbers of failures and the baseline LERs, and we run each method on every collected failure. The second set is a sample of correctly decoded shots, on which we run each method and estimate the fraction that it rejects. The error bars on the rejection rate therefore reflect the sample of correctly decoded shots, and those on the LER reflect the number of accepted failures (§ 4.6).

Results for Relay-BP on the [[72,12,6]][[72,12,6]] code

Figure 3(a) and (b) present the simulation results for the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3} and p=3×10−3p = 3 \times10^{-3}, respectively. Each panel plots the LER per round against the rejection rate for FG, AR, and PPPS, all with Relay-BP. We obtain the FG and AR curves from our own implementations with the decoder settings given in Methods, so their values differ from those reported in Refs. [7, 8]. Supplementary Tables 1–3 list the values of every point.

In (a) the PPPS curve starts close to the baseline at λ=0\lambda= 0, which serves as a control without push (§ 4.4). The LER then decreases with λ\lambda to about 50 times below the baseline at a rejection rate of about 1%. At the lowest rejection rates FG lies below PPPS, and the two curves meet near a rejection rate of 0.3%. The FG curve then flattens at a rejection rate of about 0.5%, where every failure with a finite gap is rejected. PPPS continues below this floor and reaches a two to three times lower LER at rejection rates above 1%. AR stays within a factor of about two of PPPS over the whole range.

In (b) the PPPS curve starts at a rejection rate of 2.8%, since the probes without a push already reject about 2% of correctly decoded shots (§ 4.4). The LER then decreases with λ\lambda and reaches a value 43 times below the baseline at a rejection rate of 20%. FG lies below PPPS until its curve flattens at a rejection rate of 7%, and PPPS falls below this floor from a rejection rate of 8%. AR needs about twice the rejection rate of PPPS for a similar LER.

PPPS rejects more failures as λ\lambda increases at both physical error rates, but the two rates differ in how these failures are rejected, by a flip or by an abstention. For example, at λ=8\lambda= 8 only 3.6% of failures are rejected through abstention at p=10−3p = 10^{-3}, while this proportion grows to 21% at p=3×10−3p = 3 \times10^{-3}. We attribute this rise in abstention to the decoder needing more iterations to converge at the higher physical error rate (Supplementary Note 1). PPPS rejects a shot whose probes do not converge, whereas FG accepts most of these failures because their forced runs do not converge either (§ 2.3). Since abstention rejects a larger share of the failures at p=3×10−3p = 3 \times10^{-3}, PPPS falls below the FG floor with a smaller push at the higher physical error rate.

Results for Relay-BP on the [[144,12,12]][[144,12,12]] code

In Figure 3(c) the PPPS curve starts at a rejection rate of 0.05%, and the probes without a push reject only 2 of the 5,292 sampled correctly decoded shots. A push of λ=1\lambda= 1 already lowers the LER by about 20 times at a rejection rate of 0.14%. The LER then decreases further with λ\lambda, and the slight increase at λ=2\lambda= 2 lies within the statistical uncertainty. Simulation results show that a rejection rate of 1% lowers the LER by about 75×75\times. At λ=16\lambda= 16 the reduction reaches about 170×170\times at a rejection rate of 9%, but only two failures remain accepted (Supplementary Table 1).

Unlike for the [[72,12,6]][[72, 12, 6]] code, PPPS lies below FG at every rejection rate from about 0.1%. The FG curve flattens at a rejection rate of 1.4%, and PPPS falls below this floor already at 0.2%. AR stays above PPPS at every rejection rate from about 0.1%, by a factor of about five near 1%.

At p=3×10−3p = 3 \times10^{-3}, the [[144,12,12]][[144, 12, 12]] code differs from the [[72,12,6]][[72, 12, 6]] code in how PPPS rejects the failures. On the [[144,12,12]][[144, 12, 12]] code, PPPS rejects most failures by a flip, and abstention accounts for 5% of the failures at λ=8\lambda= 8 against 21% on the [[72,12,6]][[72, 12, 6]] code. The probes also rarely abstain on correctly decoded shots of the [[144,12,12]][[144, 12, 12]] code, which keeps the rejection rate low. Part of this difference may come from the probe budget. Because the DEM Tanner graph of the [[144,12,12]][[144, 12, 12]] code is larger, we set its probe budget about four times as large as that of the [[72,12,6]][[72, 12, 6]] code (Table 2). These data therefore do not separate the effect of the code from that of the budget (Supplementary Note 1).

Results for other BP-family decoders

Figure 4 presents the results of PPPS with three BP-family decoders: plain BP, BP+OSD, and Relay-BP, on the [[72,12,6]][[72, 12, 6]] code (a) and the [[144,12,12]][[144, 12, 12]] code (b), both at p=3×10−3p = 3 \times10^{-3}. Plain BP runs min-sum decoding for 100 iterations, BP+OSD [25, 26] adds a combination-sweep OSD post-processing of order 10, and Relay-BP uses the settings of Table 2. Each curve starts from the baseline point of its own decoder, which rejects only the shots on which the decoder does not converge. In (a) the baseline of BP+OSD rejects no shot, that of Relay-BP rejects 0.5%, and that of plain BP already rejects 40%. The low starting LER of plain BP therefore reflects the shots it excludes rather than better decoding. Strengthening the push λ\lambda lowers the LER and in return raises the rejection rate for every decoder. This trend comes from two factors: fewer failures return, which lowers the LER, and more correctly decoded shots fail to return, which raises the rejection rate (§ 4.6). Supplementary Table 4 lists the values of every point.

Figure 4. PPPS with three BP-family decoders at p=3×10−3p = 3 \times10^{-3}. Logical error rate per round against rejection rate per shot for (a) the [[72,12,6]][[72, 12, 6]] code, where all decoders run on the same 200,000 shots, and (b) the [[144,12,12]][[144, 12, 12]] code, where BP+OSD runs on all 1.06 million shots and Relay-BP on 28.2 million. Filled markers are the baseline points of each decoder: the rejection rate is the fraction of shots on which the baseline decoder does not converge, and the logical error rate is that of the remaining shots. PPPS points are labeled by λ\lambda. Plain BP is not shown in (b) because it converges on only 30.3% of shots and no failures occur among them (Table 3). Open markers show points with no accepted failure. They are placed at the logical error rate that half a failure would give, and their bars extend to the upper confidence limit. Shaded regions are 95% confidence intervals (Wilson for the rejection rate, Garwood for the logical error rate). The Relay-BP probes use a budget of 25 legs in (a) and 100 legs in (b) against 300 for the baseline (Table 2).

[[72,12,6]][[72, 12, 6]][[144,12,12]][[144, 12, 12]]
E\mathcal{E}91,116391,320
E~/E\widetilde{\mathcal{E}}/\mathcal{E}1.0241.024
Ibase/IprobeI_{\mathrm{base}} / I_{\mathrm{probe}}18,080 / 1,58018,080 / 6,080
PPPS
Operations, Eq. (14)2.075.13
Latency, sequential, Eq. (15)2.055.04
Latency, parallel, Eq. (16)1.091.34
AR
Operations and latency1.171.67

Table 4. Cost of PPPS and AR relative to the baseline decoding, with every decoding at its iteration budget. Both settings of the [[72,12,6]][[72, 12, 6]] code share one DEM. The latencies assume a fixed time per iteration.

In (a), we observe that BP+OSD outperforms Relay-BP in that it requires a lower rejection rate to achieve an equivalent LER. While Relay-BP requires an 8.0% rejection rate to reach an LER of 3.5×10−53.5 \times10^{-5}, BP+OSD requires only 2.9% to reach a similar level. Plain BP reaches this LER with a rejection rate of 52%, which is far higher. This comparison holds for our decoder settings, in which the Relay-BP probes use a smaller budget than their baseline whereas the probes of BP+OSD and plain BP use the settings of their baselines (§ 4.4). For all three decoders, the LER decreases consistently as λ\lambda increases.

The [[144,12,12]][[144, 12, 12]] simulation results in (b) also show that both BP+OSD and Relay-BP lower the LER with PPPS. BP+OSD reaches an LER of 7.9×10−87.9 \times10^{-8} at a rejection rate of 0.48%, while Relay-BP reaches 1.5×10−81.5 \times10^{-8} at a rejection rate of 0.94%. At λ=12\lambda= 12 BP+OSD accepts none of the 497 failures, so resolving the LER at larger λ\lambda would require more shots. We also note that we do not post-select plain BP on the [[144,12,12]][[144, 12, 12]] code because it converges on only 30.3% of the shots and no failure occurs among them (Table 3).

Results for the relaxed rejection rule

Figure 5 compares the strict rejection rule of PPPS with a relaxed one for the three settings of Fig. 3. The strict rule rejects a shot whose probe abstains, whereas the relaxed rule reads the hard decisions of the non-converged probes and accepts the shot when no probe flips and every decision lies in L(0)L^{(0)}. For λ≥2\lambda\ge2 the relaxed curve lies to the left of the strict curve in panels (a)–(c). The relaxed rule lowers the rejection rate while the LER stays within the confidence interval of the strict rule: at λ=16\lambda= 16 it drops from 4.1% to 2.4% for the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3}, from 56% to 46% for the same code at p=3×10−3p=3\times10^{-3}, and from 9.0% to 7.2% for the [[144,12,12]][[144,12,12]] code. Supplementary Table 5 lists the values of every point.

The gain comes from correctly decoded shots, while failures are almost untouched: the relaxed rule accepts at most two additional failures at any λ\lambda for the [[72,12,6]][[72,12,6]] code at p=10−3p=10^{-3}, at most nine at p=3×10−3p=3\times10^{-3}, and none for the [[144,12,12]][[144,12,12]] code. The hard decisions of non-converged probes thus stay in L(0)L^{(0)} for a sizable part of the correctly decoded shots and rarely for failures.

We nevertheless keep the strict rule in the rest of this work, because the hard decision of a non-converged probe depends on the iteration at which the decoder stops (§ 4.4), and we do not count a probe that has not converged as a return.

Discussion

In this work we introduce parity push post-selection (PPPS) for quantum low-density parity-check (qLDPC) codes, which penalizes the logical sector of the initial solution for each logical observable and accepts a shot only if every re-decoding still returns the initial logical class. One slack variable and one auxiliary check added to the Tanner graph push the decoder toward the logical sector opposite to that of the initial solution. Under DML decoding, all probes return exactly when the logical gap over the 2K2^{K} logical classes exceeds λ\lambda [Eq. (6)], and λ→∞\lambda\to\infty recovers the forced run of FG. Like FG, PPPS needs only KK re-decodings instead of one decoding in each of the 2K2^{K} logical classes. Unlike FG, it keeps the initial solution feasible under the push, so a probe that fails to converge becomes a signal for rejection.

With Relay-BP, PPPS lowers the LER of the [[72, 12, 6]] code at p=10−3p = 10^{-3} and of the [[144, 12, 12]] code at p=3×10−3p = 3 \times10^{-3} by about 50× and 75×, respectively, at rejection rates near 1%. At p=3×10−3p = 3 \times10^{-3} the [[72, 12, 6]] code needs a larger rejection rate than at p=10−3p = 10^{-3}, and PPPS lowers its LER by about 43× at a rejection rate of 20%. It reaches LERs below the error floor of FG in all three settings. Against AR, PPPS stays within a factor of two in LER on the [[72, 12, 6]] code at p=10−3p = 10^{-3} and needs about half the rejection rate for the same LER at p=3×10−3p = 3 \times10^{-3}. On the [[144, 12, 12]] code its LER is about five times lower than that of AR at rejection rates near 1%. PPPS also runs on plain BP and BP+OSD without modification, and the rejection rate that it needs for a given LER depends on how often the probes of each decoder return on correctly decoded shots. A relaxed rule that reads the hard decisions of non-converged probes lowers the rejection rate further at almost the same LER.

The rejection rates near 1% at which PPPS reaches these reductions add little to the cost of a quantum protocol. Every rejected shot must be prepared again, so a step with rejection rate rr takes 1/(1−r)1/(1-r) attempts on average [6], which is about 1.01 at r=1%r = 1\%. A protocol that restarts whenever one of its NN post-selected steps rejects succeeds with probability (1−r)N(1-r)^N, so the cost compounds with depth, and a low rr keeps this growth slow. Post-selection at such rates can cost far less than enlarging the code [6]. The classical cost equals that of FG, since both run KK re-decodings with the same budget (§ 4.7). Our probes use a smaller budget than the baseline (Table 2), so the probe stage adds only a fraction of the baseline latency (§ 2.4). A larger probe budget would raise this cost, and we expect it to lower the rejection rate because fewer correctly decoded shots would abstain.

One may ask why we soften the constraint instead of making the forced run converge, as [7] proposes with OSD [25] or decimation [32]. Such a remedy turns post-selection into three stages: the initial decoding, the forced run and a post-processing stage. The third stage runs whenever the forced run fails to converge, which happens on almost every correctly decoded shot (§ 2.3), so most shots pass through all three stages. PPPS needs only two stages, the initial decoding and the probes. The initial solution keeps each probe feasible under the push, so the probe converges on almost every correctly decoded shot and needs no third stage. PPPS therefore reaches below the floor of FG with one fewer stage than these remedies. Its probes, however, still involve the same high-degree auxiliary check as the forced runs of FG.

Finally, we identify limitations of our strategy and simulations, together with directions for future work.

Heuristic decoders. The push strength λ\lambda is an exact gap threshold only under DML decoding. With BP-family decoders the failure probability bound of Eq. (1) does not hold, and we report only measured LERs. A bound that relates the outcomes of practical probes to the logical gap would provide further theoretical justification for PPPS with practical decoders.

Probe budget. The rejection rate of PPPS depends on the probe budget, since most rejected correctly decoded shots are ones on which a probe abstains. A larger budget would lower this cost, but it may also let some failures return, so its net effect on the trade-off remains to be measured. The [[144, 12, 12]] code uses a probe budget four times as large as that of the [[72, 12, 6]] code, so our data do not separate the effect of the code from that of the budget. While the relaxed rule of Figure 5 recovers part of the cost, the probe budget remains to be optimized.

Figure 5. Strict and relaxed rejection rules of PPPS with Relay-BP. Logical error rate per round against rejection rate per shot for the [[72,12,6]][[72,12,6]] code at (a) p=10−3p=10^{-3} and (b) p=3×10−3p=3\times10^{-3} with six rounds, and (c) the [[144,12,12]][[144,12,12]] code at p=3×10−3p=3\times10^{-3} with twelve rounds. Panels (d)–(f) show the rejection rate per shot of both rules at each push strength λ\lambda for the settings of (a)–(c), respectively. The strict rule (solid lines, filled bars) rejects a shot when any probe flips or abstains, as in Figure 3. The relaxed rule (dotted lines, open bars) reads the hard decision of each non-converged probe and accepts the shot when no probe flips and every such decision lies in L(0)L^{(0)}. In (a)–(c) strict points are labeled by the push strength λ\lambda, and each relaxed point has the same λ\lambda as the strict point it pairs with. The dashed line is the logical error rate without post-selection (2.17×10−62.17\times10^{-6}, 2.71×10−42.71\times10^{-4} and 1.12×10−61.12\times10^{-6}). The rejection rate includes the shots on which the baseline decoder does not converge. Shaded regions in (a)–(c) are 95% confidence intervals (Wilson for the rejection rate, Garwood for the logical error rate). The bars in (d)–(f) are point estimates (Supplementary Tables 1 and 5). Both rules run on the same failures and the same sample of correctly decoded shots: 19,999 in (a) and (d), 9,936 in (b) and (e), and 5,292 in (c) and (f).

Converging forced runs. We have not compared PPPS with forced runs that converge through OSD or decimation. Such a comparison would show what the soft penalty of PPPS adds beyond simply the stage that it saves.

Hardware. We assume that a probe iteration takes as long as a baseline iteration (§ 4.7), which may not hold since the auxiliary check of high degree can lengthen an iteration. The checks of HH connect to at most 242 fault mechanisms, whereas each of the KK parallel probes needs a decoder instance with an auxiliary check that connects to up to 14,264 fault mechanisms for the

Algorithm 1  Parity push post-selection (one shot)
Input: DEM $(H,A,\{p_i\})$, syndrome $\sigma$, push strength $\lambda$
Output: Accept with correction $e^{(0)}$, or Reject
 1: $e^{(0)} \leftarrow \operatorname{Decode}(H,\sigma,\{p_i\})$
 2: if not converged then
 3:   return Reject
 4: end if
 5: $L^{(0)} \leftarrow Ae^{(0)}$
 6: for $j=1,\ldots,K$ (independently) do
 7:   $H' \leftarrow \begin{pmatrix} H & 0 \\ A_j & 1 \end{pmatrix}$, $\sigma' \leftarrow (\sigma,1\oplus L_j^{(0)})$, $p_z \leftarrow 1/(1+e^\lambda)$
 8:   $\hat e^{(j)} \leftarrow \operatorname{Decode}(H',\sigma',\{p_i\}\cup\{p_z\})$ ▷ cold start
 9:   if not converged or $A\hat e^{(j)}\ne L^{(0)}$ then ▷ abstain or flip
10:     return Reject
11:   end if
12: end for
13: return Accept with $e^{(0)}$

[[144, 12, 12]] code. How this check affects the latency of an iteration in hardware remains to be tested.

Extensions. A sliding-window version, with a push per window, would extend PPPS to real-time decoding in the spirit of Ref. [6]. Our simulations cover only memory experiments, and the surgery-based logical measurements of the [[144, 12, 12]] code on which FG has been tested [7, 13] are a natural next test. FG and PPPS can also be combined, since FG rejects failures with a small gap at almost no cost when its forced run converges and PPPS rejects failures on which the forced run does not converge. A hybrid that uses FG when the forced run converges and PPPS when it does not would keep the low-cost regime of FG and the floor-free regime of PPPS.

Methods

Pseudocode of PPPS

Algorithm 1 gives the procedure of Figure 2 for one shot. The probes do not depend on each other, so we set no order for them.

Logical gap and the failure probability

We use the notation of § 2.1 and § 2.2 to derive Eqs. (1) and (6).

Derivation of Eq. (1). We fix the syndrome σ\sigma. The actual fault lies in logical class cc with probability Zc/∑c′Zc′Z_c/\sum_{c'}Z_{c'}, where ZcZ_c is the class mass of § 2.1. A DML decoder returns the class of largest mass, so it fails exactly when the actual fault lies in any other class:

P(fail∣σ)=Z(2)+ZrestZ(1)+Z(2)+Zrest.(7)\mathcal{P}(\mathrm{fail}\mid\sigma)=\frac{Z^{(2)}+Z_{\mathrm{rest}}}{Z^{(1)}+Z^{(2)}+Z_{\mathrm{rest}}}. \tag*{(7)}

Here Z(1)≥Z(2)Z^{(1)}\ge Z^{(2)} are the two largest class masses and ZrestZ_{\mathrm{rest}} is the total mass of the remaining 2K−22^K-2 classes. Dividing the numerator and the denominator by Z(2)Z^{(2)} and writing g=ln⁡(Z(1)/Z(2))g=\ln(Z^{(1)}/Z^{(2)}) and α=Zrest/Z(2)\alpha=Z_{\mathrm{rest}}/Z^{(2)} gives Eq. (1), so the failure probability depends on σ\sigma only through gg and α\alpha. Equation (1) is a statement about each shot, and the LER is its average over the accepted syndromes. For a given shot the failure probability decreases as gg grows. Accepting only shots with g>λg>\lambda therefore bounds the failure probability of each accepted shot by (1+α)/(eλ+1+α)(1+\alpha)/(e^\lambda+1+\alpha), where α\alpha is that of the shot. Every remaining class has mass at most Z(2)Z^{(2)}, so 0≤α≤2K−20\le\alpha\le2^K-2, and the bound is strongest for small α\alpha. When the two largest classes carry almost all of the mass, α→0\alpha\to0 and Eq. (1) reduces to

P(fail∣g,α)=1+αeg+1+α≈1eg+1.(8)\mathcal{P}(\mathrm{fail}\mid g,\alpha)=\frac{1+\alpha}{e^g+1+\alpha}\approx\frac{1}{e^g+1}. \tag*{(8)}

Equation (8) is exact for a code with a single logical observable such as the surface code, which has only two logical classes, and it then coincides with the expression of Ref. [18] for the free-energy difference under maximum-likelihood decoding.

Derivation of (6). We assume that a DML decoder also performs the initial decoding, so that L(0)L^{(0)} is the class of largest mass Z(1)Z^{(1)}. For the probe on observable jj, the slack variable zz has prior probability pz=P(z=1)=1/(1+eλ)p_z=P(z=1)=1/(1+e^\lambda) and P(z=0)=eλ/(1+eλ)P(z=0)=e^\lambda/(1+e^\lambda), and the auxiliary check enforces Aje⊕z=1⊕Lj(0)A_j e \oplus z=1\oplus L_j^{(0)}. The value of zz is therefore fixed by ee as z=1⊕Lj(0)⊕Ajez=1\oplus L_j^{(0)}\oplus A_j e, so that z=1z=1 when Aje=Lj(0)A_j e=L_j^{(0)} and z=0z=0 when Aje≠Lj(0)A_j e\ne L_j^{(0)}. Since the prior factorizes as P′(e,z)=P(e)P(z)P'(e,z)=P(e)P(z), every ee with He=σHe=\sigma has probability P(e)P(z=1)P(e)P(z=1) if Aje=Lj(0)A_j e=L_j^{(0)} and P(e)P(z=0)P(e)P(z=0) otherwise, which is Eq. (3). Every configuration in class cc satisfies Aje=cjA_j e=c_j and receives the same factor, so summing Eq. (3) over each class gives Eq. (4).

The probe on observable jj returns when L(0)L^{(0)} remains the class of largest mass after the push. A competing class with cj=Lj(0)c_j=L_j^{(0)} receives the same factor as L(0)L^{(0)}, so its comparison with L(0)L^{(0)} is unchanged and L(0)L^{(0)} still wins. Only the classes with cj≠Lj(0)c_j\ne L_j^{(0)} can overtake L(0)L^{(0)}, which gives Eq. (5). Suppose first that e−λZ(1)>Z(2)e^{-\lambda}Z^{(1)}>Z^{(2)}. Since Z(2)Z^{(2)} is the largest mass of any class other than L(0)L^{(0)}, every probe jj satisfies

max⁡c:cj≠Lj(0)Zc≤Z(2)<e−λZ(1)(9)\max_{\substack{c: c_j\ne L_j^{(0)}}} Z_c \le Z^{(2)} < e^{-\lambda}Z^{(1)} \tag*{(9)}

and all probes return. Conversely, the class of mass Z(2)Z^{(2)} differs from L(0)L^{(0)} in at least one observable j∗j^* and therefore lies in the opposite logical sector of observable j∗j^*. If that probe returns, Eq. (5) gives e−λZ(1)>Z(2)e^{-\lambda}Z^{(1)}>Z^{(2)}. Taking logarithms, ln⁡Z(1)−λ>ln⁡Z(2)\ln Z^{(1)}-\lambda>\ln Z^{(2)}, that is, g>λg>\lambda, which proves Eq. (6). Under DML decoding a probe either returns or flips; abstention arises only when a practical decoder fails to converge (§ 2.3).

Circuits, noise model and decoders

We use the Stim memory circuits distributed with the Relay-BP implementation of Ref. [24]. These circuits follow the depth-8 syndrome cycle of Ref. [5], with seven layers of CNOTs and one layer of measurement and initialization, and run dd noisy cycles followed by a noiseless readout. Each circuit is a Z-basis memory experiment whose K=12K=12 observables are the logical Z operators. The noise is uniform circuit-level noise of strength pp, with two-qubit depolarizing noise after every CNOT, single-qubit depolarizing noise on idle data qubits, and errors in every preparation and measurement. We extract the DEM with Stim [21].

Table 2 lists the decoder parameters. Relay-BP returns the lowest-weight solution among its converged legs, and we modify its implementation only to exclude the slack variable from the memory strengths (§ 4.4). BP+OSD and plain BP use the ldpc package [26]. A shot counts as non-converged when the decoder returns no solution that satisfies the syndrome, which never happens for BP+OSD.

PPPS implementation

We construct the deformed check matrix Hj′H'_j of Eq. (2) for each observable jj. The auxiliary check carries the syndrome bit 1⊕Lj(0)1\oplus L_j^{(0)} and the slack variable zz carries the prior pz=1/(1+eλ)p_z=1/(1+e^\lambda). In Relay-BP every probe reuses the seed of the baseline run, so all fault mechanisms receive the same sequence of memory strengths γ\gamma as in the baseline. The probes therefore differ from the baseline only by the gadget and the decoder budget, not by new random γ\gamma values. The slack variable carries no memory strength, which keeps the push at exactly λ\lambda on every leg.

Each probe is an independent decoder call determined by (σ,j,λ)(\sigma,j,\lambda) and the seed of the shot. We accept a shot only when all KK probes return. To save computation we stop evaluating a shot once one of its probes flips, since the shot is then rejected regardless of the remaining probes. A rejected shot counts as a flip if any of its probes flips and as an abstention otherwise.

Because the probes reuse the baseline seed, the probe at λ=0\lambda=0 is the baseline decoding with the gadget attached but without a push. At λ=0\lambda=0 the slack variable has prior LLR zero, so the auxiliary check sends no message to the fault mechanisms. The probe nevertheless differs from the baseline in two ways. First, its budget is smaller, so it misses solutions that the baseline finds only in later legs. Second, Relay-BP ends a leg as soon as its hard decision satisfies every check, and the probe has one more check to satisfy. The hard decision on zz follows only the message from the auxiliary check and can disagree with the parity of the fault mechanisms in supp⁡(Aj)\operatorname{supp}(A_j) while the messages are still changing. The probe then runs longer on a leg that the baseline would have ended. Relay-BP carries the state at the end of each leg into the next leg as memory, so all later legs of the probe differ from those of the baseline. The λ=0\lambda= 0 point therefore measures the cost of the smaller budget and of the extra check together.

[[72,12,6]][[72, 12, 6]] p=10−3p = 10^{-3}[[72,12,6]][[72, 12, 6]] p=3×10−3p = 3 \times10^{-3}[[144,12,12]][[144, 12, 12]] p=3×10−3p = 3 \times10^{-3}
Relay-BP
gamma00.10.10.1
pre_iter808080
num_sets300 / 25300 / 25300 / 100
set_max_iter606060
gamma_dist_interval(−0.19,0.26)(-0.19, 0.26)(−0.19,0.26)(-0.19, 0.26)(−0.24,0.66)(-0.24, 0.66)
stop_nconv100100100
BP+OSD
bp_method—min-summin-sum
max_iter—100100
ms_scaling_factor—0.6250.625
osd_method—OSD-CSOSD-CS
osd_order—1010

Table 2. Decoder parameters for each setting. Where two values are given, the first applies to the baseline and the second to the probes, which also serve as the forced runs of FG and the re-decodings of AR. All other parameters are shared. BP+OSD was not run on the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3}, and plain BP uses the BP parameters of BP+OSD without OSD.

BP+OSD and plain BP use the same gadget and the same decision rule. Unlike Relay-BP, these decoders run the probes with exactly the settings of their baseline, so their λ=0\lambda= 0 points isolate the effect of the added check. For plain BP this effect is absent and the λ=0\lambda= 0 point coincides with the baseline. For BP+OSD the added check changes the OSD step, and the λ=0\lambda= 0 point already rejects 9.1% of the failures and 0.04% of the correctly decoded shots of the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3}.

The relaxed rule of § 2.8 is evaluated on the same probe runs. Instead of counting a non-converged probe as an abstention, it reads the class of the hard decision at which the probe stopped.

Forced-gap and argument-reweighting baselines

Forced gap. For each observable jj FG re-decodes under a hard constraint, appending the row AjA_j to HH with the syndrome bit 1⊕Lj(0)1 \oplus L_j^{(0)} and no slack variable [7]. Every converged leg of the baseline run and of the KK forced runs contributes its solution, and we keep the lowest-weight solution found in each logical class, following Eqs. (2)–(4) of Ref. [7]. FG approximates the logical gap by the weight difference between the two lightest of these solutions. FG accepts a shot when its gap exceeds a threshold TT, and we sweep TT to obtain the curve. When the runs find solutions in only one logical class, which requires that none of the forced runs converges, the gap is set to infinity by convention and the shot is accepted. With our decoder budget the forced runs do not converge on 99.6% of the correctly decoded shots of the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3}, on 94.6% at p=3×10−3p = 3 \times10^{-3} and on 98.8% of those of the [[144,12,12]][[144, 12, 12]] code at p=3×10−3p = 3 \times10^{-3}.

Argument reweighting. AR [8] re-decodes the syndrome after raising the prior probability of every mechanism in the baseline solution to the power b=1+zb = 1 + z, which is the ratio-test variant of Ref. [8]. If the second solution lies in L(0)L^{(0)}, AR applies the same reweighting to the mechanisms of the second solution and decodes a third time. A shot is accepted only when all three solutions lie in the same class, which is the three-round logical-error criterion. We sweep z∈{0.001,0.01,0.1,0.3,0.5,1,2,4}z \in\{0.001, 0.01, 0.1, 0.3, 0.5, 1, 2, 4\}, and each value gives one point in Figure 3. A re-decoding that fails to converge counts as a rejection, as an abstention does in PPPS.

DecoderCode, ppNsN_sEEWWSSFailures
Relay-BP[[72,12,6]][[72, 12, 6]], 10−310^{-3}40,000,0005352119,999two-pass
Relay-BP[[72,12,6]][[72, 12, 6]], 3×10−33 \times10^{-3}200,0009363249,936full
Relay-BP[[144,12,12]][[144, 12, 12]], 3×10−33 \times10^{-3}28,200,0003,0853785,292 / 9,890two-pass
BP+OSD[[72,12,6]][[72, 12, 6]], 3×10−33 \times10^{-3}200,00001,0889,942full
BP+OSD[[144,12,12]][[144, 12, 12]], 3×10−33 \times10^{-3}1,060,00004972,063full
Plain BP[[72,12,6]][[72, 12, 6]], 3×10−33 \times10^{-3}200,00080,8411405,981full
Plain BP[[144,12,12]][[144, 12, 12]], 3×10−33 \times10^{-3}1,060,000738,9700—full

Table 3. Numbers of shots for every decoder and setting. NsN_s is the number of simulated shots, EE the number on which the baseline decoder does not converge, WW the number of logical failures among the converged shots and SS the number of sampled correctly decoded shots on which the post-selection methods run. Failures are identified with the two-pass procedure (two-pass) or by running the full baseline on every shot (full). Where two values of SS are given, the first applies to PPPS and the second to FG and AR. Plain BP finds no failure on the [[144,12,12]][[144, 12, 12]] code, so we do not post-select it (§ 2.7).

The forced runs of FG and the re-decodings of AR use the same Relay-BP parameters and seeds as the PPPS probes (Table 2), so the three methods start from the same baseline solution and differ only in how they re-decode. Because they run with our decoder settings and on our failures, their absolute values differ from the original reports, and the comparison is valid only within the same shots and the same decoder.

Sampling and statistics

Failures. Logical failures are rare at our operating points, so we identify them with a two-pass procedure for the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3} and the [[144,12,12]][[144, 12, 12]] code at p=3×10−3p = 3 \times10^{-3}. The first pass decodes every shot with the baseline Relay-BP stopped at its first converged leg. The second pass runs the full baseline only on the shots that the first pass decodes incorrectly, and the failures of the second pass form the set of WW failures. A shot that the first pass decodes correctly but the full baseline would not is missed by this procedure, so WW and the baseline LER are lower bounds. For the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3} we run the full baseline on all NsN_s shots. Comparing it with the first pass on the same shots shows that the first pass misses 74 of the 324 failures in this setting. We run every post-selection method on all identified failures.

Correctly decoded shots. Running the probes on every correctly decoded shot is infeasible, so we run each method on a sample of SS correctly decoded shots. For the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3} we draw 20,000 shots uniformly at random, and for the same code at p=3×10−3p = 3 \times10^{-3} we take every 20th of the 200,000 shots, which gives 10,000; in both cases we then exclude failures and non-converged shots, leaving the SS of Table 3. For the [[144,12,12]][[144, 12, 12]] code we take 10,000 shots at regular intervals from the first 16.15 million shots; none of the 10,000 is a failure or a non-converged shot. FG and AR run on 9,890 of these shots and PPPS on 5,292 of them. Both subsets are fixed by the shot index alone and are therefore not correlated with any decoding outcome; the remaining runs were not completed within our compute budget. BP+OSD and plain BP on the [[72,12,6]][[72, 12, 6]] code use the same 10,000 shots as Relay-BP at p=3×10−3p = 3 \times10^{-3}, and plain BP is read from the BP stage of BP+OSD, so its sample keeps only the shots on which BP converges. For BP+OSD on the [[144,12,12]][[144, 12, 12]] code we sample 2,063 of the 1.06 million shots. Table 3 lists Ns,E,WN_s, E, W and SS for every decoder and setting.

Estimators. Without post-selection only the EE non-converged shots are rejected, so the baseline point has

LER⁡base=WNs−E,reject⁡base=ENs.(10)\operatorname{LER}_{\mathrm{base}} = \frac{W}{N_s-E}, \qquad\operatorname{reject}_{\mathrm{base}} = \frac{E}{N_s}. \tag*{(10)}

At a given λ\lambda let WretW_{\mathrm{ret}} be the number of failures whose probes all return and SretS_{\mathrm{ret}} the number of sampled correctly decoded shots whose probes all return. We write

m=WretW,ρc=SretS(11)m = \frac{W_{\mathrm{ret}}}{W}, \qquad\rho_c = \frac{S_{\mathrm{ret}}}{S} \tag*{(11)}

for the fractions of failures and of correctly decoded shots that are accepted. Scaling ρc\rho_c from the sample to all Ns−W−EN_s-W-E correctly decoded shots gives the LER per shot and the rejection rate,

LERpost=Wm(Ns−W−E)ρc+Wm,rejectpost=(Ns−W−E)(1−ρc)+W(1−m)+ENs.(12)\mathrm{LER}_{\mathrm{post}} = \frac{Wm}{(N_s-W-E)\rho_c+Wm}, \qquad\mathrm{reject}_{\mathrm{post}} = \frac{(N_s-W-E)(1-\rho_c)+W(1-m)+E}{N_s}. \tag*{(12)}

We report the logical error rate per round 1−(1−LERpost)1/d1-(1-\mathrm{LER}_{\mathrm{post}})^{1/d}, where the number of rounds equals the distance dd [5]. The rejection rate rejectpost\mathrm{reject}_{\mathrm{post}} is the fraction of shots that are rejected, and we do not normalize it per round. The same expressions apply to FG and AR with their own acceptance rules.

Confidence intervals. Every identified failure is decoded, so mm carries no sampling error and the statistical uncertainty of the rejection rate comes from ρc\rho_c alone. We compute a 95% Wilson interval [30] for ρc\rho_c and insert its endpoints into Eq. (12). The uncertainty of the logical error rate comes from the small number WretW_{\mathrm{ret}} of accepted failures. We compute a 95% Garwood interval [31] for this Poisson count and apply the per-round conversion to its endpoints, which is valid because the conversion is monotonic. These intervals do not include the failures that the two-pass procedure misses, so the true WW and LERs may be higher than those we report.

Two-factor approximation. Failures are a small fraction of the converged shots in every setting (at most W/Ns=0.54%W/N_s = 0.54\% for BP+OSD on the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3}). We therefore drop WmWm from the denominator of the LER in Eq. (12) and W(1−m)/NsW(1-m)/N_s from the rejection rate, and replace Ns−W−EN_s-W-E by Ns−EN_s-E in both. With Eq. (10) this gives

LERpost≈LERbasemρc,rejectpost≈ENs+(1−ENs)(1−ρc).(13)\mathrm{LER}_{\mathrm{post}} \approx\mathrm{LER}_{\mathrm{base}}\frac{m}{\rho_c}, \qquad\mathrm{reject}_{\mathrm{post}} \approx\frac{E}{N_s}+\left(1-\frac{E}{N_s}\right)(1-\rho_c). \tag*{(13)}

We keep the term E/NsE/N_s because it is not small for plain BP, whose baseline already rejects 40% of the shots. When the probes return on most correctly decoded shots (ρc\rho_c close to 1), Eq. (13) separates the two factors: the LER after post-selection follows mm and the rejection rate follows ρc\rho_c (§ 2.7).

Computational cost

We measure the number of operations (CC) of one decoding by the number of BP iterations (II) times the number of edges (E\mathcal{E}) of its Tanner graph, which equals the number of nonzero entries of HH. For iterative message-passing decoding, the number of iterations and the number of edges per iteration set the decoding complexity [33, 34]. Min-sum BP updates each check and each variable in a time linear in its degree [35], so the remaining constant cancels in the ratio between PPPS and the baseline. For the latency (TT), we follow Ref. [24] and count BP iterations. An FPGA implementation completes each iteration in a fixed number of clock cycles [36, 37], so TT is proportional to II.

The probe on observable jj decodes Hj′H'_j, which has Ej′=E+∣supp⁡(Aj)∣+1\mathcal{E}'_j = \mathcal{E} + |\operatorname{supp}(A_j)| + 1 edges. All probes share one budget IprobeI_{\mathrm{probe}}, so the number of operations CPPPSC_{\mathrm{PPPS}} of PPPS relative to that of the baseline decoding CbaseC_{\mathrm{base}} is given by Eq. (14), where Eˉ′\bar{\mathcal{E}}' is the mean of Ej′\mathcal{E}'_j over the KK observables. The latency of PPPS relative to that of the baseline follows Eq. (15) when the probes run in sequence and Eq. (16) when they run in parallel.

CPPPSCbase=1+KIprobeIbaseEˉ′E,(14)\frac{C_{\mathrm{PPPS}}}{C_{\mathrm{base}}} = 1 + K \frac{I_{\mathrm{probe}}}{I_{\mathrm{base}}} \frac{\bar{\mathcal{E}}'}{\mathcal{E}}, \tag*{(14)}
TseqTbase=1+KIprobeIbase,(15)\frac{T_{\mathrm{seq}}}{T_{\mathrm{base}}} = 1 + K \frac{I_{\mathrm{probe}}}{I_{\mathrm{base}}}, \tag*{(15)}
TparTbase=1+IprobeIbase.(16)\frac{T_{\mathrm{par}}}{T_{\mathrm{base}}} = 1 + \frac{I_{\mathrm{probe}}}{I_{\mathrm{base}}}. \tag*{(16)}

We take each decoding at its iteration budget. A Relay-BP decoding runs at most num_sets + 1 legs: leg 0 is the pre-iteration pass with pre_iter iterations, and legs 1 to num_sets run set_max_iter iterations each. This bound gives 18,080 iterations for the baseline and 1,580 and 6,080 for the probes of the [[72,12,6]][[72, 12, 6]] and [[144,12,12]][[144, 12, 12]] codes. Table 4 lists E\mathcal{E}, Eˉ′/E\bar{\mathcal{E}}'/\mathcal{E} and the resulting ratios.

FG adds the same row without the slack variable and runs its forced runs with the probe budget, so its cost equals that of PPPS. AR leaves the Tanner graph unchanged and re-decodes at most twice [8], which gives 1.17 and 1.67 times the operations of the baseline. Each round of AR reweights the error model by the output of the previous round, so its re-decodings cannot run in parallel and its latency grows by the same factor. Two assumptions enter these numbers. The baseline stops once 100 legs converge, whereas the probes never reach this count and always use their full budget. The bound on IbaseI_{\mathrm{base}} therefore underestimates the ratio, which rises from 5.1 to 7.0 on the [[144,12,12]][[144, 12, 12]] code with the recorded number of baseline legs. The latency also assumes that a probe iteration takes as long as a baseline iteration, although the auxiliary check has a much higher degree than the checks of HH (§ 3).

Data availability

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Code availability

The code used for the simulations in this study is available from the corresponding author upon reasonable request.

Acknowledgements

The authors acknowledge helpful discussions with SangUk Lee and IlKwon Sohn. The authors also acknowledge helpful discussions with Adam Wills related to Ref. [7].

Funding

H.J.K., G.S.M., and J.H. were supported by Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) [No. 2020-0-00014, A Technology Development of Quantum OS for Fault-tolerant Logical Qubit Computing Environment]. S.H.L. was supported by the National Research Foundation of Korea (NRF) grant (RS-2026-25624201, RS-2026-25612364, RS-2026-25476454, RS-2024-00442710) funded by the Ministry of Science and ICT (MSIT) of the Korean government.

Author contributions

H.J.K. conceived the idea and all authors contributed to developing it. H.J.K. conducted the simulations and mainly wrote the manuscript. G.S.M., S.H.L., and J.H. contributed helpful feedback and revisions. All authors reviewed the manuscript.

Competing interests

The authors declare no competing interests.

Supplementary Information for Parity Push Post-Selection with Soft Parity Constraints for Quantum LDPC Codes

Hong Jun Kim; Gun Sik Min; Seok-Hyung Lee; Jun Heo

Origin of the rejections

This note collects the data behind the attributions in § 2.5 and § 2.6 of the main text and behind the interpretation in the Discussion. Supplementary Tables 1 and Supplementary Table 4 give the rejections of every setting by outcome.

λ\lambdaWret/WW_{\mathrm{ret}}/WFailures rejected flip / abstSret/SS_{\mathrm{ret}}/SCorrect rejected flip / abstRejection rate (%) [95% CI]LER per round [95% CI]
BP+OSD, [[72, 12, 6]]
0989/108899 / 09,938/9,9424 / 00.090 [0.065, 0.152]8.27 [7.8, 8.8] ×10−4\times10^{-4}
0.25241/1088847 / 09,872/9,94270 / 01.124 [0.978, 1.307]2.03 [1.8, 2.3] ×10−4\times10^{-4}
0.5193/1088895 / 09,852/9,94290 / 01.348 [1.181, 1.553]1.63 [1.4, 1.9] ×10−4\times10^{-4}
1152/1088936 / 09,829/9,942113 / 01.598 [1.409, 1.825]1.29 [1.1, 1.5] ×10−4\times10^{-4}
299/1088989 / 09,780/9,942162 / 02.115 [1.886, 2.382]8.43 [6.9, 10] ×10−5\times10^{-5}
443/10881,045 / 09,706/9,942236 / 02.883 [2.604, 3.200]3.69 [2.7, 5.0] ×10−5\times10^{-5}
629/10881,059 / 09,573/9,942369 / 04.221 [3.869, 4.609]2.52 [1.7, 3.6] ×10−5\times10^{-5}
815/10881,073 / 09,386/9,942556 / 06.099 [5.666, 6.565]1.33 [0.75, 2.2] ×10−5\times10^{-5}
126/10881,082 / 08,683/9,9421,259 / 013.136 [12.500, 13.800]5.76 [2.1, 13] ×10−6\times10^{-6}
BP+OSD, [[144, 12, 12]]
0478/49719 / 02,063/2,0630 / 00.002 [0.002, 0.188]3.76 [3.4, 4.1] ×10−5\times10^{-5}
0.2516/497481 / 02,058/2,0635 / 00.288 [0.149, 0.611]1.26 [0.72, 2.0] ×10−6\times10^{-6}
0.56/497491 / 02,058/2,0635 / 00.289 [0.150, 0.612]4.73 [1.7, 10] ×10−7\times10^{-7}
15/497492 / 02,059/2,0634 / 00.240 [0.122, 0.544]3.94 [1.3, 9.2] ×10−7\times10^{-7}
25/497492 / 02,055/2,0638 / 00.434 [0.243, 0.809]3.95 [1.3, 9.2] ×10−7\times10^{-7}
41/497496 / 02,054/2,0639 / 00.483 [0.276, 0.873]7.90 [0.20, 44] ×10−8\times10^{-8}
62/497495 / 02,056/2,0637 / 00.386 [0.211, 0.745]1.58 [0.19, 5.7] ×10−7\times10^{-7}
81/497496 / 02,052/2,06311 / 00.580 [0.345, 0.999]7.91 [0.20, 44] ×10−8\times10^{-8}
120/497497 / 02,026/2,06337 / 01.840 [1.350, 2.508]0 [0, 3] ×10−7\times10^{-7}
Plain BP, [[72, 12, 6]]
0140/1400 / 05,981/5,9810 / 040.420 [40.420, 40.459]1.96 [1.6, 2.3] ×10−4\times10^{-4}
0.2552/14061 / 275,278/5,9819 / 69447.459 [46.988, 47.960]8.25 [6.2, 11] ×10−5\times10^{-5}
0.539/14078 / 235,068/5,9816 / 90749.555 [49.026, 50.111]6.44 [4.6, 8.8] ×10−5\times10^{-5}
120/14090 / 304,852/5,98111 / 1,11851.714 [51.136, 52.316]3.45 [2.1, 5.3] ×10−5\times10^{-5}
28/14099 / 333,704/5,98111 / 2,26663.142 [62.415, 63.879]1.81 [0.78, 3.6] ×10−5\times10^{-5}
41/140107 / 322,062/5,98126 / 3,89379.483 [78.761, 80.194]4.06 [0.10, 23] ×10−6\times10^{-6}
61/140107 / 32926/5,98136 / 5,01990.786 [90.227, 91.318]9.04 [0.23, 50] ×10−6\times10^{-6}
80/140104 / 36124/5,98139 / 5,81898.766 [98.532, 98.964]0 [0, 2.5] ×10−4\times10^{-4}
120/140103 / 372/5,98137 / 5,94299.980 [99.927, 99.995]0 [0, 1.5] ×10−2\times10^{-2}

Supplementary Table 4. PPPS with BP+OSD and plain BP at p=3×10−3p = 3 \times10^{-3} (Figure 4). Columns as in Supplementary Table 1; the Relay-BP values are those of Supplementary Table 1.

Flips and abstentions. Failures are rejected mostly by flips, whereas correctly decoded shots are rejected mostly by abstentions. At λ=8\lambda= 8 a flip rejects 93%, 78% and 94% of the failures in the three panels of Figure 3 of the main text, and an abstention rejects 4%, 21% and 5% of them; these shares change little with λ\lambda (Supplementary Table 1, Supplementary Figure 1). At the same λ\lambda, abstentions on correctly decoded shots account for 0.28% of the 0.32% rejection rate of the [[72,12,6]][[72, 12, 6]] code at p=10−3p = 10^{-3}, for 0.89% of the 0.94% of the [[144,12,12]][[144, 12, 12]] code and for 17.5% of the 20.2% of the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3}. Since failures are a small fraction of all shots, the rejection rate is set by the correctly decoded shots. The cost of PPPS therefore comes almost entirely from abstentions on correctly decoded shots.

Supplementary Figure 1. Composition of the rejections of PPPS with Relay-BP for (a) the [[72,12,6]]\left[\left[72,12,6\right]\right] code at p=10−3p = 10^{-3}, (b) the same code at p=3×10−3p = 3 \times10^{-3} and (c) the [[144,12,12]]\left[\left[144,12,12\right]\right] code at p=3×10−3p = 3 \times10^{-3}, the three panels of Figure 3 of the main text. Each panel shows, against the push strength λ\lambda, the fraction of failures that PPPS rejects by a flip and by an abstention (solid lines), and the fraction of sampled correctly decoded shots that it rejects by a flip and by an abstention (dotted lines). Failures are rejected mostly by flips and correctly decoded shots mostly by abstentions (Supplementary Note 1). The underlying counts are listed in Supplementary Table 1.

Convergence within the probe budget. Failures fail to converge within the probe budget far more often than correctly decoded shots, even without a push. At λ=0\lambda= 0 the probes abstain on 2.7%, 30% and 15% of the failures in the three settings, but only on 0.005%, 2.1% and 0.02% of the correctly decoded shots (Supplementary Table 1). Supplementary Figure 2 shows the reason on the [[144,12,12]][[144, 12, 12]] code. The probes run legs 0–100 and the baseline runs legs 0–300 (Table 2 and § 4.7). On 56 of the 378 failures, the baseline decoder converges only after leg 100. The probes abstain on 57 failures at λ=0\lambda= 0, and these include all 56. Abstention without a push therefore marks the failures on which the decoder needs more legs than the probe budget allows. Abstention is most frequent on the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3}, where the decoder needs more iterations to converge (§ 2.5 of the main text). Since the probe budget is 25 relay legs on the [[72,12,6]][[72, 12, 6]] code and 100 on the [[144,12,12]][[144, 12, 12]] code (Table 2 of the main text), the two codes cannot be compared directly.

Supplementary Figure 2. Leg at which the baseline Relay-BP decoder first converges on the [[144,12,12]]\left[\left[144,12,12\right]\right] code at p=3×10−3p = 3 \times10^{-3}, shown as the cumulative fraction of the 378 failures and of the 5,292 sampled correctly decoded shots. Leg 0 is the pre-iteration pass and legs 1–300 are the relay legs (§ 4.7). The dotted vertical line marks leg 100, the last leg of the probe budget; a shot on which the baseline converges only after this leg is likely to abstain in a probe.

Failures without a converged forced run. PPPS rejects most of the failures that FG accepts at its floor. They lie among the failures on which none of the KK forced runs of FG converges. FG accepts 18 of these 21 failures, 54 of 76 and 16 of 22 with an infinite gap [7], and finds a finite gap for the rest only from the solutions of the baseline run. At λ=8\lambda= 8 PPPS rejects 15 of these 21 failures, 71 of 76 and 21 of 22 in the three settings (Supplementary Table 6). PPPS therefore falls below the FG floor. Failures without a converged forced run are 23% of all failures on the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3}, against 4% at p=10−3p = 10^{-3}, so at the higher physical error rate PPPS falls below the floor with a smaller push.

Dependence on the decoder. At a given λ\lambda the fraction of failures that return is small for every decoder, whereas the fraction of correctly decoded shots that return depends strongly on the decoder. At λ=4\lambda= 4 on the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3}, 7%, 4% and 1% of the failures return for Relay-BP, BP+OSD and plain BP, while 90%, 98% and 34% of the correctly decoded shots return (Supplementary Tables 1 and Supplementary Table 4). BP+OSD never abstains, and plain BP rejects almost every correctly decoded shot by an abstention. The first fraction sets the LER post-selection and the second sets the rejection rate [Eq. (13)] of the main text, so the order of the three decoders in Figure 4 of the main text follows the fraction of correctly decoded shots that return. BP+OSD does not abstain because OSD always returns a solution, so every rejection by BP+OSD is a flip.

Failures missed by the two-pass procedure

The two-pass procedure identifies failures in two steps. The first pass decodes every shot with the baseline decoder stopped at its first converged leg, and the second pass runs the full baseline only on the shots that the first pass decodes incorrectly (§ 4.6 of the main text). A shot that the first pass decodes correctly but the full baseline decodes incorrectly is therefore never checked, and the procedure misses this failure. For the [[72,12,6]]\left[\left[72, 12, 6\right]\right] code at p=3×10−3p = 3 \times10^{-3} we run the full baseline on every shot, which shows that the first pass misses 74 of the 324 failures. Running PPPS on all of them shows that the missed failures are rejected more often than the other 250. Supplementary Table 7 lists both groups at every λ\lambda. At λ=2\lambda= 2 PPPS rejects 96% of the missed failures against 86% of the others, and at λ=8\lambda= 8 it rejects all of them against 98% of the others. FG also rejects all 74 missed failures at its floor, against 196 of the other 250.

λ\lambdaMissed failures rejected (of 74)flip / abstOther failures rejected (of 250)flip / abst
Relay-BP, [[72,12,6]][[72, 12, 6]], p=3×10−3p = 3 \times10^{-3}
049/74 (66.2%)37 / 12100/250 (40.0%)15 / 85
167/74 (90.5%)65 / 2191/250 (76.4%)125 / 66
271/74 (95.9%)69 / 2215/250 (86.0%)144 / 71
371/74 (95.9%)67 / 4220/250 (88.0%)153 / 67
473/74 (98.6%)71 / 2229/250 (91.6%)165 / 64
674/74 (100.0%)72 / 2240/250 (96.0%)171 / 69
874/74 (100.0%)72 / 2244/250 (97.6%)179 / 65
1274/74 (100.0%)69 / 5247/250 (98.8%)179 / 68
1674/74 (100.0%)71 / 3248/250 (99.2%)183 / 65
FG floor74/74 (100.0%)–196/250 (78.4%)–

Supplementary Table 7. Data for Supplementary Note 2. Failures of the [[72,12,6]][[72, 12, 6]] code at p=3×10−3p = 3 \times10^{-3} split into the 74 that the first pass of the two-pass procedure misses and the other 250, with the number that PPPS rejects at each λ\lambda and at the FG floor.

We use the two-pass procedure for the [[72,12,6]]\left[\left[72, 12, 6\right]\right] code at p=10−3p = 10^{-3} and the [[144,12,12]]\left[\left[144, 12, 12\right]\right] code at p=3×10−3p = 3 \times10^{-3}, so these settings likely contain failures that the procedure misses. The true numbers of failures are then larger than those we identify, and we regard the baseline LERs and the LERs after post-selection of these settings as lower bounds. Supplementary Table 7 shows that PPPS rejects the missed failures of the [[72,12,6]]\left[\left[72, 12, 6\right]\right] code at p=3×10−3p = 3 \times10^{-3} more often than the other failures. We therefore expect PPPS to reject most of the missed failures in the other two settings as well. Running the full baseline on every shot of these settings, to see how PPPS rejects all of their failures, remains for future work.

Supplementary Figures

Supplementary Tables

Supplementary Table 1: PPPS with Relay-BP (Figure 3). For each push strength λ\lambda: failures whose probes all return (Wret/WW_{\mathrm{ret}}/W) and failures rejected by a flip or an abstention; sampled correctly decoded shots whose probes all return (Sret/SS_{\mathrm{ret}}/S) and those rejected by a flip or an abstention; the rejection rate per shot and the logical error rate per round with 95% confidence intervals (Methods).

λ\lambdaWret/WW_{\mathrm{ret}}/WFailures rejected flip / abstSret/SS_{\mathrm{ret}}/SCorrect rejected flip / abstRejection rate (%) [95% CI]LER per round [95% CI]
[[72, 12, 6]], p=10−3p = 10^{-3}
0481/52126 / 1419,998/19,9990 / 10.005 [0.001, 0.029]2.00 [1.8, 2.2] ×10−6\times10^{-6}
2122/521378 / 2119,992/19,9991 / 60.036 [0.018, 0.073]5.09 [4.2, 6.1] ×10−7\times10^{-7}
461/521445 / 1519,988/19,9991 / 100.056 [0.032, 0.100]2.54 [1.9, 3.3] ×10−7\times10^{-7}
632/521473 / 1619,973/19,9992 / 240.131 [0.090, 0.192]1.34 [0.91, 1.9] ×10−7\times10^{-7}
819/521483 / 1919,936/19,9998 / 550.316 [0.248, 0.404]7.94 [4.8, 12] ×10−8\times10^{-8}
1018/521485 / 1819,861/19,99914 / 1240.691 [0.586, 0.816]7.55 [4.5, 12] ×10−8\times10^{-8}
1210/521494 / 1719,761/19,99920 / 2181.191 [1.050, 1.351]4.22 [2.0, 7.8] ×10−8\times10^{-8}
166/521497 / 1819,175/19,99938 / 7864.122 [3.855, 4.406]2.61 [0.96, 5.7] ×10−8\times10^{-8}
[[72, 12, 6]], p=3×10−3p = 3 \times10^{-3}
0175/32452 / 979,713/9,93615 / 2082.773 [2.501, 3.081]1.50 [1.3, 1.7] ×10−4\times10^{-4}
166/324190 / 689,261/9,93655 / 6207.348 [6.872, 7.856]5.94 [4.6, 7.6] ×10−5\times10^{-5}
238/324213 / 739,195/9,93666 / 6758.022 [7.525, 8.552]3.44 [2.4, 4.7] ×10−5\times10^{-5}
333/324220 / 719,087/9,93682 / 7679.104 [8.574, 9.667]3.03 [2.1, 4.2] ×10−5\times10^{-5}
422/324236 / 668,927/9,936105 / 90410.710 [10.135, 11.316]2.05 [1.3, 3.1] ×10−5\times10^{-5}
610/324243 / 718,496/9,936156 / 1,28415.026 [14.352, 15.728]9.81 [4.7, 18] ×10−6\times10^{-6}
86/324251 / 677,982/9,936213 / 1,74120.169 [19.404, 20.957]6.26 [2.3, 14] ×10−6\times10^{-6}
123/324248 / 736,448/9,936340 / 3,14835.512 [34.585, 36.450]3.88 [0.80, 11] ×10−6\times10^{-6}
162/324254 / 684,377/9,936433 / 5,12656.225 [55.252, 57.192]3.81 [0.46, 14] ×10−6\times10^{-6}
[[144, 12, 12]], p=3×10−3p = 3 \times10^{-3}
0231/37890 / 575,290/5,2921 / 10.049 [0.022, 0.149]6.83 [6.0, 7.8] ×10−7\times10^{-7}
118/378348 / 125,285/5,2921 / 60.144 [0.076, 0.285]5.33 [3.2, 8.4] ×10−8\times10^{-8}
220/378345 / 135,279/5,2922 / 110.258 [0.156, 0.432]5.93 [3.6, 9.2] ×10−8\times10^{-8}
410/378351 / 175,281/5,2921 / 100.220 [0.128, 0.384]2.96 [1.4, 5.4] ×10−8\times10^{-8}
85/378354 / 195,243/5,2922 / 470.938 [0.713, 1.234]1.49 [0.48, 3.5] ×10−8\times10^{-8}
162/378355 / 214,814/5,29211 / 4679.044 [8.301, 9.846]6.50 [0.79, 23] ×10−9\times10^{-9}

Table 1. PPPS with Relay-BP (Figure 3). For each push strength λ\lambda: failures whose probes all return (Wret/WW_{\mathrm{ret}}/W) and failures rejected by a flip or an abstention; sampled correctly decoded shots whose probes all return (Sret/SS_{\mathrm{ret}}/S) and those rejected by a flip or an abstention; the rejection rate per shot and the logical error rate per round with 95% confidence intervals (Methods).

TTCorrect shots rejected/SSFailures rejected/WWRejection rate (%) [95% CI]LER per round [95% CI]
[[72,12,6]], p=10−3[[72, 12, 6]],\ p = 10^{-3}
0.50/19,999290/5210.001 [0.001, 0.020]9.63 [8.4, 11] ×10−7\times10^{-7}
10/19,999327/5210.001 [0.001, 0.020]8.08 [7.0, 9.3] ×10−7\times10^{-7}
20/19,999373/5210.001 [0.001, 0.020]6.17 [5.2, 7.2] ×10−7\times10^{-7}
30/19,999404/5210.001 [0.001, 0.020]4.88 [4.0, 5.8] ×10−7\times10^{-7}
40/19,999438/5210.001 [0.001, 0.020]3.46 [2.8, 4.3] ×10−7\times10^{-7}
61/19,999477/5210.006 [0.002, 0.030]1.83 [1.3, 2.5] ×10−7\times10^{-7}
89/19,999486/5210.046 [0.025, 0.087]1.46 [1.0, 2.0] ×10−7\times10^{-7}
1017/19,999496/5210.086 [0.054, 0.137]1.04 [0.67, 1.5] ×10−7\times10^{-7}
1223/19,999499/5210.116 [0.078, 0.174]9.18 [5.8, 14] ×10−8\times10^{-8}
1639/19,999502/5210.196 [0.144, 0.268]7.93 [4.8, 12] ×10−8\times10^{-8}
2475/19,999502/5210.376 [0.301, 0.471]7.95 [4.8, 12] ×10−8\times10^{-8}
∞\infty92/19,999503/5210.461 [0.377, 0.565]7.53 [4.5, 12] ×10−8\times10^{-8}
[[72,12,6]], p=3×10−3[[72, 12, 6]],\ p = 3 \times10^{-3}
0.55/9,93670/3240.553 [0.524, 0.620]2.13 [1.9, 2.4] ×10−4\times10^{-4}
17/9,936112/3240.594 [0.558, 0.668]1.78 [1.5, 2.0] ×10−4\times10^{-4}
216/9,936155/3240.706 [0.644, 0.805]1.42 [1.2, 1.6] ×10−4\times10^{-4}
322/9,936185/3240.781 [0.706, 0.893]1.17 [0.98, 1.4] ×10−4\times10^{-4}
445/9,936203/3241.020 [0.906, 1.171]1.02 [0.85, 1.2] ×10−4\times10^{-4}
697/9,936232/3241.554 [1.380, 1.766]7.79 [6.3, 9.6] ×10−5\times10^{-5}
8171/9,936244/3242.300 [2.064, 2.573]6.82 [5.4, 8.5] ×10−5\times10^{-5}
10257/9,936251/3243.164 [2.871, 3.493]6.28 [4.9, 7.9] ×10−5\times10^{-5}
12319/9,936258/3243.787 [3.460, 4.150]5.72 [4.4, 7.3] ×10−5\times10^{-5}
16458/9,936261/3245.179 [4.786, 5.606]5.54 [4.3, 7.1] ×10−5\times10^{-5}
24600/9,936266/3246.602 [6.153, 7.084]5.18 [3.9, 6.7] ×10−5\times10^{-5}
∞\infty633/9,936270/3246.934 [6.473, 7.428]4.84 [3.6, 6.3] ×10−5\times10^{-5}
[[144,12,12]], p=3×10−3[[144, 12, 12]],\ p = 3 \times10^{-3}
0.50/9,89011/3780.011 [0.011, 0.050]1.08 [0.98, 1.2] ×10−6\times10^{-6}
10/9,89019/3780.011 [0.011, 0.050]1.06 [0.95, 1.2] ×10−6\times10^{-6}
20/9,89036/3780.011 [0.011, 0.050]1.01 [0.91, 1.1] ×10−6\times10^{-6}
30/9,89047/3780.011 [0.011, 0.050]9.78 [8.8, 11] ×10−7\times10^{-7}
40/9,89060/3780.011 [0.011, 0.050]9.40 [8.4, 10] ×10−7\times10^{-7}
61/9,890100/3780.021 [0.013, 0.069]8.22 [7.3, 9.2] ×10−7\times10^{-7}
81/9,890125/3780.021 [0.013, 0.069]7.48 [6.6, 8.5] ×10−7\times10^{-7}
102/9,890158/3780.032 [0.017, 0.085]6.50 [5.7, 7.4] ×10−7\times10^{-7}
122/9,890187/3780.032 [0.017, 0.085]5.65 [4.9, 6.5] ×10−7\times10^{-7}
164/9,890227/3780.052 [0.027, 0.116]4.46 [3.8, 5.2] ×10−7\times10^{-7}
2410/9,890288/3780.113 [0.067, 0.198]2.66 [2.1, 3.3] ×10−7\times10^{-7}
∞\infty136/9,890362/3781.387 [1.176, 1.636]4.79 [2.7, 7.8] ×10−8\times10^{-8}

Table 2 (PDF p. 24). FG with Relay-BP (Figure 3). For each gap threshold TT (nats): sampled correctly decoded shots and failures whose gap is below TT and which FG therefore rejects, the rejection rate per shot and the logical error rate per round with 95% confidence intervals. A shot whose baseline run and forced runs find no solution of another class has an infinite gap and is always accepted; T=∞T = \infty rejects every shot with a finite gap and gives the floor of the FG curve.

zzCorrect shots rejected/SSof which n.c.Failures rejected/WWof which n.c.Rejection rate (%) [95% CI]LER per round [95% CI]
[[72,12,6]], p=10−3[[72, 12, 6]],\ p = 10^{-3}
0.0010/19,9990281/521180.001 [0.001, 0.020]1.00 [0.88, 1.1] ×10−6\times10^{-6}
0.013/19,9993315/521220.016 [0.006, 0.045]8.58 [7.5, 9.8] ×10−7\times10^{-7}
0.137/19,99935470/521440.186 [0.136, 0.256]2.13 [1.6, 2.8] ×10−7\times10^{-7}
0.3987/19,999947518/521744.937 [4.645, 5.246]1.31 [0.27, 3.8] ×10−8\times10^{-8}
0.53,590/19,9993,529519/5218817.952 [17.426, 18.490]1.02 [0.12, 3.7] ×10−8\times10^{-8}
1.07,878/19,9997,804520/52115539.393 [38.718, 40.072]6.87 [0.17, 38] ×10−9\times10^{-9}
2.09,107/19,9999,037520/52122545.538 [44.849, 46.229]7.65 [0.19, 43] ×10−9\times10^{-9}
4.010,673/19,99910,605520/52125753.368 [52.676, 54.059]8.94 [0.23, 50] ×10−9\times10^{-9}
[[72,12,6]], p=3×10−3[[72, 12, 6]],\ p = 3 \times10^{-3}
0.001348/9,936323194/3241094.045 [3.704, 4.423]1.13 [0.94, 1.3] ×10−4\times10^{-4}
0.01406/9,936382215/3241114.636 [4.266, 5.041]9.53 [7.8, 11] ×10−5\times10^{-5}
0.12,082/9,9362,009307/32418721.444 [20.660, 22.250]1.80 [1.1, 2.9] ×10−5\times10^{-5}
0.36,795/9,9366,639324/32423468.587 [67.671, 69.488]0 [0, 9.8] ×10−6\times10^{-6}
0.58,804/9,9368,660324/32426388.679 [88.043, 89.285]0 [0, 2.7] ×10−5\times10^{-5}
1.09,601/9,9369,516324/32429396.650 [96.279, 96.985]0 [0, 9.2] ×10−5\times10^{-5}
2.09,706/9,9369,654324/32431197.700 [97.387, 97.976]0 [0, 1.3] ×10−4\times10^{-4}
4.09,763/9,9369,717324/32431198.270 [97.995, 98.507]0 [0, 1.8] ×10−4\times10^{-4}
[[144,12,12]], p=3×10−3[[144, 12, 12]],\ p = 3 \times10^{-3}
0.0016/9,8906292/378670.073 [0.040, 0.144]2.54 [2.0, 3.1] ×10−7\times10^{-7}
0.019/9,8909306/378820.103 [0.060, 0.185]2.13 [1.7, 2.7] ×10−7\times10^{-7}
0.1119/9,890113354/3781061.215 [1.019, 1.450]7.18 [4.6, 11] ×10−8\times10^{-8}
0.32,564/9,8902,547378/37817125.934 [25.080, 26.807]0 [0, 1.5] ×10−8\times10^{-8}
0.56,306/9,8906,282378/37822063.766 [62.813, 64.708]0 [0, 3] ×10−8\times10^{-8}
1.09,043/9,8909,032378/37831391.437 [90.869, 91.972]0 [0, 1.3] ×10−7\times10^{-7}
2.09,662/9,8909,656378/37836097.695 [97.380, 97.973]0 [0, 4.7] ×10−7\times10^{-7}
4.09,800/9,8909,794378/37836499.090 [98.883, 99.259]0 [0, 1.2] ×10−6\times10^{-6}

Table 3. Supplementary Table 3: AR with Relay-BP (Figure 3). For each reweighting strength zz (b=1+zb = 1 + z): sampled correctly decoded shots and failures that AR rejects, the number of them rejected because a re-decoding did not converge (n.c.), the rejection rate per shot and the logical error rate per round with 95% confidence intervals.

Supplementary Table 5: PPPS with the relaxed rejection rule (Figure 5). A probe that does not converge counts as a return when the class of its hard decision is L(0)L^{(0)}; otherwise the shot is rejected, and these rejections are listed as n.c. (not converged, hard decision outside L(0)L^{(0)}). The other columns are as in Supplementary Table 1, which lists the strict-rule values.

λ\lambdaWret/WW_{\mathrm{ret}}/WFailures rejected flip / n.c.Sret/SS_{\mathrm{ret}}/SCorrect rejected flip / n.c.Rejection rate (%) [95% CI]LER per round [95% CI]
[[72,12,6]][[72,12,6]], p=10−3p=10^{-3}
0483/52126 / 1219,998/19,9990 / 10.005 [0.001, 0.029]2.01 [1.8, 2.2] ×10−6\times10^{-6}
2122/521378 / 2119,998/19,9991 / 00.006 [0.002, 0.029]5.08 [4.2, 6.1] ×10−7\times10^{-7}
461/521445 / 1519,992/19,9991 / 60.036 [0.018, 0.074]2.54 [1.9, 3.3] ×10−7\times10^{-7}
633/521473 / 1519,984/19,9992 / 130.076 [0.047, 0.125]1.38 [0.95, 1.9] ×10−7\times10^{-7}
819/521483 / 1919,958/19,9998 / 330.206 [0.153, 0.279]7.93 [4.8, 12] ×10−8\times10^{-8}
1018/521485 / 1819,911/19,99914 / 740.441 [0.359, 0.543]7.53 [4.5, 12] ×10−8\times10^{-8}
1212/521494 / 1519,855/19,99920 / 1240.721 [0.613, 0.848]5.04 [2.6, 8.8] ×10−8\times10^{-8}
166/521497 / 1819,514/19,99938 / 4472.427 [2.222, 2.649]2.56 [0.94, 5.6] ×10−8\times10^{-8}
[[72,12,6]][[72,12,6]], p=3×10−3p=3\times10^{-3}
0184/32452 / 889,812/9,93615 / 1091.778 [1.579, 2.015]1.56 [1.3, 1.8] ×10−4\times10^{-4}
167/324190 / 679,455/9,93655 / 4265.407 [5.005, 5.844]5.90 [4.6, 7.5] ×10−5\times10^{-5}
241/324213 / 709,365/9,93666 / 5056.320 [5.882, 6.792]3.65 [2.6, 4.9] ×10−5\times10^{-5}
336/324220 / 689,268/9,93682 / 5867.293 [6.820, 7.799]3.24 [2.3, 4.5] ×10−5\times10^{-5}
423/324236 / 659,138/9,936105 / 6938.599 [8.084, 9.147]2.10 [1.3, 3.1] ×10−5\times10^{-5}
613/324243 / 688,764/9,936156 / 1,01612.345 [11.729, 12.990]1.24 [0.66, 2.1] ×10−5\times10^{-5}
86/324251 / 678,294/9,936213 / 1,42917.049 [16.336, 17.787]6.03 [2.2, 13] ×10−6\times10^{-6}
123/324248 / 737,128/9,936340 / 2,46828.711 [27.840, 29.599]3.51 [0.72, 10] ×10−6\times10^{-6}
162/324254 / 685,367/9,936433 / 4,13646.324 [45.352, 47.299]3.11 [0.38, 11] ×10−6\times10^{-6}
[[144,12,12]][[144,12,12]], p=3×10−3p=3\times10^{-3}
0231/37890 / 575,290/5,2921 / 10.049 [0.022, 0.149]6.83 [6.0, 7.8] ×10−7\times10^{-7}
118/378348 / 125,286/5,2921 / 50.126 [0.064, 0.259]5.33 [3.2, 8.4] ×10−8\times10^{-8}
220/378345 / 135,281/5,2922 / 90.220 [0.128, 0.384]5.92 [3.6, 9.1] ×10−8\times10^{-8}
410/378351 / 175,284/5,2921 / 70.163 [0.089, 0.310]2.96 [1.4, 5.4] ×10−8\times10^{-8}
85/378354 / 195,255/5,2922 / 350.711 [0.520, 0.974]1.49 [0.48, 3.5] ×10−8\times10^{-8}
162/378355 / 214,910/5,29211 / 3717.230 [6.563, 7.958]6.37 [0.77, 23] ×10−9\times10^{-9}

Table 5.

Supplementary Table 6: PPPS on the failures on which none of the KK forced runs of FG converges (Supplementary Note 1). FG accepts 18, 54 and 16 of them with an infinite gap. For each λ\lambda the number of these failures that PPPS rejects, with the number rejected by a flip and by an abstention in parentheses. A dash marks a value of λ\lambda that was not run for that setting.

λ\lambda[[72,12,6]][[72,12,6]], p=10−3p=10^{-3} (of 21)[[72,12,6]][[72,12,6]], p=3×10−3p=3\times10^{-3} (of 76)[[144,12,12]][[144,12,12]], p=3×10−3p=3\times10^{-3} (of 22)
Relay-BP, failures rejected (flip / abst)
05 (0 / 5)43 (1 / 42)7 (1 / 6)
1–62 (18 / 44)19 (14 / 5)
211 (1 / 10)65 (17 / 48)19 (12 / 7)
3–67 (21 / 46)–
413 (4 / 9)69 (22 / 47)22 (13 / 9)
612 (2 / 10)69 (17 / 52)–
815 (4 / 11)71 (19 / 52)21 (14 / 7)
1015 (2 / 13)––
1217 (4 / 13)73 (11 / 62)–
1619 (5 / 14)74 (12 / 62)21 (11 / 10)

Table 6.

References

  1. [1]Panos Aliferis, Daniel Gottesman, and John Preskill. “Accuracy threshold for postselected quantum computation”. Quantum Information and Computation 8, 181–244 (2008). arXiv:quant-ph/0703264.arxiv.org/abs/quant-ph/0703264
  2. [2]Emanuel Knill. “Quantum computing with realistically noisy devices”. Nature 434, 39–44 (2005).pubmed.ncbi.nlm.nih.gov/15744292
  3. [3]Lucas H. English, Dominic J. Williamson, and Stephen D. Bartlett. “Thresholds for postselected quantum error correction from statistical mechanics”. Physical Review Letters 135, 120603 (2025).DOI
  4. [4]Nikolas P. Breuckmann and Jens Niklas Eberhardt. “Quantum low-density parity-check codes”. PRX Quantum 2, 040101 (2021).DOI
  5. [5]Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder. “High-threshold and low-overhead fault-tolerant quantum memory”. Nature 627, 778–782 (2024).
  6. [6]Seok-Hyung Lee, Lucas H. English, and Stephen D. Bartlett. “Efficient post-selection for general quantum LDPC codes”. npj Quantum Information 12, 96 (2026).DOI
  7. [7]Adam Wills, Theodore J. Yoder, and Isaac Chuang. “Forced gap post-selection for quantum LDPC codes and their operations” (2026). arXiv:2605.20346.arxiv.org/abs/2605.20346
  8. [8]Haipeng Xie, Nobuyuki Yoshioka, Kento Tsubouchi, and Ying Li. “Simple, efficient, and generic post-selection decoding for qLDPC codes”. Physical Review Letters 137, 110601 (2026).DOI
  9. [9]J. Wilson Staples, Winston Fu, and Jeff D. Thompson. “Scalable postselection of quantum resources” (2026). arXiv:2603.08697.arxiv.org/abs/2603.08697
  10. [10]Héctor Bombín, Mihir Pant, Sam Roberts, and Karthik I. Sahay. “Fault-tolerant postselection for low-overhead magic state preparation”. PRX Quantum 5, 010302 (2024).DOI
  11. [11]Sergey Bravyi and Alexei Kitaev. “Universal quantum computation with ideal Clifford gates and noisy ancillas”. Physical Review A 71, 022316 (2005).DOI
  12. [12]Yutaro Akahoshi, Riki Toshio, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, and Keisuke Fujii. “Runtime reduction in lattice surgery utilizing timelike soft information”. Physical Review Research 8, 033085 (2026).DOI
  13. [13]Theodore J. Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay M. Gambetta, Andrew W. Cross, Malcolm Carroll, and Michael E. Beverland. “Tour de gross: A modular quantum computer based on bivariate bicycle codes” (2025). arXiv:2506.03094.arxiv.org/abs/2506.03094
  14. [14]Adrian Hutter, James R. Wootton, and Daniel Loss. “Efficient Markov chain Monte Carlo algorithm for the surface code”. Physical Review A 89, 022326 (2014).DOI
  15. [15]Craig Gidney, Michael Newman, Peter Brooks, and Cody Jones. “Yoked surface codes”. Nature Communications 16, 4498 (2025). arXiv:2312.04522.arxiv.org/abs/2312.04522
  16. [16]Nadine Meister, Christopher A. Pattison, and John Preskill. “Efficient soft-output decoders for the surface code” (2024). arXiv:2405.07433.arxiv.org/abs/2405.07433
  17. [17]Samuel C. Smith, Benjamin J. Brown, and Stephen D. Bartlett. “Mitigating errors in logical qubits”. Communications Physics 7, 386 (2024).DOI
  18. [18]Hongkun Chen, Daohong Xu, Grace M. Sommers, David A. Huse, Jeff D. Thompson, and Sarang Gopalakrishnan. “Scalable accuracy gains from postselection in quantum error correcting codes” (2025). arXiv:2510.05222.arxiv.org/abs/2510.05222
  19. [19]Nicolas Delfosse and Naomi H. Nickerson. “Almost-linear time decoding algorithm for topological codes”. Quantum 5, 595 (2021).DOI
  20. [20]Timo Hillmann, Lucas Berent, Armanda O. Quintavalle, Jens Eisert, Robert Wille, and Joschka Roffe. “Localized statistics decoding for quantum low-density parity-check codes”. Nature Communications 16, 8214 (2025).DOI
  21. [21]Craig Gidney. “Stim: a fast stabilizer circuit simulator”. Quantum 5, 497 (2021).DOI
  22. [22]Pavithran Iyer and David Poulin. “Hardness of decoding quantum stabilizer codes”. IEEE Transactions on Information Theory 61, 5209–5223 (2015).arxiv.org/abs/1310.3235
  23. [23]Alexey A. Kovalev and Leonid P. Pryadko. “Quantum Kronecker sum-product low-density parity-check codes with finite rate”. Physical Review A 88, 012311 (2013).DOI
  24. [24]Tristan Müller, Thomas Alexander, Michael E. Beverland, Markus Bühler, Blake R. Johnson, Thilo Maurer, and Drew Vandeth. “Improved belief propagation is sufficient for real-time decoding of quantum memory” (2025). arXiv:2506.01779.
  25. [25]Pavel Panteleev and Gleb Kalachev. “Degenerate quantum LDPC codes with good finite length performance”. Quantum 5, 585 (2021).DOI
  26. [26]Joschka Roffe, David R. White, Simon Burton, and Earl T. Campbell. “Decoding across the quantum low-density parity-check code landscape”. Physical Review Research 2, 043423 (2020).DOI
  27. [27]Patricio Fuentes, Josu Etxezarreta Martinez, Pedro M. Crespo, and Javier Garcia-Frías. “Degeneracy and its impact on the decoding of sparse quantum codes”. IEEE Access 9, 89093–89119 (2021).DOI
  28. [28]David Poulin and Yeojin Chung. “On the iterative decoding of sparse quantum codes”. Quantum Information and Computation 8, 987–1000 (2008). arXiv:0801.1241.arxiv.org/abs/0801.1241
  29. [29]Nithin Raveendran and Bane Vasić. “Trapping sets of quantum LDPC codes”. Quantum 5, 562 (2021).DOI
  30. [30]Edwin B. Wilson. “Probable inference, the law of succession, and statistical inference”. Journal of the American Statistical Association 22, 209–212 (1927).DOI
  31. [31]Frank Garwood. “Fiducial limits for the Poisson distribution”. Biometrika 28, 437–442 (1936).DOI
  32. [32]Hanwen Yao, Waleed Abu Laban, Christian Häger, Alexandre Graell i Amat, and Henry D. Pfister. “Belief propagation decoding of quantum LDPC codes with guided decimation”. In Proc. IEEE Int. Symp. Inf. Theory (ISIT). Pages 2478–2483. (2024). arXiv:2312.10950.arxiv.org/abs/2312.10950
  33. [33]Igal Sason and Rüdiger Urbanke. “Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel”. IEEE Transactions on Information Theory 50, 1247–1256 (2004).DOI
  34. [34]Igal Sason and Gil Wiechman. “Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel”. IEEE Transactions on Information Theory 55, 2602–2617 (2009).
  35. [35]Jinghu Chen, Ajay Dholakia, Evangelos Eleftheriou, Marc P. C. Fossorier, and Xiao-Yu Hu. “Reduced-complexity decoding of LDPC codes”. IEEE Transactions on Communications 53, 1288–1299 (2005).DOI
  36. [36]Thilo Maurer, Markus Bühler, Michael Kröner, Frank Haverkamp, Tristan Müller, Drew Vandeth, and Blake R. Johnson. “Real-time decoding of the gross code memory with FP-GAs” (2025). arXiv:2510.21600.arxiv.org/abs/2510.21600
  37. [37]Satvik Maurya, Thilo Maurer, Markus Bühler, Drew Vandeth, and Michael E. Beverland. “FPGA-tailored algorithms for real-time decoding of quantum LDPC codes” (2025). arXiv:2511.21660.arxiv.org/abs/2511.21660

Paper details

vlnc:W_r8p2dwg7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents