Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.01068

Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes

Mohsen Moradi, Taejoon Kim, Remi A. Chou

quant-phcs.ITSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum low-density parity-check (QLDPC) codes are promising candidates for low-overhead fault-tolerant quantum computation, but their practical use requires fast, low-complexity, and reliable decoders. Belief propagation (BP) is attractive because of its local message-passing structure, yet standard flooding BP often suffers from convergence failures on QLDPC codes due to short cycles, degeneracy, and symmetric decoding trajectories. Learned sequential BP improves convergence by using a reinforcement-learning policy to choose variable-node update orders, but a single learned trajectory can still be sensitive to unfavorable local Pauli decisions. We propose a learned parallel bit-flipping sequential BP decoder with a new quaternary score combining syndrome gain, a quantized Pauli log-likelihood penalty, and Q-table lookahead at hypothetical post-flip states. Our decoder first runs learned sequential BP for a fixed number of iterations. If the syndrome is not satisfied, it constructs quaternary bit-flipping candidates, each corresponding to changing the current Pauli decision of one qubit. The selected candidates initialize independent learned sequential BP continuations from the same decoder state. Since these continuations are independent, they can be executed in parallel, so testing several candidates mainly increases parallel hardware resources rather than sequential decoding latency. Simulations on representative QLDPC codes over the depolarizing channel show that the proposed decoder improves the reliability of learned sequential BP while having a parallel low-latency structure.

AI Summary

The paper addresses convergence failures and decoding depth in belief-propagation (BP) decoding of CSS quantum LDPC codes under independent depolarizing noise. It extends reinforcement-learning-based sequential BP (RL-S), which uses an offline-trained Q-table to select variable-node update orders, with a one-shot branching stage. After an initial RL-S run, an unsatisfied syndrome triggers evaluation of single-qubit Pauli changes. Candidates are ranked using residual-syndrome reduction, a quantized local log-likelihood penalty, and Q-table values at hypothetical post-change states. The selected candidates initialize independent continuations from the saved BP state, with finite-magnitude message injection biasing each branch toward its selected change. Simulations use $K=25$ branches. With sufficient parallel hardware, the continuation depth is $T_{\rm br}$ rather than $K T_{\rm br}$, giving total depth $T_0+T_{\rm br}$, apart from candidate-selection and state-management overhead. Simulations on three finite-length codes report that depth 200 matches RL-S with a budget of 1000 on the $[[180,10,15\leq d\leq18]]$ A5 and $[[288,12,18]]$ bivariate bicycle codes. Reported block-error-rate reductions are approximately tenfold against BP, BPGD, and BP-OSD-0 for A5 at $p=0.04$, and greater than tenfold against BP and BPGD for the 288-qubit code at $p=0.05$. For the $[[144,12,12]]$ code, depth 20 matches RL-S at 100 and BP at 1000. The evidence is numerical; the latency argument assumes parallel branch resources rather than a measured hardware implementation. Detailed complexity analysis, hardware studies, and systematic score-parameter optimization are explicitly left for future work.

Little sign of AI-generated textIncrementalSmall numerics onlyMissing comparisonOverclaims

Error found: The reported decoding depths establish only an idealized parallel-stage comparison, not an end-to-end latency reduction including candidate selection and branch-management overhead. The A5 results describe T_0 and T_br as sequential updates although the algorithm uses iterations associated with VN sweeps, leaving the units of the claimed depth comparison ambiguous. The numerical experiments omit the number and values of the reliability-penalty thresholds needed to reproduce candidate selection.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes

Mohsen Moradi, Taejoon Kim, Remi A. Chou

