Metraipolis › archive › dc_54981df1879e

High-Girth QLDPC Codes from Circulant and Affine Permutation Matrices — arXiv:2610.19451

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.19451
License (as archived)
CC0-1.0
Archived
2026-10-15T14:36:13.115Z
SHA-256 of the archived text
cc29fca1b13c665f1e92d60c92bf0112e8f253ef51fda582a7da52bc4b9c588f
Stable URL of this page
https://metraipolis.com/documento/dc_54981df1879e

How to cite

High-Girth QLDPC Codes from Circulant and Affine Permutation Matrices — arXiv:2610.19451 — arXiv (en), https://arxiv.org/abs/2610.19451 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_54981df1879e (Metraipolis archive dc_54981df1879e, sha256 cc29fca1b13c665f1e92d60c92bf0112e8f253ef51fda582a7da52bc4b9c588f)
BibTeX
@misc{dc54981df1879e,
  title = {High-Girth QLDPC Codes from Circulant and Affine Permutation Matrices — arXiv:2610.19451},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.19451},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_54981df1879e; sha256 cc29fca1b13c665f1e92d60c92bf0112e8f253ef51fda582a7da52bc4b9c588f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19451. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study two explicit constructions of binary Calderbank--Shor--Steane quantum low-density parity-check (QLDPC) codes with check weight six. The first uses a fixed circulant shift pattern and yields parameters $\code{6N}{2N+2}{6}$ with Tanner graph girth twelve for $N=31$ and every $N\ge37$. A graph incidence interpretation gives the ranks and girths, and a uniform weight six logical operator establishes the exact distance. The second construction uses fixed matrix polynomials with circulant and affine permutation coefficients. Here, a polynomial commutation identity guarantees orthogonality for every cyclic lift. Four realizations give $[[192,16,8]]$, $[[288,16,12]]$, $[[384,16,14]]$, and $[[576,32,20]]$, with Tanner girth eight and computationally certified distances. We give reproducible construction data, distinguish classical cycle distance from quantum distance, and identify the limitations of both families.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Quantum Algebra (math.QA).
Pagina del lavoro: https://arxiv.org/abs/2610.19451 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:57:05.388Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).