Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound

Kenta Kasai · 2026 · arXiv 2026

| 编号 QE146 | 主题 qLDPC 码 | 链接 arXiv:2603.24588 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. For fixed balanced triples with even component degrees and $j_Z\ge 4$, we prove that the coding rate stays bounded away from zero and that the relative distances on both sides stay bounded away from zero with probability tending to one as the blocklength grows. Moreover, within an explicit low-degree search window, we prove that all 56 balanced triples in that window with even common row degree, column degree at least four, and positive design quantum rate attain the classical Gilbert-Varshamov (GV) bound on both constituent sides, and consequently the CSS GV bo

本站词条在引用该文献时，会以 wikilink（sources/QE146）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。