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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Kasai, Kenta
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911563456184320
author Kasai, Kenta
author_facet Kasai, Kenta
contents We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. In the fixed-degree regime, 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 determine exactly which even regular degree choices in our construction attain the classical Gilbert-Varshamov (GV) bound on both constituent sides, and consequently the CSS GV bound at fixed finite degree.
format Preprint
id arxiv_https___arxiv_org_abs_2603_24588
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
Kasai, Kenta
Quantum Physics
Information Theory
We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. In the fixed-degree regime, 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 determine exactly which even regular degree choices in our construction attain the classical Gilbert-Varshamov (GV) bound on both constituent sides, and consequently the CSS GV bound at fixed finite degree.
title Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
topic Quantum Physics
Information Theory
url https://arxiv.org/abs/2603.24588