Hardness of Decoding Quantum Stabilizer Codes
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811 · cited 2×
“There are problems to which any witness or certificate for a solution can be verified in polynomial time.”
BackgroundStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Optimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105 · cited 2×
“However, when a qubit of the code is encoded into an auxiliary code, the the optimal decoder on this concatenated code will replace the physical noise rates for the qubit with the logical noise rates (logical class probabilities) of the auxiliary code [14].”
BackgroundMethodSelf-citationNP-hardness of decoding quantum error-correction codes
Hsieh, M.-H., & Le Gall, F. (2011) · Physical Review A · doi:10.1103/physreva.83.052331 · Cited by 71
Cited by
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Higgott, O. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505637 · Cited by 181
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Decoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
A small quantum computer is needed to optimize fault-tolerant protocols
Iyer, P., & Poulin, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab73c · Cited by 34
Self-citationGeneral tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Color code decoder with improved scaling for correcting circuit-level noise
Lee, S.-H., Li, A., & Bartlett, S. D. (2025) · Quantum · doi:10.22331/q-2025-01-27-1609 · Cited by 16
“Ideal decoding using maximum likelihood is generally known to be #P-complete [36], thus alternative decoders that are less precise but more efficient are necessary for practical quantum computing.”
Spacetime codes of Clifford circuits
Delfosse, N., & Paetznick, A. (2023) · arXiv · doi:10.48550/arxiv.2304.05943 · Cited by 10
“Indeed, the maximum likelihood decoding problem is NP-hard for linear codes [3] and #P-hard for stabilizer codes [18].”
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
Metadata
- Authors
- Iyer, P., & Poulin, D.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2015-09
- Volume
- 61
- Issue
- 9
- Pages
- 5209-5223
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2094848842
- Cited by
- 83
- References
- 6
- FWCI
- 0.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.