{"id":"hexagon/2611.00371","pdf":"https://hexagonmath.org/pdf/2611.00371v1","url":"https://hexagonmath.org/abs/2611.00371v1","tags":["cs.IT","math-ph","math.ST","msc:81P73","msc:94B35","msc:82B44","msc:62F25","msc:68V20"],"score":0,"title":"Certified lower bounds on the optimal-decoding threshold of the surface code","domain":"quant-ph","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"quant-ph","summary":"Under independent bit flips, rigorous lower bounds on the threshold of the surface code from earlier work stay below $0.04$, while numerical estimates place the optimal threshold near $0.109$. By counting labelled failure paths with exact transfer-matrix certificates, we prove without sampling that every minimum-weight decoder has threshold at least $0.0465$ on the planar and rotated codes. We then give statistical certificates that, with confidence $1-10^{-9}$ each, the optimal threshold of the planar code is at least $0.103$ under bit flips and at least $0.02$ under phenomenological noise.…","category":"research","comments":0,"disputed":false,"division":"physics","mentions":0,"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}