Quantum low-density parity-check (QLDPC) codes are strong candidates for fault-tolerant quantum computation, but efficient decoding remains a major challenge due to short cycles, degeneracy, and the poor convergence of standard belief-propagation (BP) decoders. We propose a reinforcement learning-based list sequential (RL-LS) BP decoder for QLDPC codes by extending the reinforcement-learning-based sequential variable-node scheduling (RL-S) framework with list-based search. At each step, the learned policy selects the next variable node to update; the decoder then retains the ordinary RL-S trajectory while also exploring a competing branch obtained by softly biasing the post-update LLR pair toward the second-most likely Pauli symbol, recomputing the incident local BP messages, and setting the visited variable node to that second-best symbol. Candidate trajectories are ranked and pruned using our proposed cumulative path metric. The resulting decoder extends the learned decoder by combining the improved convergence of learned sequential scheduling with list exploration. Numerical results on representative QLDPC benchmark codes over the depolarizing channel show that our proposed method improves the decoding performance of the underlying decoder and compares favorably with existing BP-based decoding methods.

cs.ITCross-listedarXiv:2606.20926•Jun 22, 2026•3 citations

Learning to Decode Quantum LDPC Codes via Cluster-Based Sequential Belief Propagation

Mohsen Moradi, Taejoon Kim, Rémi A. Chou +1 more

Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is attractive due to its low complexity, but its performance is often limited by short cycles, degeneracy, and convergence failures. Recently, reinforcement-learning-based sequential variable-node (VN) scheduling (RL-S) was shown to improve BP decoding by learning state-dependent update orders. However, the VN-by-VN nature of that approach offers limited within-iteration parallelism, since only one VN is updated at a time. In this paper, we propose a cluster-based extension of RL-S for QLDPC codes. The VNs are partitioned into fixed clusters, and at each scheduling step the RL agent selects one cluster to update, after which all VNs in that cluster are updated in parallel using the same pre-update incoming messages. To keep the tabular state space practical for large cluster sizes, we introduce a permutation-invariant cluster state based on a normalized histogram of local mismatch weights, followed by quantization. This representation makes the number of cluster states depend on the quantization resolution rather than the cluster size. We also develop the corresponding cluster-level Markov decision process, reward function, and Q-learning update. Numerical results on representative QLDPC codes show that the proposed clustered learned scheduling preserves most of the error-rate benefit of VN-level learned sequential scheduling while substantially reducing the number of scheduling decisions per BP iteration, thereby providing an attractive latency-parallelism tradeoff.

cs.ITCross-listedarXiv:2607.20130•Jul 23, 2026•4 citations

Learning to Decode Quantum LDPC Codes Via Belief Propagation

Mohsen Moradi, Vahid Nourozi, Salman Habib +1 more

Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is appealing due to its low complexity, yet it often exhibits convergence issues due to quantum degeneracy and short cycles that exist in the Tanner graph. To overcome this challenge, this paper proposes a reinforcement-learning (RL) approach that learns (offline) how to decode QLDPC codes based on sequential decoding trajectories. The decoding is formulated as a Markov decision process with a local, syndrome-driven state representation of the underlying RL agent. To enable fast inference, critical for practical implementation, we incrementally update our RL-based QLDPC decoder using second-order neighborhoods that avoid global rescans. Simulation results on representative QLDPC codes demonstrate the superiority of the proposed RL-based QLDPC decoders in terms of performance and convergence speed when compared to flooding and random sequential schedules, while achieving performance competitive with state-of-the-art BP-based decoders at comparable complexity.

arXiv:2603.10192•Mar 10, 2026•9 citations

Low-Latency Belief-Propagation Decoding of Quantum LDPC Codes with Reinforcement-Learned Scheduling

Mohsen Moradi, Ghilas Aissou, Taejoon Kim +2 more

