pith. machine review for the scientific record. sign in

arxiv: 2605.06547 · v2 · submitted 2026-05-07 · 💻 cs.IT · math.IT· quant-ph

Recognition: 2 theorem links

· Lean Theorem

Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction

Leo Wursthorn , Jonathan Mandelbaum , Sisi Miao , Hedongliang Liu , Holger J\"akel , Stergios Koutsioumpas , Laurent Schmalen
Authors on Pith no claims yet

Pith reviewed 2026-05-11 01:54 UTC · model grok-4.3

classification 💻 cs.IT math.ITquant-ph
keywords quantum LDPC codesdegeneracybelief propagationaffine subcode ensembleovercomplete check matrixtoric codesgeneralized bicycle codesstabilizer codes
0
0 comments X

The pith

Appending linearly independent rows to stabilizer check matrices shrinks the degenerate solution space and improves affine subcode ensemble decoding for quantum LDPC codes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper demonstrates that adding extra linearly independent rows to a quantum stabilizer check matrix reduces the number of candidate degenerate error patterns a decoder must consider. This observation leads to an extension of classical affine subcode ensemble decoding into the quantum domain, where each decoding path uses an overcomplete version of the check matrix. Monte-Carlo simulations on toric codes and generalized bicycle codes then show faster convergence of belief propagation together with lower logical error rates. A sympathetic reader cares because degeneracy has long prevented efficient message-passing decoders from reaching the performance needed for low-overhead fault-tolerant quantum computation.

Core claim

Appending linearly independent rows to a stabilizer-code check matrix reduces the search space for a valid degenerate solution. Motivated by this, the affine subcode ensemble decoding technique is extended from the classical to the quantum setting, employing overcomplete matrices for each decoding path. Monte-Carlo simulations on toric and generalized bicycle codes demonstrate improved convergence and reduced logical error rate.

What carries the argument

Affine subcode ensemble decoding applied to overcomplete check matrices formed by appending linearly independent rows to the stabilizer matrix.

If this is right

  • Belief-propagation decoding converges more reliably on degenerate quantum LDPC codes.
  • Logical error rates decrease for toric codes and generalized bicycle codes under the new decoder.
  • Overcomplete check matrices become usable as a direct tool for handling degeneracy in quantum decoding.
  • The transfer of affine subcode ensemble ideas from classical to quantum codes is effective for stabilizer-code families.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The row-append technique may combine with other post-processing methods to produce still lower error rates on the same codes.
  • Similar overcompleteness modifications could be tested on additional quantum code families such as hypergraph-product or lifted-product codes.
  • If the search-space reduction holds generally, it could guide the design of new overcomplete representations for other message-passing quantum decoders.

Load-bearing premise

Appending linearly independent rows to a stabilizer-code check matrix reduces the search space for a valid degenerate solution in a manner that benefits the affine subcode ensemble decoder.

What would settle it

Monte-Carlo simulations on toric and generalized bicycle codes that show no improvement or an increase in logical error rate under the proposed overcomplete affine subcode ensemble decoder would falsify the performance claims.

Figures

Figures reproduced from arXiv: 2605.06547 by Hedongliang Liu, Holger J\"akel, Jonathan Mandelbaum, Laurent Schmalen, Leo Wursthorn, Sisi Miao, Stergios Koutsioumpas.

Figure 1
Figure 1. Figure 1: Block diagram of an aSCED batch with 2∆ distinct paths decoding with the same extended check matrix H(ℓ) . Each path uses a different syndrome configuration gδ ∈ F∆ 2 , δ ∈ [2∆], corresponding to the ∆ splitters. are generated using [25, Algorithm 1] to avoid introducing additional cycles of length 4 in the Tanner graph representation of the respective component PCMs. For δ ∈ [2∆], the δth path in the ℓth … view at source ↗
Figure 5
Figure 5. Figure 5: LER of OBP4-aSCEDK, K ∈ {16, 64, 256}, and BP-OSD on the J126, 28, 8K GB code. BP and OBP4 are limited to Imax = 200 decoding iterations. OSD post-processing is applied at order 10 view at source ↗
Figure 4
Figure 4. Figure 4: Fraction of Type I failures relative to the total number of logical errors view at source ↗
read the original abstract

