pith. machine review for the scientific record. sign in

arxiv: 2512.22888 · v3 · submitted 2025-12-28 · 🪐 quant-ph · cond-mat.stat-mech

Recognition: 2 theorem links

· Lean Theorem

Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions

Giovanni Canossa , Lode Pollet , Miguel A. Martin-Delgado , Hao Song , Ke Liu
Authors on Pith no claims yet

Pith reviewed 2026-05-16 19:38 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.stat-mech
keywords fracton codescheckerboard codecode capacity thresholdquantum error correctionPauli noisestatistical mechanics mappingMonte Carlo simulationstopological codes
0
0 comments X

The pith

The checkerboard fracton code reaches a code-capacity threshold of 0.107 against Pauli noise, the highest known for three-dimensional topological codes and close to the theoretical limit.

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

The paper establishes that self-dual fracton codes, particularly the checkerboard code, maintain reliable error correction up to an error rate of roughly 10.7 percent under stochastic Pauli noise. This threshold exceeds those of other known three-dimensional codes and comes close to the upper bound that any topological code can achieve. The authors reach this result by mapping the quantum threshold problem onto a classical statistical mechanics model and solving it with large-scale parallel-tempering Monte Carlo simulations. The same mapping also confirms a duality relation between thresholds of dual codes and implies that Haah's code has a comparable threshold near 0.11.

Core claim

Utilizing a statistical-mechanical mapping combined with large-scale parallel tempering Monte Carlo simulations, the optimal code capacity of the checkerboard code is calculated to be p_th ≃ 0.107(3). This value is the highest among known three-dimensional codes and nearly saturates the theoretical limit for topological codes. The findings validate the generalized entropy relation for two mutually dual models, H(p_th) + H(tilde p_th) ≈ 1, and indicate that Haah's code also possesses a code capacity near the theoretical limit p_th ≈ 0.11.

What carries the argument

Statistical-mechanical mapping of the quantum error-correction threshold for self-dual fracton codes to a classical spin model, where the phase-transition point determines the code-capacity threshold.

If this is right

  • Checkerboard fracton codes tolerate higher Pauli error rates than any previously analyzed three-dimensional topological code.
  • The generalized entropy relation H(p_th) + H(tilde p_th) ≈ 1 applies to fracton models as well as standard topological codes.
  • Haah's code is expected to exhibit a code-capacity threshold near 0.11.
  • Fracton codes qualify as highly resilient quantum memories suitable for three-dimensional fault-tolerant architectures.

Where Pith is reading between the lines

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

  • Other three-dimensional topological codes may also approach the same performance ceiling once their thresholds are computed via duality mappings.
  • The near-saturation result implies that the dimensional penalty for topological codes is smaller for fracton models than for conventional stabilizer codes.
  • Direct simulation of the quantum circuit under the same noise model could test whether the classical mapping remains accurate for correlated or non-Pauli errors.

Load-bearing premise

The mapping from the quantum error-correction problem to the classical statistical model exactly locates the threshold without missing quantum effects or suffering from uncontrolled finite-size artifacts.

What would settle it

Monte Carlo simulations performed on substantially larger lattices or with independent equilibration checks that yield a threshold value lying more than 0.005 away from 0.107 would falsify the reported number.

Figures

Figures reproduced from arXiv: 2512.22888 by Giovanni Canossa, Hao Song, Ke Liu, Lode Pollet, Miguel A. Martin-Delgado.

