Metraipolis › archive › dc_e1d033abecdd

Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes — arXiv:2611.03128

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.03128
License (as archived): CC0-1.0
Archived: 2026-11-03T11:39:26.337Z
SHA-256 of the archived text: 7eb2ab6556b4c2cce14ac89f5013115115e3b2f59709615437ec1223d05e8be3
Stable URL of this page: https://metraipolis.com/documento/dc_e1d033abecdd

How to cite

Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes — arXiv:2611.03128 — arXiv (en), https://arxiv.org/abs/2611.03128 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e1d033abecdd (Metraipolis archive dc_e1d033abecdd, sha256 7eb2ab6556b4c2cce14ac89f5013115115e3b2f59709615437ec1223d05e8be3)

BibTeX

@misc{dce1d033abecdd,
  title = {Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes — arXiv:2611.03128},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03128},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e1d033abecdd; sha256 7eb2ab6556b4c2cce14ac89f5013115115e3b2f59709615437ec1223d05e8be3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03128. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In quantum error correction, the decoder must estimate the errors from the measurement data accurately and fast enough to avoid a backlog. Search-based decoders such as Tesseract achieve high accuracy by finding a minimum-weight set of error events with an A* search, but their search effort grows rapidly with the physical error rate and the code size. To reduce this search effort while maintaining a logical error rate close to that of Tesseract, we propose a belief propagation (BP)-guided modification of the Tesseract decoder for quantum low-density parity-check (LDPC) codes. Damped sum-product BP is applied to the triggered detectors before the Tesseract search. If the detectors triggered by the BP hard decision match the triggered detectors, this hard decision is accepted directly, and the Tesseract search is skipped. Otherwise, the BP marginal probability estimates, weighted by a trust coefficient, modify the search priority, while the path cost keeps the channel-prior weights so that the decoding objective is unchanged. The framework also supports BP-based initialization, in which selected BP decisions form the starting point of a residual search whose signed-cost objective allows incorrect initial decisions to be removed. A node-exploration limit bounds this residual search; if the limit is reached, the decoder falls back to the BP-guided search on the original triggered detector set. The method is evaluated on the [[72,12,6]], [[90,8,10]], and [[144,12,12]] bivariate bicycle codes under circuit-level noise. With BP-based initialization and a global trust coefficient, the number of Tesseract search nodes expanded is reduced by up to more than two orders of magnitude at low physical error rates, while the logical error rate remains close to that of Tesseract.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.03128 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:37.220Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).