Staying Sober: A Shot-Free Predictor of Logical Error Rates for Concatenated Quantum Error Correcting Codes
Abstract
Estimating the logical error rate (LER) of a quantum error-correcting (QEC) code by Monte Carlo sampling takes O(p−⌈ d/2 ⌉/ε2) samples at physical error rate p, code distance d and relative error ε, which becomes intractable at large distances and low error rates, and especially for concatenated codes, whose distance grows as dℓ with the number of levels ℓ. The fail fast method reduces this cost by sampling the failures of each weight separately, but it only works for unconcatenated codes, and does not model the soft information that the levels of a concatenated code pass to each other. We propose a predictor that takes the stabilizers, the minimum-weight logical operators and, for odd d, the logical operators of weight d + 1 of a code, and computes, without sampling, the leading monomial c po of the LER when expressed as a polynomial in p, at every level of concatenation, in time polynomial in the code parameters and linear in ℓ for fixed budgets. We prove that our prediction is exact for any unconcatenated stabilizer code, for every logical observable and arbitrary per-qubit error rates, whenever no budget is exhausted. Furthermore, for concatenated codes, we construct a recursive approach that computes the leading monomial exactly in exponential time, and our predictor approximates this approach. Our predictions match exact enumeration at level 1 on every code we evaluate, and up to three levels for the iceberg code. Using our predictor, we evaluate and compare $37$ code configurations under four noise biases in $48$ core-hours, where Monte Carlo sampling would need more than 1012 shots at p = 10−3 for $113$ of these $148$ cases.
Related
- High-Rate Concatenated Quantum Error-Correcting Codes for Qudits
- Self-testing of logical subspaces of quantum error-correcting codes
- From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes
- Learning to Decode Concatenated Quantum Codes with Hierarchical Message Passing
- One generation of the Standard Model as a quantum error-correcting code
BibTeX
@misc{sethi2026staying,
title = {{Staying Sober: A Shot-Free Predictor of Logical Error Rates for Concatenated Quantum Error Correcting Codes}},
author = {Sayam Sethi and Aditi Awasthi and Maxwell Poster and Joshua Viszlai and Jonathan Mark Baker},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.06606},
eprint = {2610.06606},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.06606},
}
RIS
TY - UNPB
TI - Staying Sober: A Shot-Free Predictor of Logical Error Rates for Concatenated Quantum Error Correcting Codes
AU - Sayam Sethi
AU - Aditi Awasthi
AU - Maxwell Poster
AU - Joshua Viszlai
AU - Jonathan Mark Baker
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.06606
UR - https://arxiv.org/abs/2610.06606
AB - Estimating the logical error rate (LER) of a quantum error-correcting (QEC) code by Monte Carlo sampling takes O(p^−⌈ d/2 ⌉/ε^2) samples at physical error rate p, code distance d and relative error ε, which becomes intractable at large distances and low error rates, and especially for concatenated codes, whose distance grows as d^ℓ with the number of levels ℓ. The fail fast method reduces this cost by sampling the failures of each weight separately, but it only works for unconcatenated codes, and does not model the soft information that the levels of a concatenated code pass to each other. We propose a predictor that takes the stabilizers, the minimum-weight logical operators and, for odd d, the logical operators of weight d + 1 of a code, and computes, without sampling, the leading monomial c p^o of the LER when expressed as a polynomial in p, at every level of concatenation, in time polynomial in the code parameters and linear in ℓ for fixed budgets. We prove that our prediction is exact for any unconcatenated stabilizer code, for every logical observable and arbitrary per-qubit error rates, whenever no budget is exhausted. Furthermore, for concatenated codes, we construct a recursive approach that computes the leading monomial exactly in exponential time, and our predictor approximates this approach. Our predictions match exact enumeration at level 1 on every code we evaluate, and up to three levels for the iceberg code. Using our predictor, we evaluate and compare $37$ code configurations under four noise biases in $48$ core-hours, where Monte Carlo sampling would need more than 10^12 shots at p = 10^−3 for $113$ of these $148$ cases.
ER -