Optimal Threshold for Fracton Codes and Nearly Saturated Code Capacity in Three Dimensions
Giovanni Canossa, Lode Pollet, Miguel A. Martin-Delgado, Hao Song, Ke Liu
TL;DR
The paper addresses the problem of determining fault-tolerance thresholds for 3D fracton codes, with a focus on self-dual codes like the checkerboard code. It adopts a statistical-mechanical mapping to a disordered spin model along the Nishimori line and uses large-scale parallel-tempering simulations, complemented by duality arguments, to extract the optimal code-capacity threshold. The checkerboard code is found to have a threshold $p_{th} \simeq 0.108(2)$, near the theoretical limit of about $0.11$, and the duality relation $H(p_{th}) + H(\tilde{p}_{th}) \approx 1$ is validated for fracton codes; Haah's code is conjectured to share the near-limit threshold as well. The work demonstrates fracton codes as highly resilient quantum memories, provides a practical benchmark for decoders, and shows that generalized duality can substantially reduce computational effort in threshold studies.
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.108(2)$. 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.
