Hardness of decoding quantum stabilizer codes
Preprint
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.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Local Topological Order Inhibits Thermal Stability in 2DPhysical Review Letters, 2013
- Quantum circuits for measuring Levin-Wen operatorsPhysical Review B, 2012
- Logical-operator tradeoff for local quantum codesPhysical Review A, 2012
- NP-hardness of decoding quantum error-correction codesPhysical Review A, 2011
- Fast Decoders for Topological Quantum CodesPhysical Review Letters, 2010
- Optimal and efficient decoding of concatenated quantum block codesPhysical Review A, 2006
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memoryAnnals of Physics, 2003
- Fault-tolerant quantum computation by anyonsAnnals of Physics, 2003
- Projective Plane and Planar Quantum CodesFoundations of Computational Mathematics, 2001
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995