Quantum Annealing with Post-processing of Maximum Likelihood for LDPC Decoding
Yuhang Guo, Han Zeng, Feng Xiong +3 more
In the forthcoming 6G era, driven by the escalating demands for enhanced performance and reliability in communication systems, Low-Density Parity-Check (LDPC) codes emerge as a robust error correction coding scheme poised to effectively meet these requirements. In recent years, with the advancement of quantum computing, a proposal has emerged to integrate classical and quantum computing for the decoding of LDPC. The LDPC decoding can be treated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, thereby allowing the utilization of the D-Wave 2000Q quantum annealer for solving it. Expanding on this groundwork, the paper proposes an approach to enhance quantum annealing performance using classical algorithms. Specifically, it involves performing quantum annealing on the problem first, followed by post-processed using Maximum Likelihood Estimation (MLE) for the multiple outputs, known as QAML. Furthermore, to fully exploit the advantages of quantum annealing, this paper incorporates the energy and frequency of occurrence of candidate codewords as prior information into the Maximum Likelihood Estimation. These are called QAMLE and QAMLF respectively, further enhancing decoding performance. The proposed method is evaluated and compared with direct Quantum Annealing (QA) and Quantum Annealing with post-processing using Minimum Distance (QAMD). Research findings indicate that QAML exhibits a lower bit error rate compared to QA and QAMD.
Information Communication Technologies Conference (ICTC)•May 10, 2024•1 citation