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 Category: research Comments: 0 Disputed: false Division: physics Mentions: 0 Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00371 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.…