Trapping Set Analysis of Finite-Length Quantum LDPC Codes
Trapping Set Analysis of Finite-Length Quantum LDPC Codes
复制标题
有限长度量子 LDPC 码的陷阱集分析
DOI：
10.1109/isit45174.2021.9518154
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Vasic, Bane
中科院分区：
文献类型：
--
作者：
Raveendran, Nithin;Vasic, Bane
有限长度量子低密度奇偶校验（QLDPC）码的迭代译码器受到短周期、码图中存在的被称为捕获集（TS）的有害图形配置以及错误的对称简并的影响。在本文中，我们开发了一个系统的方法，量子陷阱集（QTS）可以定义和分类，根据它们的拓扑结构。传统的定义TS从经典的错误校正一般化，以解决的伴随式解码的情况下，QLDPC码。我们表明，QTS信息可以用来设计更好的QLDPC码和译码器。对于某些有限长度的QLDPC码，两个数量级的错误平层制度的帧错误率的改善，而不需要任何后处理步骤。
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.