Quantum Bicycle LDPC Codes with High from Divisor-Driven Search
Liangdong Lu, Guanmin Guo, Yang Liu, Ruipan Yang · 2026 · arXiv 2026
| 编号 QE159 | 主题 qLDPC 码 | 链接 arXiv:2608.09115 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
Bicycle (two-block circulant) quantum low-density parity-check (LDPC) codes include some of the best known small quantum codes, yet their design has relied on group-algebra formulations in which the dimension and distance are accessible only through matrix computation. We show that in the cyclic case the construction collapses into the polynomial ring : self-orthogonality is automatic, the quantum dimension is read off from a polynomial gcd, and the minimum distance is certified exactly through the Calderbank correspondence to additive codes over , turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by exis
本站词条在引用该文献时，会以 wikilink（sources/QE159）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。