Figure 1
Figure 1. Figure 1: Illustration of the checkerboard code and its excitations. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of the statistical mapping from the checker [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Energy histograms at the transition temperature for a rep [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Disorder-averaged energy histograms (top row) and correlation lengths (bottom row) at di [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: (a) Illustration of the stabilizer structure of the Haah’s code. [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
read the original abstract

Fracton codes have been intensively studied as novel topological states of matter, yet their fault-tolerant properties remain largely unexplored. Here, we investigate the optimal thresholds of self-dual fracton codes, in particular the checkerboard code, against stochastic Pauli noise. By utilizing a statistical-mechanical mapping combined with large-scale parallel tempering Monte Carlo simulations, we calculate the optimal code capacity of the checkerboard code to be $p_{th} \simeq 0.107(3)$. This value is the highest among known three-dimensional codes and nearly saturates the theoretical limit for topological codes. Our results further validate the generalized entropy relation for two mutually dual models, $H(p_{th}) + H(\tilde{p}_{th}) \approx 1$, and extend its applicability beyond standard topological codes. This verification indicates the Haah's code also possesses a code capacity near the theoretical limit $p_{th} \approx 0.11$. These findings highlight fracton codes as highly resilient quantum memory and demonstrate the utility of duality techniques in analyzing intricate quantum error-correcting codes.

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 manuscript investigates the code-capacity thresholds of self-dual fracton codes, particularly the checkerboard code, under stochastic Pauli noise. It employs a statistical-mechanical mapping of the decoding problem to a three-dimensional disordered Ising-like model, solved via large-scale parallel-tempering Monte Carlo simulations, to obtain an optimal threshold p_th ≃ 0.107(3). This is claimed to be the highest among known three-dimensional codes and to nearly saturate the theoretical limit for topological codes. The work also validates the generalized entropy relation H(p_th) + H(p̃_th) ≈ 1 for mutually dual models and suggests that Haah's code similarly approaches the limit p_th ≈ 0.11.

Significance. If the central numerical result holds, the paper establishes fracton codes as among the most resilient known three-dimensional quantum memories, with thresholds close to the theoretical maximum for topological codes. The validation of the entropy duality relation extends a useful analytical tool beyond standard topological codes, and the combination of exact mapping with large-scale numerics provides a concrete method for analyzing complex fracton models. These findings would strengthen the case for fracton-based quantum error correction in realistic noise settings.

major comments (1)
  1. [Abstract and Monte Carlo results section] Abstract and the section presenting the Monte Carlo results: the central claim p_th ≃ 0.107(3) is load-bearing for the assertions of highest threshold and near-saturation of the code-capacity limit. The manuscript reports large-scale parallel-tempering runs but provides no explicit finite-size scaling collapses, Binder-cumulant crossings versus linear size L, or autocorrelation-time diagnostics. In three-dimensional disordered systems these diagnostics are required to confirm that the extracted transition lies in the thermodynamic limit and is free of equilibration or finite-size biases comparable to the quoted uncertainty of 0.003.
minor comments (1)
  1. [Entropy relation discussion] The precise definition of the dual threshold p̃_th and the entropy function H should be restated explicitly when the generalized relation is introduced, to avoid ambiguity for readers unfamiliar with the duality mapping.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of our manuscript and for the constructive suggestion to strengthen the Monte Carlo analysis. We address the major comment below and have revised the manuscript to incorporate the requested diagnostics.

read point-by-point responses

  1. Referee: [Abstract and Monte Carlo results section] Abstract and the section presenting the Monte Carlo results: the central claim p_th ≃ 0.107(3) is load-bearing for the assertions of highest threshold and near-saturation of the code-capacity limit. The manuscript reports large-scale parallel-tempering runs but provides no explicit finite-size scaling collapses, Binder-cumulant crossings versus linear size L, or autocorrelation-time diagnostics. In three-dimensional disordered systems these diagnostics are required to confirm that the extracted transition lies in the thermodynamic limit and is free of equilibration or finite-size biases comparable to the quoted uncertainty of 0.003.

    Authors: We agree that explicit finite-size scaling collapses, Binder-cumulant crossings, and autocorrelation-time diagnostics are important for rigorously establishing the thermodynamic limit in three-dimensional disordered systems. In the revised manuscript we have added Binder-cumulant crossings versus linear size L, which intersect at a consistent point supporting p_th ≃ 0.107(3). We have also included finite-size scaling collapses of the order parameter that demonstrate good data collapse at the reported threshold. In addition, we now report measured autocorrelation times from the parallel-tempering runs; these remain much shorter than the total simulation lengths across the system sizes studied, confirming adequate equilibration. These new figures and accompanying text directly address the concern that finite-size or equilibration biases could affect the quoted uncertainty of 0.003. revision: yes

Circularity Check

0 steps flagged

No significant circularity: threshold obtained from independent Monte Carlo sampling of mapped model

full rationale

The central numerical result p_th ≃ 0.107(3) is computed via a statistical-mechanical mapping of the decoding problem to a 3D disordered Ising-like model, followed by parallel-tempering Monte Carlo simulations. This constitutes an independent numerical determination rather than a reduction to the paper's own inputs by construction. The generalized entropy relation H(p_th) + H(p̃_th) ≈ 1 is reported as a post-hoc validation, not an input used to derive the threshold value. No self-definitional equations, fitted-input predictions, load-bearing self-citations that replace external verification, or ansatzes smuggled via prior work are present in the derivation chain. The result remains falsifiable against external benchmarks and does not rename a known empirical pattern as a new derivation.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central numerical claim rests on the validity of the statistical-mechanical mapping from quantum error correction to a classical model and on the assumption that Monte Carlo sampling accurately locates the phase transition point.

free parameters (1)
  • p_th
    The threshold is located numerically from the location of the phase transition in the mapped model.
axioms (1)
  • domain assumption The decoding problem for the checkerboard fracton code under Pauli noise maps exactly onto a classical statistical mechanics model whose phase transition corresponds to the code capacity threshold.
    This mapping is invoked to justify the use of Monte Carlo simulations for threshold calculation.

pith-pipeline@v0.9.0 · 5503 in / 1257 out tokens · 36357 ms · 2026-05-16T19:38:00.045575+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.

Reference graph

Works this paper leans on

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

  1. [1]

    Under this construc- tion, the partition function of the original and dual lattice are related by the Normal Factor Graph (NFG) Duality theorem

    work page

  2. [2]

    MADQuantumCM

    which, in this context, represents a generalized version of the Kramers-Wannier Duality [49, 50]: Z{u±(K)}=2 a ˜Z{u∗ ±(K)}(7) whereais some appropriate factor. It follows that the prod- uctZ{u ±(K1)} ˜Z{u∗ ±(K2)}is invariant under the simultaneous transformationsu ±(K1)⇌u ∗ ±(K2),u ±(K2)⇌u ∗ ±(K1): the transition pointsK 1,K 2 of the two models are then g...

    work page 2026

  3. [3]

    Data availability

    The project/research is part of the Munich Quantum Valley, which is supported by the Bavarian state government with funds from the Hightech Agenda Bayern Plus. Data availability. The Monte Carlo simulation data sup- porting the findings of this study are available in the repository indicated in Ref. [64]

    work page

  4. [4]

    P. W. Shor, Fault-tolerant quantum computation, inProceed- ings of the 37th Annual Symposium on F oundations of Com- puter Science (FOCS)(IEEE, 1996) pp. 56–65, arXiv:quant- ph/9605011

    work page arXiv 1996

  5. [5]

    Knill and R

    E. Knill and R. Laflamme, Theory of quantum error-correcting codes, Phys. Rev. A55, 900 (1997)

    work page 1997

  6. [6]

    Gottesman, Theory of fault-tolerant quantum computation, Phys

    D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A57, 127 (1998)

    work page 1998

  7. [7]

    Dennis, A

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys.43, 4452 (2002)

    work page 2002

  8. [8]

    Acharya, D

    R. Acharya, D. A. Abanin, L. Aghababaie-Beni, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute, K. Arya, A. Asfaw, N. Astrakhantsev, J. Atalaya, R. Babbush, D. Bacon, B. Ballard, J. C. Bardin, J. Bausch, A. Bengtsson, A. Bilmes, S. Black- well, S. Boixo, G. Bortoli, A. Bourassa, J. Bovaird, L. Brill, M. Broughton, D. A. Browne, B. Buchea, B. B. Buckley, D...

    work page 2025

  9. [9]

    T. He, W. Lin, R. Wang, Y . Li, J. Bei, J. Cai, S. Cao, D. Chen, K. Chen, X. Chen, Z. Chen, Z. Chen, Z. Chen, W. Chu, H. Deng, X. Ding, Z. Ding, B. Fan, D. Fan, Y . Fu, D. Gao, M. Gong, J. Gui, C. Guo, S. Guo, L. Han, L. Hong, Y . Hu, H.-L. Huang, Y .-H. Huo, C. Jiang, L. Jiang, T. Jiang, Z. Jiang, H. Jin, D. Li, D. Li, J. Li, J. Li, J. Li, J. Li, N. Li, ...

    work page 2025

  10. [10]

    S. A. Moses, C. H. Baldwin, M. S. Allman, R. Ancona, L. Ascarrunz, C. Barnes, J. Bartolotta, B. Bjork, P. Blanchard, M. Bohn, J. G. Bohnet, N. C. Brown, N. Q. Burdick, W. C. Burton, S. L. Campbell, J. P. Campora, C. Carron, J. Chambers, J. W. Chan, Y . H. Chen, A. Chernoguzov, E. Chertkov, J. Col- ina, J. P. Curtis, R. Daniel, M. DeCross, D. Deen, C. Dela...

    work page 2023

  11. [11]

    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, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V . Vuleti ´c, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature626, 58 (2024)

    work page 2024

  12. [12]

    Panteleev and G

    P. Panteleev and G. Kalachev, Asymptotically good quantum and locally testable classical ldpc codes (2022)

    work page 2022

  13. [13]

    Bravyi and R

    S. Bravyi and R. König, Classification of topologically pro- tected gates for local stabilizer codes, Phys. Rev. Lett.110, 170503 (2013)

    work page 2013

  14. [14]

    Pastawski and B

    F. Pastawski and B. Yoshida, Fault-tolerant logical gates in quantum error-correcting codes, Phys. Rev. A91, 012305 (2015)

    work page 2015

  15. [15]

    Campbell, B

    E. Campbell, B. Terhal, and C. Vuillot, Roads towards fault- tolerant universal quantum computation, Nature , 172 (2017)

    work page 2017

  16. [16]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Phys. Rev. Lett.97, 180501 (2006)

    work page 2006

  17. [17]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Topological computa- tion without braiding, Phys. Rev. Lett.98, 160502 (2007)

    work page 2007

  18. [18]

    B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys.87, 307 (2015)

    work page 2015

  19. [19]

    B. J. Brown, D. Loss, J. K. Pachos, C. N. Self, and J. R. Woot- ton, Quantum memories at finite temperature, Rev. Mod. Phys. 88, 045005 (2016)

    work page 2016

  20. [20]

    N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum2, 040101 (2021)

    work page 2021

  21. [21]

    T. Ohno, G. Arakawa, I. Ichinose, and T. Matsui, Phase struc- ture of the random-plaquette gauge model: accuracy threshold for a toric quantum memory, Nucl. Phys. B.697, 462 (2004)

    work page 2004

  22. [22]

    Bombin, R

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

    work page 2012

  23. [23]

    Kubica, M

    A. Kubica, M. E. Beverland, F. Brandão, J. Preskill, and K. M. Svore, Three-dimensional color code thresholds via statistical- mechanical mapping, Phys. Rev. Lett.120, 180501 (2018)

    work page 2018

  24. [24]

    C. T. Chubb and S. T. Flammia, Statistical mechanical mod- els for quantum codes with correlated noise, Ann. Inst. Henri Poincaré Comb. Phys.8, 269 (2021)

    work page 2021

  25. [25]

    H. Song, J. Schönmeier-Kromer, K. Liu, O. Viyuela, L. Pol- let, and M. A. Martin-Delgado, Optimal thresholds for fracton codes and random spin models with subsystem symmetry, Phys. Rev. Lett.129, 230502 (2022)

    work page 2022

  26. [26]

    Haah, Local stabilizer codes in three dimensions without string logical operators, Phys

    J. Haah, Local stabilizer codes in three dimensions without string logical operators, Phys. Rev. A83, 042330 (2011)

    work page 2011

  27. [27]

    Vijay, J

    S. Vijay, J. Haah, and L. Fu, Fracton topological order, general- ized lattice gauge theory, and duality, Phys. Rev. B94, 235157 (2016)

    work page 2016

  28. [28]

    Vijay, J

    S. Vijay, J. Haah, and L. Fu, A new kind of topological quan- tum order: A dimensional hierarchy of quasiparticles built from stationary excitations, Phys. Rev. B92, 235136 (2015)

    work page 2015

  29. [29]

    Bravyi and J

    S. Bravyi and J. Haah, Quantum self-correction in the 3d cubic 12 code model, Phys. Rev. Lett.111, 200501 (2013)

    work page 2013

  30. [30]

    Chamon, Quantum glassiness in strongly correlated clean systems: An example of topological overprotection, Phys

    C. Chamon, Quantum glassiness in strongly correlated clean systems: An example of topological overprotection, Phys. Rev. Lett.94, 040402 (2005)

    work page 2005

  31. [31]

    Yoshida, Exotic topological order in fractal spin liquids, Phys

    B. Yoshida, Exotic topological order in fractal spin liquids, Phys. Rev. B88, 125122 (2013)

    work page 2013

  32. [32]

    H. Ma, E. Lake, X. Chen, and M. Hermele, Fracton topological order via coupled layers, Phys. Rev. B95, 245126 (2017)

    work page 2017

  33. [33]

    R. M. Nandkishore and M. Hermele, Fractons, Annu. Rev. Con- dens. Matter Phys.10, 295 (2019)

    work page 2019

  34. [34]

    H. Song, A. Prem, S.-J. Huang, and M. A. Martin-Delgado, Twisted fracton models in three dimensions, Phys. Rev. B99, 155118 (2019)

    work page 2019

  35. [35]

    Wen, Systematic construction of gapped nonliquid states, Phys

    X.-G. Wen, Systematic construction of gapped nonliquid states, Phys. Rev. Res.2, 033300 (2020)

    work page 2020

  36. [36]

    Aasen, D

    D. Aasen, D. Bulmash, A. Prem, K. Slagle, and D. J. Williamson, Topological defect networks for fractons of all types, Phys. Rev. Res.2, 043165 (2020)

    work page 2020

  37. [37]

    Pretko, X

    M. Pretko, X. Chen, and Y . You, Fracton phases of matter, Int. J. Mod. Phys. A35, 2030003 (2020)

    work page 2020

  38. [38]

    Zhou, M.-Y

    C. Zhou, M.-Y . Li, Z. Yan, P. Ye, and Z. Y . Meng, Evolution of dynamical signature in the x-cube fracton topological order, Phys. Rev. Res.4, 033111 (2022)

    work page 2022

  39. [39]

    H. Song, N. Tantivasadakarn, W. Shirley, and M. Hermele, Fracton self-statistics, Phys. Rev. Lett.132, 016604 (2024)

    work page 2024

  40. [40]

    H. G. Katzgraber, H. Bombin, and M. A. Martin-Delgado, Error threshold for color codes and random three-body ising models, Phys. Rev. Lett.103, 090501 (2009)

    work page 2009

  41. [41]

    Ozeki and N

    Y . Ozeki and N. Ito, Multicritical dynamics for the±j ising model, Journal of Physics A: Mathematical and General31, 5451 (1998)

    work page 1998

  42. [42]

    Gottesman,Stabilizer codes and quantum error correction (California Institute of Technology, 1997)

    D. Gottesman,Stabilizer codes and quantum error correction (California Institute of Technology, 1997)

    work page 1997

  43. [43]

    Nishimori, Duality in finite-dimensional spin glasses, J

    H. Nishimori, Duality in finite-dimensional spin glasses, J. Stat. Phys.126, 977 (2007)

    work page 2007

  44. [44]

    C. Wang, J. Harrington, and J. Preskill, Confinement-Higgs transition in a disordered gauge theory and the accuracy thresh- old for quantum memory, Ann. Phys.303, 31 (2003)

    work page 2003

  45. [45]

    J.-Z. Xu, Y . Zhong, M. A. Martin-Delgado, H. Song, and K. Liu, Phenomenological noise models and optimal thresholds of the 3d toric code, arXiv preprint arXiv:2510.20489 (2025)

    work page arXiv 2025

  46. [46]

    Aharonov and M

    D. Aharonov and M. Ben-Or, Fault-tolerant quantum com- putation with constant error rate, SICOMP38, 1207 (2008), https://doi.org/10.1137/S0097539799359385

    work page doi:10.1137/s0097539799359385 2008

  47. [47]

    Le Doussal and A

    P. Le Doussal and A. B. Harris,ϵexpansion for the nishimori multicritical point of spin glasses, Phys. Rev. B40, 9249 (1989)

    work page 1989

  48. [48]

    Iba, The nishimori line and bayesian statistics, J

    Y . Iba, The nishimori line and bayesian statistics, J. Phys. A32, 3875 (1999)

    work page 1999

  49. [49]

    Takeda, T

    K. Takeda, T. Sasamoto, and H. Nishimori, Exact location of the multicritical point for finite-dimensional spin glasses: a conjec- ture, J. Phys. A38, 3751 (2005)

    work page 2005

  50. [50]

    F. J. Wegner, Duality in Generalized Ising Models and Phase Transitions without Local Order Parameters, J. Math. Phys.12, 2259 (1971)

    work page 1971

  51. [51]

    G. D. Forney and P. O. V ontobel, Partition functions of normal factor graphs, ArXivabs/1102.0316(2011)

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  52. [52]

    H. A. Kramers and G. H. Wannier, Statistics of the two- dimensional ferromagnet. part i, Phys. Rev.60, 252 (1941)

    work page 1941

  53. [53]

    Savit, Duality in field theory and statistical systems, Rev

    R. Savit, Duality in field theory and statistical systems, Rev. Mod. Phys.52, 453 (1980)

    work page 1980

  54. [54]

    Nishimori and G

    H. Nishimori and G. Ortiz, inElements of Phase Transitions and Critical Phenomena(Oxford University Press, 2010)

    work page 2010

  55. [55]

    Hinczewski and A

    M. Hinczewski and A. N. Berker, Multicritical point relations in three dual pairs of hierarchical-lattice ising spin glasses, Phys. Rev. B72, 144402 (2005)

    work page 2005

  56. [56]

    Hasenbusch, F

    M. Hasenbusch, F. P. Toldin, A. Pelissetto, and E. Vicari, Magnetic-glassy multicritical behavior of the three-dimensional ±jising model, Phys. Rev. B76, 184202 (2007)

    work page 2007

  57. [57]

    Ohzeki, Locations of multicritical points for spin glasses on regular lattices, Phys

    M. Ohzeki, Locations of multicritical points for spin glasses on regular lattices, Phys. Rev. E79, 021129 (2009)

    work page 2009

  58. [58]

    Gattringer, D

    C. Gattringer, D. Göschl, and C. Marchis, Kramers–wannier du- ality and worldline representation for the su(2) principal chiral model, Phys. Lett. B778, 435 (2018)

    work page 2018

  59. [59]

    Canossa, L

    G. Canossa, L. Pollet, M. A. Martin-Delgado, H. Song, and K. Liu, Exotic symmetry breaking properties of self-dual frac- ton spin models, Phys. Rev. Res.6, 013304 (2024)

    work page 2024

  60. [60]

    H. G. Katzgraber, S. Trebst, D. A. Huse, and M. Troyer, Feedback-optimized parallel tempering monte carlo, J. Stat. Mech.: Theory Exp.2006(03), P03018

    work page 2006

  61. [61]

    Janke, Monte carlo methods in classical statistical physics, inComputational Many-Particle Physics, edited by H

    W. Janke, Monte carlo methods in classical statistical physics, inComputational Many-Particle Physics, edited by H. Fehske, R. Schneider, and A. Weiße (Springer Berlin Heidelberg, Berlin, Heidelberg, 2008) pp. 79–140

    work page 2008

  62. [62]

    Linux cluster,https://www.lrz.de/en/service-center/ alle-lrz-services/high-performance-computing/ linux-cluster, accessed: 01.09.2025

    work page 2025

  63. [63]

    Canossa, L

    G. Canossa, L. Pollet, and K. Liu, Hybrid symmetry breaking in classical spin models with subsystem symmetries, Phys. Rev. B107, 054431 (2023)

    work page 2023

  64. [64]

    Haah, Commuting pauli hamiltonians as maps between free modules, Commun

    J. Haah, Commuting pauli hamiltonians as maps between free modules, Commun. Math. Phys.324, 351 (2013)

    work page 2013

  65. [65]

    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)

    work page 2024

  66. [66]

    K. Chen, Y . Liu, Y . Zhang, Z. Liang, Y .-A. Chen, K. Liu, and H. Song, Anyon theory and topological frustration of high- efficiency quantum low-density parity-check codes, Phys. Rev. Lett.135, 076603 (2025)

    work page 2025

  67. [67]

    optimal threshold for fracton codes and nearly saturated code capacity in three dimensions

    G. Canossa, Data for "optimal threshold for fracton codes and nearly saturated code capacity in three dimensions", 10.5281/zenodo.18075327 (2025)

    work page doi:10.5281/zenodo.18075327 2025