Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices

Abstract

Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. In this work, we first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices. Then, we extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders. Numerical simulation results demonstrate that both approaches as well as their combination yield a low-latency, high-performance decoder for several short to moderate length QLDPC codes.

arXiv admin note: text overlap with arXiv:2212.10245

References in corpus (13)

• Anyons in an exactly solved model and beyond
• Topological quantum memory
• Deep Learning Methods for Improved Decoding of Linear Codes
• Sparse Graph Codes for Quantum Error-Correction
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• Decoding Across the Quantum LDPC Code Landscape
• Balanced Product Quantum Codes
• Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
• Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation
• Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
• Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
• Modified belief propagation decoders for quantum low-density parity-check codes
• Log-domain decoding of quantum LDPC codes over binary finite fields