English

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

Quantum Physics 2026-04-29 v3 Statistical Mechanics

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 pth0.107(3)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(pth)+H(p~th)1H(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 pth0.11p_{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.

Keywords

Cite

@article{arxiv.2512.22888,
  title  = {Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions},
  author = {Giovanni Canossa and Lode Pollet and Miguel A. Martin-Delgado and Hao Song and Ke Liu},
  journal= {arXiv preprint arXiv:2512.22888},
  year   = {2026}
}

Comments

12 pages, 5 figures, 2 tables