Hardness of decoding quantum stabilizer codes
arXiv:1310.3235
Abstract
In this article we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the decoding problem consists of determining the most likely recovery given the syndrome. The corresponding classical problem is known to be NP-complete, and a similar decoding problem for quantum codes is also known to be NP-complete. However, this decoding strategy is not optimal in the quantum setting as it does not take into account error degeneracy, which causes distinct errors to have the same effect on the code. Here, we show that optimal decoding of stabilizer codes is computationally much harder than optimal decoding of classical linear codes, it is #P.
References in corpus (10)
- Fault-tolerant quantum computation by anyons
- Quantum Error Correction and Orthogonal Geometry
- Sparse Graph Codes for Quantum Error-Correction
- Fast Decoders for Topological Quantum Codes
- Nishimori point in the 2D +/- J random-bond Ising model
- NP-hardness of decoding quantum error-correction codes
- Local topological order inhibits thermal stability in 2D
- Quantum Circuits for Measuring Levin-Wen Operators
- On the Hardnesses of Several Quantum Decoding Problems
- Hardness of approximating the weight enumerator of a binary linear code