This is the authors' abstract. We don't add key points for this paper.
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 threshold of the checkerboard code to be <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"> <a:mrow> <a:msub> <a:mi>p</a:mi> <a:mtext>th</a:mtext> </a:msub> <a:mo>≃</a:mo> <a:mn>0.107</a:mn> <a:mrow> <a:mo>(</a:mo> <a:mn>3</a:mn> <a:mo>)</a:mo> </a:mrow> </a:mrow> </a:math> . 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, <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"> <b:mrow> <b:mi>H</b:mi> <b:mrow> <b:mo>(</b:mo> <b:msub> <b:mi>p</b:mi> <b:mtext>th</b:mtext> </b:msub> <b:mo>)</b:mo> </b:mrow> <b:mo>+</b:mo> <b:mi>H</b:mi> <b:mrow> <b:mo>(</b:mo> <b:msub> <b:mover accent="true"> <b:mi>p</b:mi> <b:mo>̃</b:mo> </b:mover> <b:mtext>th</b:mtext> </b:msub> <b:mo>)</b:mo> </b:mrow> <b:mo>≈</b:mo> <b:mn>1</b:mn> </b:mrow> </b:math> , and extend its applicability beyond standard topological codes. This verification indicates the Haah's code also possesses a code-capacity threshold near the theoretical limit <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"> <d:mrow> <d:msub> <d:mi>p</d:mi> <d:mtext>th</d:mtext> </d:msub> <d:mo>≈</d:mo> <d:mn>0.11</d:mn> </d:mrow> </d:math> . These findings highlight fracton codes as highly resilient quantum memory and demonstrate the utility of duality techniques in analyzing intricate error-correcting codes.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
A 2026 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: