Wiley eBooks
Quantum Low‐density Parity Check Codes
Zunaira Babar, Daryus Chandra, Soon Xin Ng, Lajos Hanzo
Abstract
The design of quantum low-density parity check (QLDPC) codes is discussed, with a special emphasis on their structural properties and iterative decoding techniques. We review diverse QLDPC code construction methods, including Calderbank–Shor–Steane (CSS), non-CSS, and entanglement-assisted variants. The chapter highlights the associated key design challenges, such as the presence of unavoidable length-4 cycles and their impact on decoding performance. Furthermore, a formalism is conceived for constructing high-rate row-circulant QLDPC codes from classical LDPC matrices. Additionally, an attractive nonbinary decoding algorithm is proposed for homogeneous CSS-type QLDPC codes to mitigate the effects of short cycles. The chapter also details a weighted belief propagation algorithm, which is a heuristic method of improving decoding over graphs exhibiting cycles. The limitations of the existing QLDPC designs in approaching the quantum Hashing bound are discussed, and the need for degenerate decoding strategies is emphasized.