Multivariate Multicycle Codes for Complete Single-Shot Decoding
Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov · 2026 · arXiv
| 编号 QE154 | 主题 qLDPC 码 | 链接 arXiv:2601.18879 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
We introduce multivariate multicycle (MM) codes, a new family of quantum error-correcting codes (QECCs) that unifies bivariate bicycle, multivariate bicycle, abelian two-block group algebra, generalized bicycle, trivariate tricycle, and toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length- chain complexes with \textit{t \ge 4}. The chief advantage of these codes is that they possess metachecks and high confinement that permit complete single-shot decoding. We offer a framework that facilitates the construction of long-length chain complexes through the use of Koszul complex. In particular, obtaining explicit boundary maps (parity check and metacheck matrices) is particularly straightforward in our approach. This simple but very general parameterization of codes permitted us to efficiently perform a numerical search, where we identify several MM code candidates that demonstrate these capabilities at high rates and high code distances. Examples of new codes with parameters include , , , , , , , , and . Notably, our codes achieve confinement profiles that surpass all known single-shot-decodable quantum CSS codes of practical blocksize. Our codes are also the first explicit instances of collapsed 5D through 9D higher dimensional QECCs, with check weights significantly lower than those of recent small instances of quantum Tanner codes.
本站词条在引用该文献时，会以 wikilink（sources/QE154）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。