pith. sign in

arxiv: 2510.05222 · v3 · pith:7RM2BOJInew · submitted 2025-10-06 · ❄️ cond-mat.stat-mech · quant-ph

Scalable accuracy gains from postselection in quantum error correcting codes

Hongkun Chen , Daohong Xu , Grace M. Sommers , David A. Huse , Jeff D. Thompson , Sarang Gopalakrishnan This is my paper

Pith reviewed 2026-05-21 21:04 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech quant-ph
keywords toric codepostselectionlogical error ratequantum error correctionsyndrome distributionstatistical mechanics modellarge deviation principle
0
0 comments X

The pith

Postselecting on common syndromes suppresses logical error rates from p_f to p_f^b in stabilizer codes

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

The paper examines the distribution of logical failure rates over different observed syndromes when decoding the toric code. It finds that within the coding phase most logical failures arise from exponentially rare syndrome patterns. Postselecting to keep only the common patterns therefore improves accuracy scalably. The logical error rate drops from p_f to p_f^b with b at least 2 in general and numerically 3.1 for the toric code with perfect measurements. A sympathetic reader would care because this offers a practical way to gain accuracy by discarding some runs rather than enlarging the code.

Core claim

Decoding stabilizer codes involves evaluating free-energy differences in a disordered statistical mechanics model whose randomness comes from the observed syndrome pattern. Within the coding phase logical failures are predominantly caused by exponentially unlikely syndromes. Postselecting on not seeing these unlikely patterns suppresses the logical error rate from p_f to p_f^b, where b is at least 2 in general; for the toric code with perfect syndrome measurements numerical results give b = 3.1(1). The arguments apply to general topological stabilizer codes provided the decoding failure probability obeys a large deviation principle.

What carries the argument

The statistical distribution of logical failure rates across observed syndromes in the disordered statistical mechanics model used for decoding.

If this is right

  • The logical error rate can be suppressed from p_f to p_f^b with b greater than or equal to 2 for general topological stabilizer codes.
  • For the toric code with perfect syndrome measurements the exponent reaches 3.1(1).
  • The postselection strategy extends to more general settings as long as the decoding failure probability obeys a large deviation principle.

Where Pith is reading between the lines

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

  • In hardware implementations one could monitor the estimated probability of each syndrome in real time and abort runs whose syndromes fall below a chosen rarity threshold.
  • The same large-deviation reasoning may apply to other fault-tolerant protocols in which rare events dominate the overall failure rate.
  • This suggests that tracking syndrome rarity statistics could become a standard diagnostic for assessing how close a device is to the coding phase.

Load-bearing premise

The decoding failure probability obeys a large deviation principle.

What would settle it

A direct simulation on larger toric code instances showing that the fraction of logical failures caused by exponentially rare syndromes does not grow with system size would falsify the claim.

Figures

Figures reproduced from arXiv: 2510.05222 by Daohong Xu, David A. Huse, Grace M. Sommers, Hongkun Chen, Jeff D. Thompson, Sarang Gopalakrishnan.

