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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A PTAS exists for minimum-weight decoding in the (6.6.6) planar colour code, enabling correction of errors up to (1-ε)d/2.
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.
-
Approximately Decoding the Colour Code
A PTAS exists for minimum-weight decoding in the (6.6.6) planar colour code, enabling correction of errors up to (1-ε)d/2.