Informed Dynamic Scheduling for QLDPC Codes

Abstract

Recent research has shown that syndrome-based belief propagation using layered scheduling (sLBP) can not only accelerate the convergence rate but also improve the error rate performance by breaking the quantum trapping sets for quantum low-density parity-check (QLDPC) codes, showcasing a result distinct from classical error correction codes. In this paper, we consider edge-wise informed dynamic scheduling (IDS) for QLDPC codes based on syndrome-based residual belief propagation (sRBP). However, the construction of QLDPC codes and the identical prior intrinsic information assignment will result in an equal residual in many edges, causing a performance limitation for sRBP. Two heuristic strategies, including edge pool design and error pre-correction, are introduced to tackle this obstacle and quantum trapping sets. Then, a novel sRBP equipped with a predict-and-reduce-error mechanism (PRE-sRBP) is proposed, which can provide over one order of performance gain on the considered bicycle codes and symmetric hypergraph (HP) code under similar iterations compared to sLBP.

19 pages, 14 figures

References in corpus (8)

• High-threshold and low-overhead fault-tolerant quantum memory
• Quantum Low-Density Parity-Check Codes
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• Decoding Across the Quantum LDPC Code Landscape
• Constant-overhead quantum error correction with thin planar connectivity
• Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
• Log-domain decoding of quantum LDPC codes over binary finite fields
• Belief-Propagation Decoding of LDPC Codes with Variable Node-Centric Dynamic Schedules