.png){kind=icon}
.png){kind=icon}
Return
Collective Bit Flipping-Based Decoding of Quantum LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2025.3535897.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 must cope with the stringent latency constraints imposed by quantum technology and tends to exhibit 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 ( $d_{v}$ -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. Then, we propose a decoding approach that stems from the knowledge of harmful configurations apparent in these codes. Our decoding scheme is based on applying a modified version of bit flipping (BF) decoding, namely two-bit bit flipping (TBF) decoding, which adds more degrees of freedom to BF decoding. The granularity offered by TBF decoding helps us design sets of decoders that operate in parallel and can collectively decode error patterns appearing in harmful configurations of the code, thus addressing both the latency and performance requirements. Finally, simulation results demonstrate that the proposed decoding scheme surpasses other iterative decoding approaches for various $d_{v}$ -3 QLDPC codes.
Keywords:
QLDPC codes
bit flipping decoding
hypergraph-product codes
symmetric stabilizers
trapping sets
error-floor
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W