English

Independent Trivariate Bicycle Codes

Quantum Physics 2026-03-19 v1 Information Theory math.IT

Abstract

We introduce six independent trivariate bicycle (ITB) codes, which extend the bivariate bicycle framework of Bravyi et al.\ to three cyclic dimensions. Using asymmetric polynomial pairs on three-dimensional tori, we construct four codes including a [[140,6,14]][[140,6,14]] code with kd2/n=8.40kd^2/n = 8.40. In the code-capacity setting, the [[140,6,14]][[140,6,14]] code achieves a pseudothreshold of 8.0%8.0\% and kd2/n=8.40kd^2/n = 8.40, exceeding the best multivariate bicycle code of Voss et al.\ (7.9%7.9\%, kd2/n=2.67kd^2/n = 2.67). With circuit-level depolarizing noise, pseudothresholds reach 0.59%0.59\% for [[140,6,14]][[140,6,14]] and 0.53%0.53\% for [[84,6,10]][[84,6,10]]. On the SI1000 superconducting noise model, the [[140,6,14]][[140,6,14]] code achieves a per-round per-observable rate of 5.6×1055.6 \times 10^{-5} at p=0.20%p = 0.20\%. We additionally present two self-dual codes with weight-8 stabilizers: [[54,14,5]][[54,14,5]] (kd2/n=6.48kd^2/n = 6.48) and [[128,20,8]][[128,20,8]] (kd2/n=10.0kd^2/n = 10.0). These results expand the design space of algebraic quantum LDPC codes and demonstrate that the third cyclic dimension yields competitive candidates for practical fault-tolerant implementations.

Cite

@article{arxiv.2603.17703,
  title  = {Independent Trivariate Bicycle Codes},
  author = {Aygul Azatovna Galimova},
  journal= {arXiv preprint arXiv:2603.17703},
  year   = {2026}
}
R2 v1 2026-07-01T11:26:08.935Z