|| Trapping Set Analysis of Finite-Length Quantum LDPC Codes
||Nithin Raveendran, Bane Vasic, University of Arizona, United States|
||D4-S1-T4: Decoding Quantum Error Correcting Codes
||Thursday, 15 July, 22:00 - 22:20
||Thursday, 15 July, 22:20 - 22:40
Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are impacted by short cycles, detrimental graphical configurations known as trapping sets (TSs) present in a code graph as well as symmetric degeneracy of errors. In this paper, we develop a systematic methodology by which quantum trapping sets (QTSs) can be defined and categorized according to their topological structure. Conventional definition of a TS from classical error correction is generalized to address the syndrome decoding scenario for QLDPC codes. We show that QTS information can be used to design better QLDPC code and decoder. For certain finite-length QLDPC codes, frame error rate improvements of two orders of magnitude in the error floor regime are demonstrated without needing any post-processing steps.