View PDF HTML (experimental)

Abstract: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.

Submission history

From: Mohsen Moradi [view email]
[v1] Thu, 18 Jun 2026 20:38:03 UTC (240 KB)