Temporal Degeneracy Limits Message Passing Decoding of QLDPC Codes Under Repeated Noisy Syndrome Measurements
Abstract
Practical quantum computations can require logical error rates of 10−12 or lower. Quantum low-density parity-check (QLDPC) codes are promising candidates for reaching such rates with low qubit overhead, provided that their syndromes can be decoded efficiently. Repeated noisy syndrome measurements introduce temporal degeneracy into the space-time decoding graph. We characterize the temporal kernel, whose vectors have zero total data parity, and show that it is generated by elementary temporal codewords of weight dv+2, where dv is the variable-node degree. For (dv,dc)-regular parity-check matrices with fixed degrees dv,dc>2 and girth greater than four, we derive counting bounds and construct degenerate error patterns of weight (dv+2)/2 for even dv and dv+1 for odd dv, with multiplicity Θ(nr) in the blocklength n and number of measurement rounds r. Under the isolation assumption, these patterns cause local failures of deterministic isotropic message-passing decoders under a flooding schedule. These failures depend on the node degrees rather than the minimum distance; for the bivariate bicycle (BB) codes considered, their weight is equal to four. Monte carlo simulations and fixed-weight importance sampling quantify harmful low-weight degenerate error patterns for the min-sum (MS) decoder beyond the isolation assumption. Motivated by the identified symmetries, we propose space-time anisotropic min-sum decoding with syndrome-guided realizations. Its complexity is linear in the number of Tanner graph edges for fixed maximum number of iterations and number of decoders. Numerical results on BB codes show threshold-like behavior acrossthe tested code sizes and improved failure probabilities relative to MS decoding with ordered statistics decoding post-processing.
Related
- Difference-based variance estimators with repeated measurements
- Generalized Deep Regression for Repeated Measurements
- When Repeated Measurements Hurt Tabular Foundation Models
- The Value of Duplicate Measurements When Decoding Second-Order Reed-Muller Codes
- Quantum simultaneous decoding via pretty-good measurements of tilted states
BibTeX
@misc{chytas2026temporal,
title = {{Temporal Degeneracy Limits Message Passing Decoding of QLDPC Codes Under Repeated Noisy Syndrome Measurements}},
author = {Dimitris Chytas and Nithin Raveendran and Bane Vasić},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.31877},
eprint = {2610.31877},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.31877},
}
RIS
TY - UNPB
TI - Temporal Degeneracy Limits Message Passing Decoding of QLDPC Codes Under Repeated Noisy Syndrome Measurements
AU - Dimitris Chytas
AU - Nithin Raveendran
AU - Bane Vasić
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.31877
UR - https://arxiv.org/abs/2610.31877
AB - Practical quantum computations can require logical error rates of 10^−12 or lower. Quantum low-density parity-check (QLDPC) codes are promising candidates for reaching such rates with low qubit overhead, provided that their syndromes can be decoded efficiently. Repeated noisy syndrome measurements introduce temporal degeneracy into the space-time decoding graph. We characterize the temporal kernel, whose vectors have zero total data parity, and show that it is generated by elementary temporal codewords of weight d_v+2, where d_v is the variable-node degree. For (d_v,d_c)-regular parity-check matrices with fixed degrees d_v,d_c>2 and girth greater than four, we derive counting bounds and construct degenerate error patterns of weight (d_v+2)/2 for even d_v and d_v+1 for odd d_v, with multiplicity Θ(nr) in the blocklength n and number of measurement rounds r. Under the isolation assumption, these patterns cause local failures of deterministic isotropic message-passing decoders under a flooding schedule. These failures depend on the node degrees rather than the minimum distance; for the bivariate bicycle (BB) codes considered, their weight is equal to four. Monte carlo simulations and fixed-weight importance sampling quantify harmful low-weight degenerate error patterns for the min-sum (MS) decoder beyond the isolation assumption. Motivated by the identified symmetries, we propose space-time anisotropic min-sum decoding with syndrome-guided realizations. Its complexity is linear in the number of Tanner graph edges for fixed maximum number of iterations and number of decoders. Numerical results on BB codes show threshold-like behavior acrossthe tested code sizes and improved failure probabilities relative to MS decoding with ordered statistics decoding post-processing.
ER -