Belief propagation (BP) is attractive for quantum low-density parity-check (QLDPC) decoding because of its low complexity and low latency, but short cycles and degeneracy can limit its error-correction performance. Reinforcement-learned sequential scheduling (RL-S) substantially improves this performance by adapting the variable node (VN) update order, although Q-table storage and heap-based selection introduce additional overhead. We propose bucket RL-S (B-RL-S), which quantizes learned Q-values into integer priorities and schedules VN updates using dynamically maintained first-in, first-out buckets. Without retraining or changing the BP message updates, B-RL-S reduces policy storage and refreshes only priorities affected by local residual syndrome changes. A fixed number of priority levels enables constant-time VN selection and queue relocation. For the $[[288,12,18]]$ bivariate bicycle code over the depolarizing channel at $p=0.05$, B-RL-S with eight priority levels achieves approximately one fifth the block error rate (BLER) of flooding BP followed by order-10 ordered-statistics decoding. The respective caps are $1000$ sequential iterations for B-RL-S and $1000$ flooding iterations for the BP stage of the reference decoder. These results highlight strong error correction with inexpensive scheduling and no additional post-processing stage.

arXiv:2610.15857•Oct 11, 2026•1 citation

High-Performance Reinforcement-Learned BP Decoding of Quantum LDPC Codes

Mohsen Moradi, Vahid Nourozi, Taejoon Kim +2 more

Belief-propagation (BP) decoding is attractive for quantum low-density parity-check (QLDPC) codes because it uses local message passing on sparse Tanner graphs. However, conventional flooding BP often stalls due to stabilizer degeneracy and short cycles. Reinforcement-learning-based sequential variable-node scheduling (RL-S), which learns the update order offline, has shown that adaptive scheduling can improve BP convergence. In this paper, we extend this idea with a second-order local update decoder, RL-S2LU. The proposed decoder preserves BP locality and low complexity, while numerical results show significant error-correction gains over conventional BP and the considered BP-OSD-10 baseline.

arXiv:2607.24891•Jul 27, 2026•0 citations

Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders

Mohsen Moradi, Vahid Nourozi, Wei Tang +1 more

Quantum low-density parity-check (QLDPC) codes are promising for fault-tolerant quantum computing, but their decoding algorithms present significant hardware implementation challenges. Reinforcement-learned sequential belief propagation (RL-S) improves the error-correction performance of conventional belief propagation (BP) through adaptive variable-node scheduling. However, its heap-based priority management introduces substantial hardware overhead. This paper presents hardware implementations of BP, RL-S, and bucket-based reinforcement-learned BP (BRL-S) for the [[288,12,18]] bivariate bicycle QLDPC code. The BRL-S architectures employ quantized priorities and first-in, first-out (FIFO) buckets to simplify scheduling. Three configurations with two, four, and eight priority levels are evaluated. FPGA synthesis results demonstrate that BRL-S reduces lookup-table utilization by approximately 68--72% compared with RL-S. ASIC synthesis further shows reductions of 63--67% in area and 64--69% in estimated power consumption. These results demonstrate that bucket-based scheduling substantially improves the hardware efficiency of reinforcement-learned QLDPC decoders.