Quantum low-density parity-check codes are promising candidates for low-overhead fault-tolerant quantum computing, but degeneracy is known to impair the convergence of belief-propagation (BP) decoding of these codes. In this work, we show that appending linearly independent rows to a check matrix of a stabilizer code can reduce the search space for a valid degenerate solution. Motivated by this, we extend the recently proposed affine subcode ensemble decoding technique from the classical to the quantum setting. Moreover, we employ overcomplete matrices for each decoding path. Monte-Carlo simulations on toric and generalized bicycle codes demonstrate improved convergence and reduced logical error rate.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper claims that appending linearly independent rows to the check matrix of a stabilizer code reduces the search space for valid degenerate solutions. This motivates an extension of affine subcode ensemble decoding from the classical to the quantum setting, combined with the use of overcomplete matrices for each decoding path. Monte-Carlo simulations on toric and generalized bicycle codes are reported to demonstrate improved belief-propagation convergence and reduced logical error rates.

Significance. If the construction is shown to preserve the original code while addressing degeneracy, the approach could meaningfully improve decoding of quantum LDPC codes, a central challenge for low-overhead fault tolerance. The extension of affine subcode ensembles and overcomplete-matrix techniques to the quantum case would represent a concrete technical contribution, provided the empirical results are reproducible and the code properties remain unchanged.

major comments (2)
  1. [Abstract] Abstract: the central motivation states that appending linearly independent rows reduces the search space for a degenerate solution. However, any linearly independent rows strictly increase the rank of the check matrix H, enlarging the stabilizer group and producing a proper subcode of lower dimension. This appears to contradict the claim that the original toric and generalized bicycle codes are being decoded; the reported Monte-Carlo gains would then apply to a different code family.
  2. [Abstract] Abstract: the abstract asserts simulation-based improvements in convergence and logical error rate, yet the provided text contains no methods section, simulation parameters, data tables, error bars, or explicit baseline comparisons. Without these, the empirical claim cannot be evaluated.
minor comments (1)
  1. The manuscript would benefit from explicit statements of the precise check-matrix construction (including whether appended rows are used only at decoding time or modify the code) and from a clear comparison of the resulting code parameters (dimension, distance) before and after row appending.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying points that require clarification. We respond to each major comment below, indicating the revisions we will make.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central motivation states that appending linearly independent rows reduces the search space for a degenerate solution. However, any linearly independent rows strictly increase the rank of the check matrix H, enlarging the stabilizer group and producing a proper subcode of lower dimension. This appears to contradict the claim that the original toric and generalized bicycle codes are being decoded; the reported Monte-Carlo gains would then apply to a different code family.

    Authors: We appreciate the referee highlighting this important technical point. The additional rows used to form the overcomplete check matrices are constructed as linear combinations of the original rows of H; consequently the rank is unchanged and the stabilizer group (hence the code space and logical operators) remains identical to that of the original toric or generalized bicycle code. The phrase “linearly independent rows” in the abstract was imprecise and referred to the selection of distinct affine subcodes within the ensemble decoder rather than to an increase in the rank of the base parity-check matrix. We will revise the abstract and insert a short clarifying paragraph in the methods section that explicitly states the rows are drawn from the row space of the original H, thereby preserving the code while still reducing the effective search space for degenerate errors during belief-propagation decoding. revision: yes

  2. Referee: [Abstract] Abstract: the abstract asserts simulation-based improvements in convergence and logical error rate, yet the provided text contains no methods section, simulation parameters, data tables, error bars, or explicit baseline comparisons. Without these, the empirical claim cannot be evaluated.

    Authors: The full manuscript contains a dedicated Numerical Results section that specifies the Monte-Carlo setup (error model, number of trials, BP iteration limits, damping factors), presents tables and figures with error bars, and compares against standard BP decoding. We acknowledge that these details may not have been sufficiently prominent. In the revision we will expand the section with an explicit table of all simulation parameters, additional baseline curves, and a reproducibility statement, thereby addressing the referee’s concern. revision: partial

Circularity Check

0 steps flagged

No significant circularity; empirical results independent of definitions

