Skip to content
Preprint

Multistage Rewinding Decoder for QLDPC Codes

Aug 2026 · 0 citations · 43 references
Physics Computer Science Mathematics

TL;DR

The proposed multistage decoding framework targets the failure dynamics caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers, which are among the primary limitations of iterative decoding for QLDPC codes.

Abstract

In this paper, we propose a multistage decoding framework that leverages internal information produced by an underlying message-passing decoder. The proposed method targets the failure dynamics caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers, which are among the primary limitations of iterative decoding for QLDPC codes. To identify unreliable variable nodes, we introduce a heuristic metric that combines several dynamical features of the decoder, including variable-node log likelihood reliabilities, hard-decision oscillations, the number of adjacent unsatisfied checks, and the soft information contributed by unsatisfied checks. Based on this ranking metric, the decoder performs guided rewinds by selectively forcing the initial log likelihood ratio values of the most suspicious variable nodes and restarting the message-passing decoder under the corresponding forced configuration. To manage the combinatorial growth of candidate configurations, the search is formulated within a beam- search framework with controlled beam width. In addition, we introduce a pruning metric based on the combination of the residual syndrome weight and a posteriori reliability of the decoder output, thereby retaining only the most promising search paths. Logical error rate results demonstrate that the proposed decoder significantly outperforms the normalized min- sum decoder and achieves competitive performance with belief propagation enhanced by order-10 ordered statistics decoding.

View source

Similar papers

Reinforcement-Learning-Guided Multi-Branch Decoding of Quantum LDPC Codes

This work proposes RL-MBOSD, a reinforcement-learning-guided multi-branch decoder for QLDPC codes, which gives lower error-rate point estimates than the re-plotted prior baselines.

V. Nourozi, T. Koike-Akino, David G. M. Mitchell · 1 citation
2026

Free-Ride BCH Codes for Fine-Grained Rate Adaptation: Construction, Decoding, and Analysis

In this paper, we propose free-ride BCH (FR-BCH) codes to enable fine-grained rate adaptation on conventional BCH codes. At the transmitter, a small number of extra bits are superimposed onto the BCH codeword via random or structured superpositions. At the receiver, all candidate extra-bit patterns are enumerated by a...

Qian-Fan Wang, Yi-Wen Wang, Ji-Fan Liang et al. · 0 citations
Preprint Aug 2026

A Highly Accurate Fast Decoding Framework for QLDPC codes Accelerated by Noise Perturbation and Ensemble Decoding

A well-balanced decoder has been central to the development of modern fault-tolerant quantum computing. However, the inherent topologies of quantum error correcting codes can limit the performance of many well-studied decoding algorithms. In this work, we introduce Noise Assisted Ensemble Decoding (NAED), a highly accu...

Mainak Bhattacharyya, Ankur Raina · 0 citations
Open access 2026

Gaussian-Elimination-Free BP-OSD Algorithm for Short 5G LDPC Codes

Simulation results demonstrate that the proposed GE-free BP-LCGCD significantly outperforms standard BP, achieves FER closely approaching that of GE-based BP-OSD, and approaches the finite-length bound across multiple code rates for 5G LDPC codes, while requiring a significantly smaller number of re-encodings and elimi...

Qian-Fan Wang, Yi-Wen Wang, Jia-Yi Yang et al. · 1 citation
Preprint Sep 2026

Capacity Achieving Torn Paper Codes

The construction depends on choosing a series of random linear codes, and it is shown that for any $\varepsilon>0$, there exists a choice of such codes which attains rate of at least $\varepsilon$ below the capacity, with high probability as the block length goes to infinity.

Jun-Sheng Liu, Netanel Raviv · 1 citation
Preprint Aug 2026

Trapping Sets of Detector Error Models

Message-passing decoders are among the most promising candidates for scalable quantum error correction, yet their behavior in the low-error-rate regime remains poorly understood under realistic circuit-level noise. In this work, we introduce a systematic framework for identifying the graph structures that govern decode...

Michele Pacenti, Nithin Raveendran, Bane V. Vasic · 3 citations

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