Proves that minimum-weight decoding of 2D TTI stabilizer codes admits a PTAS by reducing the problem to Euclidean geometric approximation tasks such as TSP when errors are modeled as point-like excitations connected by strings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A polynomial-time approximation scheme for minimum-weight decoding of topological codes
Proves that minimum-weight decoding of 2D TTI stabilizer codes admits a PTAS by reducing the problem to Euclidean geometric approximation tasks such as TSP when errors are modeled as point-like excitations connected by strings.