跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2608.09115 · v4

Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search

首次提交 2026-08-10 12:45
版本更新 2026-11-16 08:51
雷达观测 2026-11-17 17:12
arXiv ↗PDF ↗

摘要

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 $\F_2[x]/(x^{l}-1)$: 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 $\F_4$, turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by existing tables. A computer search based on this framework recovers the short codes [[42,12,4]]2[[42,12,4]]_2 and [[62,12,4]]2[[62,12,4]]_2 and produces a family of codes with competitive figure of merit kd2/nkd^2/n, including [[66,20,7]]2[[66,20,7]]_2 with kd2/n=14.85kd^2/n=14.85, above the bivariate bicycle code [[144,12,12]]2[[144,12,12]]_2 (kd2/n=12kd^2/n=12) at less than half the block length, together with [[46,2,8]]2[[46,2,8]]_2, [[66,2,9]]2[[66,2,9]]_2, [[66,4,8]]2[[66,4,8]]_2, [[66,6,8]]2[[66,6,8]]_2 and, at n=90n=90, [[90,16,7]]2[[90,16,7]]_2, [[90,18,6]]2[[90,18,6]]_2, [[90,20,6]]2[[90,20,6]]_2. An exhaustive census at n=48n=48 delineates the boundary of this picture: we exhibit a [[48,10,6]]2[[48,10,6]]_2 code from a minimal 4848-element group (the Aydin--Tamo--Barg realization uses 7272 elements), and prove that distance 55 forces a stabilizer-rank loss, which excludes [[48,10,5]]2[[48,10,5]]_2 from the weight-88 symmetric coset family. The framework thus opens a systematic route to bicycle-type quantum LDPC codes beyond the reach of group-theoretic searches, and identifies exactly where genuinely coset-theoretic phenomena begin.

作者备注:v3: corrected the entry for the code [[90,16,7]] in Table I and added one line to the Acknowledgment

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-16 08:51 · 最新观测版本

Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search

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 $\F_2[x]/(x^{l}-1)$: 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 $\F_4$, turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by existing tables. A computer search based on this framework recovers the short codes [[42,12,4]]2[[42,12,4]]_2 and [[62,12,4]]2[[62,12,4]]_2 and produces a family of codes with competitive figure of merit kd2/nkd^2/n, including [[66,20,7]]2[[66,20,7]]_2 with kd2/n=14.85kd^2/n=14.85, above the bivariate bicycle code [[144,12,12]]2[[144,12,12]]_2 (kd2/n=12kd^2/n=12) at less than half the block length, together with [[46,2,8]]2[[46,2,8]]_2, [[66,2,9]]2[[66,2,9]]_2, [[66,4,8]]2[[66,4,8]]_2, [[66,6,8]]2[[66,6,8]]_2 and, at n=90n=90, [[90,16,7]]2[[90,16,7]]_2, [[90,18,6]]2[[90,18,6]]_2, [[90,20,6]]2[[90,20,6]]_2. An exhaustive census at n=48n=48 delineates the boundary of this picture: we exhibit a [[48,10,6]]2[[48,10,6]]_2 code from a minimal 4848-element group (the Aydin--Tamo--Barg realization uses 7272 elements), and prove that distance 55 forces a stabilizer-rank loss, which excludes [[48,10,5]]2[[48,10,5]]_2 from the weight-88 symmetric coset family. The framework thus opens a systematic route to bicycle-type quantum LDPC codes beyond the reach of group-theoretic searches, and identifies exactly where genuinely coset-theoretic phenomena begin.

查看此版本解读 →查看此版本原文 ↗