Hardness of Decoding Quantum Stabilizer Codes
Authors:
- 28 April 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (9) , 5209-5223
Abstract
In this paper, 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 are appropriate 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 consider error degeneracy, which causes distinct errors to have the same effect on the code. Here, we show that optimal decoding of stabilizer codes (previously known to be NP-hard) is in fact computationally much harder than optimal decoding of classical linear codes, it is #P-complete.Keywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada
- Lockheed Martin Corporation
This publication has 27 references indexed in Scilit:
- Thermalization, Error Correction, and Memory Lifetime for Ising Anyon SystemsPhysical Review X, 2014
- 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
- A class of quantum LDPC codes: construction and performances under iterative decoding2007
- Degenerate Quantum Codes for Pauli ChannelsPhysical Review Letters, 2007
- Fault-tolerant quantum computation by anyonsAnnals of Physics, 2003
- Quantum error detection .II. BoundsIEEE Transactions on Information Theory, 2000
- The generalized distributive lawIEEE Transactions on Information Theory, 2000
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995