Problem
Research questions and friction points this paper is trying to address.
High-Rate
CSS Codes
QLDPC Codes
Tanner Graphs
High-Rate Quasi-Dyadic Quantum LDPC Codes
🤖 AI Summary
本文提出基于准二元矩阵设计高码率量子LDPC码，通过构造具有至少6围长的Tanner图，提高了代码在不同噪声模型下的逻辑错误率性能。
📝 Abstract
In this work, we propose a novel design of high-rate Calderbank--Shor--Steane (CSS) quantum low-density parity-check (QLDPC) codes based on quasi-dyadic matrices. The Tanner graphs associated with the two component classical codes used to construct the proposed CSS codes are characterized by a girth of at least $6$. We also derive an exact count of length-$4$ cycles in the quaternary representation of the parity-check matrix. Monte Carlo simulations under code-capacity and phenomenological noise models show that the proposed codes have competitive finite-length logical error rate performance compared with state-of-the-art codes in both these settings.
Innovation
Methods, ideas, or system contributions that make the work stand out.
high-rate CSS quantum LDPC codes
quasi-dyadic matrices
girth of at least 6
exact count of length-4 cycles
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
