Collective Bit Flipping-Based Decoding of Quantum LDPC Codes

Understand

Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes.

• However, this family of codes imposes stringent latency requirements and poor performance under iterative decoding, especially when the variable degree is low.
• In this work, we improve both the error correction performance and decoding latency of variable degree-3 (dv-3) QLDPC codes under iterative decoding.
• Firstly, we perform a detailed analysis of the structure of a well-known family of QLDPC codes, i.e., hypergraph product-based codes.