Skip to content
Preprint

Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes

Nov 2026 · 0 citations · 37 references
Physics Computer Science Mathematics

TL;DR

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.

Abstract

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.

View source

Similar papers

Preprint Nov 2026

PriorTilt: Decoding quantum LDPC codes with sparse perturbations of belief propagation priors

Although belief propagation (BP) is a widely adopted decoder for classical low-density parity-check (LDPC) codes, its accuracy is limited in the quantum setting. We introduce \PriorTilt{}, a variant of BP obtained by selectively perturbing a small fraction of its prior log-likelihood ratios using offsets determined by...

Min Ye, Nicolas Delfosse · 0 citations
Preprint Sep 2026

Adaptive decoding of quantum LDPC codes through decoder disagreement

Accurate decoding of quantum low-density parity-check (qLDPC) codes often relies on expensive post-processing search, although decoding difficulty varies strongly between syndromes. We find that the benefit of deeper post-processing search is highly concentrated in a small subset of decoding instances, and that these i...

Mai-Da Wang, P. Coveney · 0 citations
Preprint Oct 2026

Chromatic Block-Gibbs p-Bit Decoding of QLDPC Codes

A parallel decoder for quantum low-density parity-check codes based on probabilistic bits (p-bits), tunable stochastic binary units controlled by local fields, which establishes constraint-annealed p-bit dynamics as a competitive stochastic alternative for QLDPC decoding and motivate further study of hardware-native im...

Mert Gökduman, Cyril Guyot, Henry D. Pfister · 0 citations
Preprint Oct 2026

Certified Adaptive List Decoding for Error-Correcting Codes

This work casts decoding as a search over an absorbing-state discrete diffusion model, whose sequential commitment of coordinates turns generation into a tree, and runs a probability beam search over it, and builds a decoder that does both.

J. Hwang, Byung-Sun Won, Uiwon Hwang · 0 citations
Open access 2026

Consensus and Return Residual Belief Propagation for Low-Latency LDPC Decoding

We propose two new decoding algorithms for low-density parity-check (LDPC) codes. The Consensus and Return residual belief propagation (C&R-RBP) algorithm reduces the number of iterations required to achieve a target decoding error rate over an AWGN channel by exploiting the availability of updated information, thereby...

A. E. Feitosa, R. D. de Lamare · 1 citation
Preprint Oct 2026

Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation

We propose two new decoding algorithms for low-density parity-check (LDPC) codes. The Consensus and Return residual belief propagation (C&R-RBP) algorithm reduces the number of iterations required to achieve a target decoding error rate over an AWGN channel by exploiting the availability of updated information, thereby...

A. E. Feitosa, R. D. de Lamare · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.