cs.ITCross-listedarXiv:2611.04179•Nov 4, 2026•0 citations
Quantum low-density parity-check (QLDPC) codes are promising candidates for low-overhead fault-tolerant quantum computation, but their practical use requires fast, low-complexity, and reliable decoders. Belief propagation (BP) is attractive because of its local message-passing structure, yet standard flooding BP often suffers from convergence failures on QLDPC codes due to short cycles, degeneracy, and symmetric decoding trajectories. Learned sequential BP improves convergence by using a reinforcement-learning policy to choose variable-node update orders, but a single learned trajectory can still be sensitive to unfavorable local Pauli decisions. We propose a learned parallel bit-flipping sequential BP decoder with a new quaternary score combining syndrome gain, a quantized Pauli log-likelihood penalty, and Q-table lookahead at hypothetical post-flip states. Our decoder first runs learned sequential BP for a fixed number of iterations. If the syndrome is not satisfied, it constructs quaternary bit-flipping candidates, each corresponding to changing the current Pauli decision of one qubit. The selected candidates initialize independent learned sequential BP continuations from the same decoder state. Since these continuations are independent, they can be executed in parallel, so testing several candidates mainly increases parallel hardware resources rather than sequential decoding latency. Simulations on representative QLDPC codes over the depolarizing channel show that the proposed decoder improves the reliability of learned sequential BP while having a parallel low-latency structure.
The paper addresses convergence failures and decoding depth in belief-propagation (BP) decoding of CSS quantum LDPC codes under independent depolarizing noise. It extends reinforcement-learning-based sequential BP (RL-S), which uses an offline-trained Q-table to select variable-node update orders, with a one-shot branching stage.
After an initial RL-S run, an unsatisfied syndrome triggers evaluation of single-qubit Pauli changes. Candidates are ranked using residual-syndrome reduction, a quantized local log-likelihood penalty, and Q-table values at hypothetical post-change states. The selected candidates initialize independent continuations from the saved BP state, with finite-magnitude message injection biasing each branch toward its selected change. Simulations use K=25K=25K=25 branches. With sufficient parallel hardware, the continuation depth is TbrT_{\rm br}Tbr​ rather than KTbrK T_{\rm br}KTbr​, giving total depth T0+TbrT_0+T_{\rm br}T0​+Tbr​, apart from candidate-selection and state-management overhead.
Simulations on three finite-length codes report that depth 200 matches RL-S with a budget of 1000 on the [[180,10,15≤d≤18]][[180,10,15\leq d\leq18]][[180,10,15≤d≤18]] A5 and [[288,12,18]][[288,12,18]][[288,12,18]] bivariate bicycle codes. Reported block-error-rate reductions are approximately tenfold against BP, BPGD, and BP-OSD-0 for A5 at p=0.04p=0.04p=0.04, and greater than tenfold against BP and BPGD for the 288-qubit code at p=0.05p=0.05p=0.05. For the [[144,12,12]][[144,12,12]][[144,12,12]] code, depth 20 matches RL-S at 100 and BP at 1000.
The evidence is numerical; the latency argument assumes parallel branch resources rather than a measured hardware implementation. Detailed complexity analysis, hardware studies, and systematic score-parameter optimization are explicitly left for future work.
Quantum low-density parity-check (QLDPC) codes are strong candidates for fault-tolerant quantum computation, but efficient decoding remains a major challenge due to short cycles, degeneracy, and the poor convergence of standard belief-propagation (BP) decoders. We propose a reinforcement learning-based list sequential (RL-LS) BP decoder for QLDPC codes by extending the reinforcement-learning-based sequential variable-node scheduling (RL-S) framework with list-based search. At each step, the learned policy selects the next variable node to update; the decoder then retains the ordinary RL-S trajectory while also exploring a competing branch obtained by softly biasing the post-update LLR pair toward the second-most likely Pauli symbol, recomputing the incident local BP messages, and setting the visited variable node to that second-best symbol. Candidate trajectories are ranked and pruned using our proposed cumulative path metric. The resulting decoder extends the learned decoder by combining the improved convergence of learned sequential scheduling with list exploration. Numerical results on representative QLDPC benchmark codes over the depolarizing channel show that our proposed method improves the decoding performance of the underlying decoder and compares favorably with existing BP-based decoding methods.
Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is attractive due to its low complexity, but its performance is often limited by short cycles, degeneracy, and convergence failures. Recently, reinforcement-learning-based sequential variable-node (VN) scheduling (RL-S) was shown to improve BP decoding by learning state-dependent update orders. However, the VN-by-VN nature of that approach offers limited within-iteration parallelism, since only one VN is updated at a time. In this paper, we propose a cluster-based extension of RL-S for QLDPC codes. The VNs are partitioned into fixed clusters, and at each scheduling step the RL agent selects one cluster to update, after which all VNs in that cluster are updated in parallel using the same pre-update incoming messages. To keep the tabular state space practical for large cluster sizes, we introduce a permutation-invariant cluster state based on a normalized histogram of local mismatch weights, followed by quantization. This representation makes the number of cluster states depend on the quantization resolution rather than the cluster size. We also develop the corresponding cluster-level Markov decision process, reward function, and Q-learning update. Numerical results on representative QLDPC codes show that the proposed clustered learned scheduling preserves most of the error-rate benefit of VN-level learned sequential scheduling while substantially reducing the number of scheduling decisions per BP iteration, thereby providing an attractive latency-parallelism tradeoff.
Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is appealing due to its low complexity, yet it often exhibits convergence issues due to quantum degeneracy and short cycles that exist in the Tanner graph. To overcome this challenge, this paper proposes a reinforcement-learning (RL) approach that learns (offline) how to decode QLDPC codes based on sequential decoding trajectories. The decoding is formulated as a Markov decision process with a local, syndrome-driven state representation of the underlying RL agent. To enable fast inference, critical for practical implementation, we incrementally update our RL-based QLDPC decoder using second-order neighborhoods that avoid global rescans. Simulation results on representative QLDPC codes demonstrate the superiority of the proposed RL-based QLDPC decoders in terms of performance and convergence speed when compared to flooding and random sequential schedules, while achieving performance competitive with state-of-the-art BP-based decoders at comparable complexity.
Belief propagation (BP) is attractive for quantum low-density parity-check (QLDPC) decoding because of its low complexity and low latency, but short cycles and degeneracy can limit its error-correction performance. Reinforcement-learned sequential scheduling (RL-S) substantially improves this performance by adapting the variable node (VN) update order, although Q-table storage and heap-based selection introduce additional overhead. We propose bucket RL-S (B-RL-S), which quantizes learned Q-values into integer priorities and schedules VN updates using dynamically maintained first-in, first-out buckets. Without retraining or changing the BP message updates, B-RL-S reduces policy storage and refreshes only priorities affected by local residual syndrome changes. A fixed number of priority levels enables constant-time VN selection and queue relocation. For the [[288,12,18]][[288,12,18]][[288,12,18]] bivariate bicycle code over the depolarizing channel at p=0.05p=0.05p=0.05, B-RL-S with eight priority levels achieves approximately one fifth the block error rate (BLER) of flooding BP followed by order-10 ordered-statistics decoding. The respective caps are 100010001000 sequential iterations for B-RL-S and 100010001000 flooding iterations for the BP stage of the reference decoder. These results highlight strong error correction with inexpensive scheduling and no additional post-processing stage.
Belief-propagation (BP) decoding is attractive for quantum low-density parity-check (QLDPC) codes because it uses local message passing on sparse Tanner graphs. However, conventional flooding BP often stalls due to stabilizer degeneracy and short cycles. Reinforcement-learning-based sequential variable-node scheduling (RL-S), which learns the update order offline, has shown that adaptive scheduling can improve BP convergence. In this paper, we extend this idea with a second-order local update decoder, RL-S2LU. The proposed decoder preserves BP locality and low complexity, while numerical results show significant error-correction gains over conventional BP and the considered BP-OSD-10 baseline.
Quantum low-density parity-check (QLDPC) codes are promising for fault-tolerant quantum computing, but their decoding algorithms present significant hardware implementation challenges. Reinforcement-learned sequential belief propagation (RL-S) improves the error-correction performance of conventional belief propagation (BP) through adaptive variable-node scheduling. However, its heap-based priority management introduces substantial hardware overhead. This paper presents hardware implementations of BP, RL-S, and bucket-based reinforcement-learned BP (BRL-S) for the [[288,12,18]] bivariate bicycle QLDPC code. The BRL-S architectures employ quantized priorities and first-in, first-out (FIFO) buckets to simplify scheduling. Three configurations with two, four, and eight priority levels are evaluated. FPGA synthesis results demonstrate that BRL-S reduces lookup-table utilization by approximately 68--72% compared with RL-S. ASIC synthesis further shows reductions of 63--67% in area and 64--69% in estimated power consumption. These results demonstrate that bucket-based scheduling substantially improves the hardware efficiency of reinforcement-learned QLDPC decoders.