full rationale

The paper motivates an extension of affine subcode ensemble decoding by an observation on appending rows to stabilizer check matrices, then reports Monte-Carlo results on toric and generalized bicycle codes. No equations, fitted parameters, or predictions are shown to reduce to the authors' own inputs by construction. The central claims rest on external simulations rather than self-referential fitting or definitional equivalence. Any self-citation to the classical technique is not load-bearing for the quantum results.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, axioms, or invented entities are identifiable from the abstract alone.

pith-pipeline@v0.9.0 · 5426 in / 1043 out tokens · 43040 ms · 2026-05-11T01:54:33.414956+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

43 extracted references · 43 canonical work pages · 1 internal anchor

  1. [1]

    Scheme for reducing decoherence in quantum computer memory,

    P. W. Shor, “Scheme for reducing decoherence in quantum computer memory,”Phys. Rev. A, vol. 52, pp. R2493–R2496, 1995

    work page 1995

  2. [2]

    Stabilizer codes and quantum error correction,

    D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, California Institute of Technology, 1997

    work page 1997

  3. [3]

    M. M. Wilde,Quantum Information Theory. Cambridge university press, 2013

    work page 2013

  4. [4]

    Sparse-graph codes for quantum error correction,

    D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,”IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2315–2330, 2004

    work page 2004

  5. [5]

    Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,

    J.-P. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,”IEEE Trans. Inf. Theory, vol. 60, no. 2, pp. 1193–1202, Feb. 2014

    work page 2014

  6. [6]

    Degenerate quantum LDPC codes with good finite length performance,

    P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,”Quantum, vol. 5, p. 585, Nov. 2021

    work page 2021

  7. [7]

    High-threshold and low-overhead fault-tolerant quantum memory,

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, “High-threshold and low-overhead fault-tolerant quantum memory,”Nature, vol. 627, no. 8005, pp. 778–782, Mar. 2024

    work page 2024

  8. [8]

    Low-density parity-check codes,

    R. G. Gallager, “Low-density parity-check codes,”IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21–28, 1962

    work page 1962

  9. [9]

    Quantum error-correcting codes need not completely reveal the error syndrome,

    P. W. Shor and J. A. Smolin, “Quantum error-correcting codes need not completely reveal the error syndrome,” inProc. Annu. Symp. Found. Comput. Sci. (FOCS), Burlington, VT, USA, Oct. 1996

    work page 1996

  10. [10]

    Hardness of decoding quantum stabilizer codes,

    P. Iyer and D. Poulin, “Hardness of decoding quantum stabilizer codes,” IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 5209–5223, 2015

    work page 2015

  11. [11]

    On the iterative decoding of sparse quantum codes,

    D. Poulin and Y . Chung, “On the iterative decoding of sparse quantum codes,”Quantum Inf. Comput., vol. 8, no. 10, pp. 987–1000, Nov. 2008

    work page 2008

  12. [12]

    Belief propagation decoding of quantum LDPC codes with guided decimation,

    H. Yao, W. Abu Laban, C. Häger, A. Graell i Amat, and H. D. Pfister, “Belief propagation decoding of quantum LDPC codes with guided decimation,” inProc. IEEE Int. Symp. Inf. Theory (ISIT), Athens, Greece, Jul. 2024

    work page 2024

  13. [13]

    Quaternary neural belief propagation decoding of quantum LDPC codes with overcom- plete check matrices,

    S. Miao, A. Schnerring, H. Li, and L. Schmalen, “Quaternary neural belief propagation decoding of quantum LDPC codes with overcom- plete check matrices,”IEEE Access, vol. 13, pp. 25 637–25 649, Feb. 2025

    work page 2025

  14. [14]

    Trapping sets of quantum LDPC codes,

    N. Raveendran and B. Vasi ´c, “Trapping sets of quantum LDPC codes,” Quantum, vol. 5, p. 562, Oct. 2021

    work page 2021

  15. [15]

    Improved belief propagation is sufficient for real-time decoding of quantum memory,

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

    work page 2025

  16. [16]

    Decoding across the quantum LDPC code landscape,

    J. Roffe, D. R. White, S. Burton, and E. T. Campbell, “Decoding across the quantum LDPC code landscape,”Phys. Rev. Res., vol. 2, no. 4, p. 043423, Dec. 2020

    work page 2020

  17. [17]

    Localized statistics decoding for quantum low-density parity- check codes,

    T. Hillmann, L. Berent, A. O. Quintavalle, J. Eisert, R. Wille, and J. Roffe, “Localized statistics decoding for quantum low-density parity- check codes,”Nat. Commun., vol. 16, no. 1, p. 8214, Sep. 2025

    work page 2025

  18. [18]

    Symmetry-breaking de- coding for quantum LDPC codes

    K. Yin, X. Fang, J. Ruan, H. Zhang, D. Tullsen, A. Sornborger, C. Liu, A. Li, T. Humble, and Y . Ding, “SymBreak: Mitigating quantum degeneracy issues in QLDPC code decoders by breaking symmetry,” Dec. 2024, 10.48550/arXiv.2412.02885

    work page doi:10.48550/arxiv.2412.02885 2024

  19. [19]

    Log-domain decoding of quantum LDPC codes over binary finite fields,

    C.-Y . Lai and K.-Y . Kuo, “Log-domain decoding of quantum LDPC codes over binary finite fields,”IEEE Trans. Quantum Eng., vol. 2, pp. 1–15, Sep. 2021

    work page 2021

  20. [20]

    Neural belief-propagation decoders for quantum error-correcting codes,

    Y .-H. Liu and D. Poulin, “Neural belief-propagation decoders for quantum error-correcting codes,”Phys. Rev. Lett., vol. 122, no. 20, p. 200501, May 2019

    work page 2019

  21. [21]

    Automorphism ensemble decoding of quasi-cyclic LDPC codes by breaking graph symmetries,

    M. Geiselhart, M. Ebada, A. Elkelesh, J. Clausius, and S. ten Brink, “Automorphism ensemble decoding of quasi-cyclic LDPC codes by breaking graph symmetries,”IEEE Commun. Lett., vol. 26, no. 8, pp. 1705–1709, Aug. 2022

    work page 2022

  22. [22]

    Endomorphisms of linear block codes,

    J. Mandelbaum, S. Miao, H. Jäkel, and L. Schmalen, “Endomorphisms of linear block codes,” inProc. IEEE Int. Symp. Inform. Theory (ISIT), Athens, Greece, Jul. 2024

    work page 2024

  23. [23]

    Multiple-bases belief-propagation decoding of high-density cyclic codes,

    T. Hehn, J. Huber, O. Milenkovic, and S. Laendner, “Multiple-bases belief-propagation decoding of high-density cyclic codes,”IEEE Trans. Commun., vol. 58, no. 1, pp. 1–8, Jan. 2010

    work page 2010

  24. [24]

    A joint code and belief propagation decoder design for quantum LDPC codes,

    S. Miao, J. Mandelbaum, H. Jäkel, and L. Schmalen, “A joint code and belief propagation decoder design for quantum LDPC codes,” inProc. IEEE Int. Symp. Inform. Theory (ISIT), Athens, Greece, Jul. 2024

    work page 2024

  25. [25]

    Subcode ensemble decoding of linear block codes,

    J. Mandelbaum, H. Jäkel, and L. Schmalen, “Subcode ensemble decoding of linear block codes,” inProc. IEEE Int. Symp. Inform. Theory (ISIT), Ann Arbor, MI, USA, Jun. 2025

    work page 2025

  26. [26]

    Automorphism ensemble decoding of Reed-Muller codes,

    M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “Automorphism ensemble decoding of Reed-Muller codes,” IEEE Trans. Commun., vol. 69, no. 10, pp. 6424–6438, Oct. 2021

    work page 2021

  27. [27]

    Au- tomorphism ensemble decoding of quantum LDPC codes

    S. Koutsioumpas, H. Sayginel, M. Webster, and D. E. Browne, “Au- tomorphism ensemble decoding of quantum LDPC codes,” Mar. 2025, 10.48550/arXiv.2503.01738

    work page doi:10.48550/arxiv.2503.01738 2025

  28. [28]

    Colour codes reach surface code performance using Vibe decoding,

    S. Koutsioumpas, T. Noszko, H. Sayginel, M. Webster, and J. Roffe, “Colour codes reach surface code performance using Vibe decoding,” Aug. 2025, 10.48550/arXiv.2508.15743

    work page doi:10.48550/arxiv.2508.15743 2025

  29. [29]

    Decoding correlated errors in quantum LDPC codes,

    A. S. Maan, F. M. Garcia Herrero, A. Paler, and V . Savin, “Decoding correlated errors in quantum LDPC codes,”Nat. Commun., vol. 17, p. 3965, Mar. 2026

    work page 2026

  30. [30]

    Low-latency be- lief propagation decoding for quantum LDPC codes

    A. Gong, S. Cammerer, and J. M. Renes, “Toward low-latency iterative decoding of QLDPC codes under circuit-level noise,” Mar. 2024, 10.48550/arXiv.2403.18901

    work page doi:10.48550/arxiv.2403.18901 2024

  31. [31]

    Beam search decoder for quantum LDPC codes,

    M. Ye, D. Wecker, and N. Delfosse, “Beam search decoder for quantum LDPC codes,” 2025. [Online]. Available: https: //arxiv.org/abs/2512.07057

    work page arXiv 2025

  32. [32]

    Affine Subcode Ensemble Decoding of Linear Block Codes

    J. Mandelbaum, P. Bezner, S. ten Brink, H. Jäkel, and L. Schmalen, “Affine subcode ensemble decoding for linear block codes,” Apr. 2026, 10.48550/arXiv.2604.06889

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2604.06889 2026

  33. [33]

    Topological quantum memory,

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,”J. Math. Phys., vol. 43, no. 9, pp. 4452–4505, Sep. 2002

    work page 2002

  34. [34]

    Fault-tolerant quantum computation by anyons,

    A. Y . Kitaev, “Fault-tolerant quantum computation by anyons,”Ann. Phys., vol. 303, no. 1, pp. 2–30, Jan. 2003

    work page 2003

  35. [35]

    Quantum error correction via codes over GF(4),

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF(4),”IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1369–1387, Jul. 1998

    work page 1998

  36. [36]

    Good quantum error-correcting codes exist,

    A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,”Phys. Rev. A, vol. 54, no. 2, pp. 1098–1105, Aug. 1996

    work page 1996

  37. [37]

    Multiple-particle interference and quantum error cor- rection,

    A. M. Steane, “Multiple-particle interference and quantum error cor- rection,”Proc. R. Soc. Lond. A, vol. 452, no. 1954, pp. 2551–2577, Sep. 1996

    work page 1954

  38. [38]

    Quantum error correction: an introductory guide,

    J. Roffe, “Quantum error correction: an introductory guide,”Contemp. Phys., vol. 60, no. 3, p. 226–245, Jul. 2019

    work page 2019

  39. [39]

    Refined belief propagation decoding of sparse-graph quantum codes,

    K.-Y . Kuo and C.-Y . Lai, “Refined belief propagation decoding of sparse-graph quantum codes,”IEEE J. Sel. Areas in Inf. Theory, vol. 1, no. 2, pp. 487–498, Aug. 2020

    work page 2020

  40. [40]

    When does one redundant parity-check equation matter?

    S. Laendner, T. Hehn, O. Milenkovic, and J. B. Huber, “When does one redundant parity-check equation matter?” inProc. Global Conf. Commun. (GLOBECOM), San Francisco, CA, USA, Nov. 2006

    work page 2006

  41. [41]

    A probabilistic algorithm for computing minimum weights of large error-correcting codes,

    J. S. Leon, “A probabilistic algorithm for computing minimum weights of large error-correcting codes,”IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1354–1359, Sep. 1988

    work page 1988

  42. [42]

    Sparse blossom: Correcting a million errors per core second with minimum-weight matching,

    O. Higgott and C. Gidney, “Sparse blossom: Correcting a million errors per core second with minimum-weight matching,”Quantum, vol. 9, p. 1600, Jan. 2025

    work page 2025

  43. [43]

    arXiv preprint arXiv:1310.0863 , year=

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

    work page doi:10.48550/arxiv.1310.0863 2013