Recognition: unknown
Analytical Theory of Greedy Peeling for Bivariate Bicycle Codes and Two-Shot Streaming Decoding
Pith reviewed 2026-05-10 15:07 UTC · model grok-4.3
The pith
A parameter-free collision resolution factor A_0 derived from XOR syndrome analysis quantifies the fraction of detector-sharing fault pairs that block iterative peeling in bivariate bicycle codes.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper establishes that the collision resolution factor A_0 equals the ratio of true collisions to birthday collisions and can be computed in closed form from XOR syndrome analysis. For the [[144,12,12]] Gross code this yields A_0 = 0.8685, within 0.5 percent of the measured value, with all shared-2 pairs resolving under peeling. The resulting success probability is given by P_peel = exp(-A_0 * gamma_analytic * exp(-BTp) * n * p^2), which holds across five BB codes, four noise levels, and four values of T with R-squared of 0.86. The theory also gives a syndrome stopping distance d_S = n/4.5 for the Gross family and shows that the [[32,8,6]] code enables two-shot streaming with T = 2 at an
What carries the argument
The collision resolution factor A_0, defined as the ratio of true collisions to birthday collisions extracted from XOR syndrome analysis, which directly scales the expected number of blocking fault pairs in the peeling process.
If this is right
- The deferred greedy decoder achieves a 330x latency reduction over belief propagation at physical error rate 10^{-3} while preserving the same logical error rate.
- A_0 equals 0.87 when the mean fault-graph degree is 52 and 0.76 when the mean degree is 17, showing that the factor is governed by average degree rather than total size.
- For the [[32,8,6]] code, two rounds of streaming decoding reach 89 percent peeling success with a logical-error-rate ratio of 1.29 relative to twelve rounds.
- The syndrome stopping distance is n/4.5 for the entire Gross family of codes.
Where Pith is reading between the lines
- Because A_0 depends only on mean degree, code designers could tune detector connectivity to raise A_0 and thereby improve peeling efficiency without enlarging the code.
- The two-shot streaming result suggests that low-latency real-time correction on hardware may be feasible for any bivariate bicycle code whose stopping distance is small enough for T=2 to suffice.
- If the formula continues to hold at lower physical error rates, the analytic P_peel expression could replace Monte-Carlo sampling when estimating decoder performance in the regime relevant to fault-tolerant thresholds.
Load-bearing premise
The XOR syndrome analysis fully captures the dynamics of fault pairs under circuit-level noise without higher-order effects or code-specific structures that would change the collision resolution.
What would settle it
Measure the empirical A_0 on a new bivariate bicycle code whose mean fault-graph degree is known in advance and check whether the observed value matches the closed-form prediction to within a few percent.
read the original abstract
We present an analytical theory of greedy peeling decoding for bivariate bicycle (BB) codes under circuit-level noise. The deferred greedy decoder achieves 330x latency reduction over belief propagation (BP) at p = 10^{-3} while maintaining identical logical error rate. Our main theoretical contribution is a closed-form collision resolution factor A_0 = |true collisions| / |birthday collisions|, derived from XOR syndrome analysis with no free parameters, that quantifies the fraction of detector-sharing fault pairs genuinely blocking iterative peeling. For the [[144,12,12]] Gross code, A_0 = 0.8685 (within 0.5% of the empirical value), with shared-2 pairs (4-cycles) always resolving under peeling. We show A_0 depends on the mean fault-graph degree d-bar rather than code size: A_0 = 0.87 for d-bar = 52 (Gross family) versus A_0 = 0.76 for d-bar = 17 ([[32,8,6]]). We establish a syndrome code stopping distance d_S = n/4.5 for the Gross family and demonstrate that [[32,8,6]] (d_S = 4) enables two-shot streaming decoding: T = 2 rounds achieve 89% peeling success with 1.29 +/- 0.03 LER ratio versus T = 12, at estimated latency ~50 ns. The full formula P_peel = exp(-A_0 * gamma_analytic * exp(-BTp) * n * p^2) is validated across five BB codes, four noise levels, and four values of T with R^2 = 0.86. Cross-platform reproduction of the Kunlun [[18,4,4]] experiment matches their hardware LER within 0.73 percentage points.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops an analytical theory of greedy peeling decoding for bivariate bicycle (BB) codes under circuit-level noise. The central contribution is a parameter-free closed-form collision resolution factor A_0 = |true collisions| / |birthday collisions| derived from XOR syndrome analysis on the detector graph; this factor is inserted into the predictive formula P_peel = exp(-A_0 * gamma_analytic * exp(-BTp) * n * p^2). The theory is validated across five BB codes, four noise levels, and four values of T with R^2 = 0.86, yields A_0 = 0.8685 (within 0.5% of empirical) for the [[144,12,12]] Gross code, establishes d_S = n/4.5 for the Gross family, demonstrates two-shot streaming decoding for the [[32,8,6]] code (89% peeling success, 1.29 LER ratio vs. T=12), and reproduces hardware LER for the Kunlun [[18,4,4]] code within 0.73 points. The deferred greedy decoder is reported to achieve 330x latency reduction over BP at p=10^{-3} while preserving logical error rate.
Significance. If the central derivation holds, the work supplies a useful predictive tool for decoder performance in quantum LDPC codes, enabling low-latency implementations with quantifiable peeling success. Strengths include the explicitly parameter-free derivation of A_0 from XOR analysis, the hardware cross-validation, and the concrete streaming-decoding result for a small code. These elements could inform practical fault-tolerant architectures by reducing reliance on iterative numerical decoders.
major comments (2)
- [main theoretical contribution / derivation of A_0] The derivation of A_0 from XOR syndrome analysis (main theoretical contribution) treats detector-sharing fault pairs as the sole determinant of blocking events under the assumption that pairwise collisions fully capture the dynamics. This is load-bearing for the parameter-free claim, yet the manuscript provides no explicit bound or test showing that circuit-induced correlations (e.g., from CNOT weight-2 errors or measurement channels) do not produce systematic offsets in the true-collision count beyond the marginal degree d-bar. The reported 0.5% match for one code and overall R^2=0.86 do not rule out such offsets when the noise model is replaced by a full circuit simulation.
- [P_peel formula] P_peel formula (Eq. for P_peel): the exponential form assumes higher-order fault interactions remain negligible across the tested range of p and T. No sensitivity analysis or counter-example is supplied to delineate the regime where this approximation breaks, which is load-bearing for the claim that the formula is predictive with no free parameters.
minor comments (3)
- [Abstract] Abstract: 'four values of T' is stated without an explicit definition of T in the abstract itself, although context indicates it denotes the number of streaming rounds.
- [Introduction / results] The 330x latency reduction is asserted without detailing the BP baseline implementation, measurement assumptions, or hardware platform used for the comparison.
- [P_peel formula] Notation: gamma_analytic and BTp appearing in the P_peel formula are not defined at first use in the main text, which may hinder readers outside the immediate subfield.
Simulated Author's Rebuttal
We thank the referee for the thorough review and constructive feedback on our manuscript. We address the two major comments point by point below. Our responses aim to clarify the assumptions in the derivation while acknowledging areas where additional discussion or analysis can strengthen the work. We propose targeted revisions to improve the presentation of limitations without altering the core claims.
read point-by-point responses
-
Referee: The derivation of A_0 from XOR syndrome analysis (main theoretical contribution) treats detector-sharing fault pairs as the sole determinant of blocking events under the assumption that pairwise collisions fully capture the dynamics. This is load-bearing for the parameter-free claim, yet the manuscript provides no explicit bound or test showing that circuit-induced correlations (e.g., from CNOT weight-2 errors or measurement channels) do not produce systematic offsets in the true-collision count beyond the marginal degree d-bar. The reported 0.5% match for one code and overall R^2=0.86 do not rule out such offsets when the noise model is replaced by a full circuit simulation.
Authors: The detector graph is explicitly constructed from the full circuit-level noise model, which incorporates all CNOT weight-2 errors, measurement channels, and other fault mechanisms as individual fault locations. The XOR syndrome analysis then enumerates pairwise collisions directly on this graph, yielding the parameter-free A_0 as the ratio of true blocking pairs to birthday pairs. While we agree that higher-order correlations could introduce offsets not captured by the marginal degree d-bar alone, the empirical results show A_0 = 0.8685 (0.5% of empirical) for the Gross code and consistent R^2 = 0.86 across five BB codes, four noise levels, and four T values. The hardware LER reproduction for the Kunlun [[18,4,4]] code within 0.73 points further supports that the model does not suffer large systematic offsets in practice. We will add a dedicated paragraph in the discussion section explicitly stating the pairwise assumption, noting the absence of a rigorous bound, and highlighting the empirical evidence and hardware validation as support for its applicability in the tested regime. revision: partial
-
Referee: P_peel formula (Eq. for P_peel): the exponential form assumes higher-order fault interactions remain negligible across the tested range of p and T. No sensitivity analysis or counter-example is supplied to delineate the regime where this approximation breaks, which is load-bearing for the claim that the formula is predictive with no free parameters.
Authors: The exponential form follows from modeling the number of blocking collisions as a Poisson process under the low-p, moderate-T regime where the probability of three-or-higher fault overlaps is small (O(p^3) and higher). This is consistent with the circuit-level noise model and the observed peeling success rates. The formula was validated with R^2 = 0.86 over p ranging from 10^{-4} to 10^{-2} and T up to 12, correctly predicting both the Gross-code A_0 and the two-shot streaming performance for the [[32,8,6]] code. We acknowledge that no explicit sensitivity plot or counter-example at the boundary was included. We will revise the manuscript to add a short sensitivity subsection that (i) plots the residual between predicted and observed P_peel versus p and T, (ii) identifies the regime (p ≲ 0.01, T ≲ 20) where the approximation holds to within 5%, and (iii) notes that deviations appear at higher p where multi-fault events become non-negligible. This will delineate the validity range while preserving the parameter-free character inside that range. revision: yes
Circularity Check
No circularity: A_0 derived analytically from XOR analysis with external validation
full rationale
The paper's core derivation presents A_0 as a closed-form quantity obtained directly from XOR syndrome analysis with explicitly zero free parameters, then inserts it into the P_peel formula. This formula is subsequently validated across five BB codes, multiple noise levels, T values, and an independent hardware reproduction (Kunlun [[18,4,4]]), yielding R^2 = 0.86 and 0.5% agreement on the Gross code. No step reduces by construction to a fitted input, self-citation, or ansatz; the analysis is self-contained against external benchmarks and does not rely on renaming or uniqueness claims imported from prior author work.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The XOR syndrome analysis accurately identifies and quantifies true collisions versus birthday collisions in the fault graph under circuit-level noise.
- domain assumption The mean fault-graph degree d-bar determines A_0 independently of other code parameters for the BB family.
Reference graph
Works this paper leans on
-
[1]
K. Wanget al., Demonstration of low-overhead quan- tum error correction codes, Nature Physics (2026), arXiv:2505.09684
-
[2]
Bravyi, A
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature627, 778 (2024)
2024
-
[3]
T. J. Yoderet al., Tour de gross: A modular quan- tum computer based on bivariate bicycle codes (2025), arXiv:2506.03094, arXiv:2506.03094
work page internal anchor Pith review arXiv 2025
-
[4]
Roffe, D
J. Roffe, D. R. White, S. Burton, and E. T. Campbell, De- coding across the quantum low-density parity-check code landscape, Physical Review Research2, 043423 (2020)
2020
-
[5]
A. S. Maan, F. Garcia-Herrero, A. Paler, and V. Savin, Decoding correlated errors in quantum LDPC codes, Na- ture Communications 10.1038/s41467-026-70556-3 (2026), arXiv:2510.14060
-
[6]
Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)
C. Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)
2021
-
[7]
IBM Quantum, IBM quantum platform,https:// quantum.ibm.com(2026)
2026
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.