Preprint
Aug 2026
Hardness of approximation for minimum-weight decoding of two-dimensional topological quantum codes
Efficient decoding is essential for the practical realization of fault-tolerant quantum computers. We study the computational complexity of minimum-weight decoding for topological quantum codes. For surface codes under the depolarizing channel, we consider Minimum-Weight decoding, which seeks a minimum-weight Pauli err...
L. Bazzi, G. Khater
· 1 citation