Figure 1
Figure 1. Figure 1: FIG. 1. Numerical results for [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. (a) Illustration of postselection with fixed qubit budget ( [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Verification of large deviation scaling for minimum [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
read the original abstract

Decoding stabilizer codes such as the surface and toric codes involves evaluating free-energy differences in a disordered statistical mechanics model, in which the randomness comes from the observed pattern of error syndromes. We study the statistical distribution of logical failure rates across observed syndromes in the toric code, and show that, within the coding phase, logical failures are predominantly caused by exponentially unlikely syndromes. Therefore, postselecting on not seeing these exponentially unlikely syndrome patterns offers a scalable accuracy gain. In general, the logical error rate can be suppressed from $p_f$ to $p_f^b$, where $b \geq 2$ in general; in the specific case of the toric code with perfect syndrome measurements, we find numerically that $b = 3.1(1)$. Our arguments apply to general topological stabilizer codes, and can be extended to more general settings as long as the decoding failure probability obeys a large deviation principle.

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

1 major / 1 minor

Summary. The paper claims that in the toric code (and more generally in topological stabilizer codes), logical failures within the coding phase are predominantly caused by exponentially unlikely syndromes. Postselecting on the absence of these rare syndromes therefore suppresses the logical error rate from p_f to p_f^b with b >= 2 in general; numerical evidence for the toric code with perfect syndrome measurements yields b = 3.1(1). The argument is conditioned on the decoding failure probability obeying a large-deviation principle.

Significance. If the result holds, the work identifies a postselection mechanism that can deliver scalable accuracy improvements in quantum error correction by exploiting the statistics of rare syndromes, without requiring additional physical resources. The combination of a general large-deviation argument with a concrete numerical exponent for the toric code is a potentially useful contribution to fault-tolerant quantum computing.

major comments (1)
  1. [Abstract and concluding discussion of general codes] The extension to general topological stabilizer codes (stated in the abstract and the final paragraph of the main text) is conditioned on the decoding failure probability obeying a large deviation principle with strictly positive rate function throughout the coding phase. No derivation or proof of this LDP is supplied for arbitrary stabilizer codes, nor is it shown that the rate function remains positive away from the threshold; only numerical support is given for the toric code. This assumption is load-bearing for the general claim.
minor comments (1)
  1. [Numerical results] The numerical result b = 3.1(1) is reported without accompanying details on the underlying distribution analysis, Monte Carlo sampling method, error-bar estimation, or explicit verification that the large-deviation assumption holds in the simulated regime.

Simulated Author's Rebuttal

1 responses · 1 unresolved

We thank the referee for their careful reading and constructive feedback on our manuscript. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract and concluding discussion of general codes] The extension to general topological stabilizer codes (stated in the abstract and the final paragraph of the main text) is conditioned on the decoding failure probability obeying a large deviation principle with strictly positive rate function throughout the coding phase. No derivation or proof of this LDP is supplied for arbitrary stabilizer codes, nor is it shown that the rate function remains positive away from the threshold; only numerical support is given for the toric code. This assumption is load-bearing for the general claim.

    Authors: We agree that the general claim for topological stabilizer codes is conditional on the decoding failure probability obeying a large deviation principle (LDP) with a strictly positive rate function throughout the coding phase, and that the manuscript supplies neither a derivation nor a proof of this LDP for arbitrary codes. The paper explicitly states this conditioning in the abstract and final paragraph, and the toric-code results rest on numerical evidence. A general proof would require establishing the LDP for the free-energy differences in the disordered statistical-mechanics models associated with each code family, which lies outside the scope of the present work. In the revised manuscript we will modify the abstract and concluding discussion to state the conditional character of the general claim more prominently and to add a short paragraph explaining why the LDP (and positivity of the rate function) is expected on the basis of the existence of a threshold and standard large-deviation properties of disordered systems. We do not claim to have proven the LDP for all codes. revision: yes

standing simulated objections not resolved
  • Rigorous derivation or proof of the large deviation principle for arbitrary topological stabilizer codes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on standard LDP assumption and independent numerics

full rationale

The paper's argument that postselection suppresses logical error rates from p_f to p_f^b (b>=2) for general topological stabilizer codes is explicitly conditioned on the decoding failure probability obeying a large deviation principle, which is invoked as an external statistical mechanics assumption rather than derived internally or via self-citation. The specific numerical result b=3.1(1) for the toric code is obtained from direct simulation of syndrome distributions and is not forced by fitting or by construction from the general claim. No steps match self-definitional, fitted-input-called-prediction, or ansatz-smuggled patterns; the central claim remains independent of its inputs.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claim rests primarily on the domain assumption that failure probabilities obey a large deviation principle and on the empirical observation that logical failures concentrate on rare syndromes; the numerical exponent is determined from simulation.

free parameters (1)
  • exponent b = 3.1(1)
    Numerically extracted value 3.1(1) for the toric code with perfect measurements that quantifies the postselection gain.
axioms (1)
  • domain assumption decoding failure probability obeys a large deviation principle
    Invoked explicitly as the condition allowing extension of the postselection argument to general topological stabilizer codes.

pith-pipeline@v0.9.0 · 5707 in / 1313 out tokens · 50094 ms · 2026-05-21T21:04:43.083068+00:00 · methodology

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.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Syndrome resampling enhances quantum error correction thresholds

    quant-ph 2026-05 unverdicted novelty 7.0

    Syndrome resampling increases QEC thresholds and cuts logical errors by up to four orders of magnitude by biasing toward likely syndromes, linked to Rényi coherent information phase transitions.

  2. Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation

    quant-ph 2025-11 unverdicted novelty 6.0

    Entanglement boosting protocol prepares logical Bell pairs in rotated surface codes with orders-of-magnitude lower link-limited volume, reaching 10^{-10} logical error from 86 physical pairs at 1% error using soft dec...

Reference graph

Works this paper leans on

54 extracted references · 54 canonical work pages · cited by 2 Pith papers · 3 internal anchors

  1. [1]

    An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation

    D. Gottesman, An introduction to quantum error cor- rection and fault-tolerant quantum computation (2009), arXiv:0904.2557 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  2. [2]

    Google Quantum AI, Exponential suppression of bit or phase errors with cyclic error correction, Nature595, 383 (2021)

    work page 2021

  3. [3]

    Ryan-Anderson, J

    C. Ryan-Anderson, J. G. Bohnet, K. Lee, D. Gresh, A. Hankin, J. P. Gaebler, D. Francois, A. Chernoguzov, D. Lucchetti, N. C. Brown, T. M. Gatterman, S. K. Halit, K. Gilmore, J. A. Gerber, B. Neyenhuis, D. Hayes, and R. P. Stutz, Realization of real-time fault-tolerant quan- tum error correction, Phys. Rev. X11, 041058 (2021)

    work page 2021

  4. [4]

    V. V. Sivak, A. Eickbusch, B. Royer, S. Singh, I. Tsiout- 6 sios, S. Ganjam, A. Miano, B. Brock, A. Ding, L. Frun- zio,et al., Real-time quantum error correction beyond break-even, Nature616, 50 (2023)

    work page 2023

  5. [5]

    Bluvstein, S

    D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter,et al., Logical quantum processor based on reconfigurable atom arrays, Nature626, 58 (2024)

    work page 2024

  6. [6]

    Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Hug- gins, Y. Li, J. R. McClean, and T. E. O’Brien, Quantum error mitigation, Rev. Mod. Phys.95, 045005 (2023)

    work page 2023

  7. [7]

    Aharonov, O

    D. Aharonov, O. Alberton, I. Arad, Y. Atia, E. Bairey, Z. Brakerski, I. Cohen, O. Golan, I. Gurwich, O. Ken- neth,et al., On the importance of error mitigation for quantum computation, arXiv preprint arXiv:2503.17243 (2025)

    work page arXiv 2025

  8. [8]

    Shor, Fault-tolerant quantum computation, inPro- ceedings of 37th Conference on Foundations of Computer Science(1996) pp

    P. Shor, Fault-tolerant quantum computation, inPro- ceedings of 37th Conference on Foundations of Computer Science(1996) pp. 56–65

    work page 1996

  9. [9]

    Fault-Tolerant Postselected Quantum Computation: Schemes

    E. Knill, Fault-tolerant postselected quantum computa- tion: Schemes (2004), arXiv:quant-ph/0402171 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  10. [10]

    Bartolucci, P

    S. Bartolucci, P. Birchall, H. Bomb´ ın, H. Cable, C. Daw- son, M. Gimeno-Segovia, E. Johnston, K. Kieling, N. Nickerson, M. Pant, F. Pastawski, T. Rudolph, and C. Sparrow, Fusion-based quantum computation, Nature Communications14, 912 (2023)

    work page 2023

  11. [11]

    Universal quantum computation with ideal clifford gates and noisy ancillas

    S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal clifford gates and noisy ancillas, Physical Review A71, 10.1103/physreva.71.022316 (2005)

    work page doi:10.1103/physreva.71.022316 2005

  12. [12]

    Pocklington and A

    S. Bravyi and J. Haah, Magic-state distillation with low overhead, Physical Review A86, 10.1103/phys- reva.86.052329 (2012)

    work page doi:10.1103/phys- 2012

  13. [13]

    S. C. Smith, B. J. Brown, and S. D. Bartlett, Mitigating errors in logical qubits, Communications Physics7, 386 (2024)

    work page 2024

  14. [14]

    Bomb´ ın, M

    H. Bomb´ ın, M. Pant, S. Roberts, and K. I. Seetharam, Fault-tolerant postselection for low-overhead magic state preparation, PRX Quantum5, 010302 (2024)

    work page 2024

  15. [15]

    L. H. English, D. J. Williamson, and S. D. Bartlett, Thresholds for post-selected quantum error correc- tion from statistical mechanics (2024), arXiv:2410.07598 [quant-ph]

    work page arXiv 2024

  16. [16]

    Gidney, M

    C. Gidney, M. Newman, P. Brooks, and C. Jones, Yoked surface codes, Nature Communications16, 4498 (2025)

    work page 2025

  17. [17]

    Dennis, A

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics43, 4452–4505 (2002)

    work page 2002

  18. [18]

    C. T. Chubb and S. T. Flammia, Statistical mechanical models for quantum codes with correlated noise, Annales de l’Institut Henri Poincar´ e D, Combinatorics, Physics and their Interactions8, 269–321 (2021)

    work page 2021

  19. [19]

    Bombin, R

    H. Bombin, R. S. Andrist, M. Ohzeki, H. G. Katzgraber, and M. A. Martin-Delgado, Strong resilience of topo- logical codes to depolarization, Phys. Rev. X2, 021004 (2012)

    work page 2012

  20. [20]

    C. Wang, J. Harrington, and J. Preskill, Confinement- higgs transition in a disordered gauge theory and the ac- curacy threshold for quantum memory, Annals of Physics 303, 31–58 (2003)

    work page 2003

  21. [21]

    H. G. Katzgraber, H. Bombin, and M. A. Martin- Delgado, Error threshold for color codes and random three-body ising models, Physical Review Letters103, 10.1103/physrevlett.103.090501 (2009)

    work page doi:10.1103/physrevlett.103.090501 2009

  22. [22]

    W. Wu, S. Shivam, and A. Chan, Many-body quantum chaos and time reversal symmetry (2025), arXiv:2503.23475 [cond-mat.stat-mech]

    work page arXiv 2025

  23. [23]

    S. S. Varadhan, Large deviations, inProceedings of the International Congress of Mathematicians 2010 (ICM

    work page 2010

  24. [24]

    I: Plenary Lectures and Cer- emonies Vols

    (In 4 Volumes) Vol. I: Plenary Lectures and Cer- emonies Vols. II–IV: Invited Lectures(World Scientific,

    work page

  25. [25]

    D. A. Huse and C. L. Henley, Pinning and roughening of domain walls in ising systems due to random impurities, Phys. Rev. Lett.54, 2708 (1985)

    work page 1985

  26. [26]

    See Supplemental Material for details on the TEBD method for computing the RBIM partition function, the efficiency of code splitting, postselection in general sta- bilizer codes, additional verifications of large-deviation scaling, and the toric code with partially heralded errors

    work page

  27. [27]

    Fishman, S

    M. Fishman, S. R. White, and E. M. Stoudenmire, The ITensor Software Library for Tensor Network Calcula- tions, SciPost Phys. Codebases , 4 (2022)

    work page 2022

  28. [28]

    Fishman, S

    M. Fishman, S. R. White, and E. M. Stoudenmire, Code- base release 0.3 for ITensor, SciPost Phys. Codebases , 4 (2022)

    work page 2022

  29. [29]

    Carmona and Y

    P. Carmona and Y. Hu, Fluctuation exponents and large deviations for directed polymers in a random environ- ment, Stochastic processes and their applications112, 285 (2004)

    work page 2004

  30. [30]

    Carmona, Directed polymer in random environment and last passage percolation, ESAIM: Probability and Statistics14, 263 (2010)

    P. Carmona, Directed polymer in random environment and last passage percolation, ESAIM: Probability and Statistics14, 263 (2010)

    work page 2010

  31. [31]

    Janjigian, Large deviations of the free energy in the o’connell–yor polymer, Journal of Statistical Physics 160, 1054 (2015)

    C. Janjigian, Large deviations of the free energy in the o’connell–yor polymer, Journal of Statistical Physics 160, 1054 (2015)

    work page 2015

  32. [32]

    C. A. Tracy and H. Widom, The distributions of ran- dom matrix theory and their applications, inNew Trends in Mathematical Physics: Selected contributions of the XVth International Congress on Mathematical Physics (Springer, 2009) pp. 753–765

    work page 2009

  33. [33]

    Splitting a toric code in three pieces requires one to be able to move and reassemble qubits, which is feasible in architectures like neutral atoms

    work page

  34. [34]

    G. M. Sommers, D. A. Huse, and M. J. Gullans, Dy- namically generated concatenated codes and their phase diagrams, Phys. Rev. Res.7, 023086 (2025)

    work page 2025

  35. [35]

    Tillich and G

    J.-P. Tillich and G. Z´ emor, Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory60, 1193 (2013)

    work page 2013

  36. [36]

    Panteleev and G

    P. Panteleev and G. Kalachev, Asymptotically good quantum and locally testable classical ldpc codes, inPro- ceedings of the 54th annual ACM SIGACT symposium on theory of computing(2022) pp. 375–388

    work page 2022

  37. [37]

    S.-H. Lee, L. English, and S. D. Bartlett, Efficient post-selection for general quantum ldpc codes (2025), arXiv:2510.05795 [quant-ph]

    work page arXiv 2025

  38. [38]

    Nelson, G

    J. Nelson, G. Bentsen, S. T. Flammia, and M. J. Gullans, Fault-tolerant quantum memory using low-depth random circuit codes, Phys. Rev. Res.7, 013040 (2025)

    work page 2025

  39. [39]

    Farrelly, N

    T. Farrelly, N. Milicevic, R. J. Harris, N. A. McMahon, and T. M. Stace, Parallel decoding of multiple logical qubits in tensor-network codes, Phys. Rev. A105, 052446 (2022)

    work page 2022

  40. [40]

    Hutter, J

    A. Hutter, J. R. Wootton, and D. Loss, Efficient markov chain monte carlo algorithm for the surface code, Phys. Rev. A89, 022326 (2014)

    work page 2014

  41. [41]

    Gidney, Stim: a fast stabilizer circuit simulator, Quan- 7 tum5, 497 (2021)

    C. Gidney, Stim: a fast stabilizer circuit simulator, Quan- 7 tum5, 497 (2021)

    work page 2021

  42. [42]

    Higgott, PyMatching: A Python Package for De- coding Quantum Codes with Minimum-Weight Perfect Matching, ACM Transactions on Quantum Computing 3, 16:1 (2022)

    O. Higgott, PyMatching: A Python Package for De- coding Quantum Codes with Minimum-Weight Perfect Matching, ACM Transactions on Quantum Computing 3, 16:1 (2022)

    work page 2022

  43. [43]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Optimal resources for topological two-dimensional stabilizer codes: Com- parative study, Phys. Rev. A76, 012305 (2007)

    work page 2007

  44. [44]

    Horsman, A

    D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics14, 123011 (2012)

    work page 2012

  45. [45]

    P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A52, R2493 (1995)

    work page 1995

  46. [46]

    S. A. Yadavalli and I. Marvian, Noisy quantum trees: infinite protection without correction, npj Quantum In- formation11, 151 (2025), arXiv:2306.14294

    work page arXiv 2025

  47. [47]

    T. M. Stace, S. D. Barrett, and A. C. Doherty, Thresholds for topological codes in the presence of loss, Phys. Rev. Lett.102, 200501 (2009)

    work page 2009

  48. [48]

    Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Era- sure conversion for fault-tolerant quantum computing in alkaline earth rydberg atom arrays, Nature Communica- tions13, 10.1038/s41467-022-32094-6 (2022)

    work page doi:10.1038/s41467-022-32094-6 2022

  49. [49]

    Chang, S

    K. Chang, S. Singh, J. Claes, K. Sahay, J. Teoh, and S. Puri, Surface code with imperfect erasure checks (2024), arXiv:2408.00842 [quant-ph]

    work page arXiv 2024

  50. [50]

    Picco, A

    M. Picco, A. Honecker, and P. Pujol, Strong disorder fixed points in the two-dimensional random-bond ising model, Journal of Statistical Mechanics: Theory and Ex- periment2006, P09006–P09006 (2006)

    work page 2006

  51. [51]

    Critical exponents for two-dimensional percolation

    S. Smirnov and W. Werner, Critical exponents for two- dimensional percolation (2001), arXiv:math/0109120 [math.PR]. 1 Supplemental Materials: Scalable accuracy gains from postselection in quantum error correcting codes Hongkun Chen,1 Daohong Xu,1 Grace M. Sommers, 2 David A. Huse,2 Jeff D. Thompson,1 and Sarang Gopalakrishnan1 1Department of Electrical an...

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  52. [52]

    codes suppresses logical errors as p(2) f (d/ √ 2)≃e − √ 2I(0)d ≪e −I(0)d ≃p f(d).(S17) Because √ 2 is irrational, it is not feasible to directly simulate both distance-dand distance-(d/ √

    work page

  53. [53]

    Instead, we comparedp f(2n),p (2) f (n), andp (4) f (n), and observed numerically thatp (4) f (n) decays exponentially faster inn

    codes. Instead, we comparedp f(2n),p (2) f (n), andp (4) f (n), and observed numerically thatp (4) f (n) decays exponentially faster inn. We now provide the mathematical explanation. Selecting the maximal|∆F i|among four distance-npatches gives p(4) f (n)≃exp{−min s≥0 [4I(s) +s]d}.(S18) SinceI(s) +s=I(−s) impliesI ′(0) =−1/2, convexity guarantees that 4I(...

    work page

  54. [54]

    withε e ∈ {0,1}revealed to the decoder

    The agreement with the un-heralded (r e = 0) case confirms that all RBIMs on the Nishimori line belong to the same universality class, except for the pointr e = 1, which is unstable towards partially heralding. withε e ∈ {0,1}revealed to the decoder. Conditional onε e = 0, the effective flip probability is peff = p(1−r e) 1−pr e , K e = 1 2 log 1−peff pef...

    work page