Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
Sheida Rabeti and Hessam Mahdavifar · 2026 · arXiv.org
| 编号 QE166 | 主题 qLDPC 码 | 链接 arXiv:2605.14173 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a two-polynomial search in GB codes to a single-polynomial search, while preserving sparsity. We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices. Finally, simulation results for short- to medium-length UB codes (block lengths ranging from a few hundred to approximately ) demonstrate competitive performance relative to existing GB and bivariate bicycle (BB) codes despite the additional algebraic restriction.
本站词条在引用该文献时，会以 wikilink（sources/QE166）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。