Hardness of Decoding Quantum Stabilizer Codes
From MaRDI portal
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.
Cited in
(10)- Quasi-cyclic constructions of asymmetric quantum error-correcting codes
- A family of Hermitian dual-containing constacyclic codes and related quantum codes
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
- scientific article; zbMATH DE number 5568625 (Why is no real title available?)
- Analyticity of the energy in an Ising spin glass with correlated disorder
- Syndrome decoding by quantum approximate optimization
- Introduction to quantum error correction with stabilizer codes
- On the maximum-likelihood decoding problem
- Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes
- Improved belief propagation decoding algorithm based on decoupling representation of Pauli operators for quantum stabilizer codes
This page was built for publication: Hardness of Decoding Quantum Stabilizer Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977318)
