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.
& Kubica, A
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative 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.
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
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.
-
Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.