Metraipolis › archive › dc_e760156b48bb

Logically Augmented Quantum LDPC Codes: Construction and Hierarchical Decoding — arXiv:2611.07062

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07062
License (as archived)
CC0-1.0
Archived
2026-11-06T14:53:00.207Z
SHA-256 of the archived text
40d1e906f0742699560befb2acc6902a60bfbd4fa4e65ca98c02448962669f70
Stable URL of this page
https://metraipolis.com/documento/dc_e760156b48bb

How to cite

Logically Augmented Quantum LDPC Codes: Construction and Hierarchical Decoding — arXiv:2611.07062 — arXiv (en), https://arxiv.org/abs/2611.07062 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e760156b48bb (Metraipolis archive dc_e760156b48bb, sha256 40d1e906f0742699560befb2acc6902a60bfbd4fa4e65ca98c02448962669f70)
BibTeX
@misc{dce760156b48bb,
  title = {Logically Augmented Quantum LDPC Codes: Construction and Hierarchical Decoding — arXiv:2611.07062},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07062},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e760156b48bb; sha256 40d1e906f0742699560befb2acc6902a60bfbd4fa4e65ca98c02448962669f70},
  year = {2026}
}

Archived text

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

We propose a joint framework for constructing and decoding Logically Augmented (LA) quantum low-density parity-check (QLDPC) codes. This is motivated by the need for flexible coding rates and adaptive error protection while preserving block length and code structure. On the construction side, we use an auxiliary \textit{Logical Protection Code (LPC)} to impose additional stabilizer constraints on selected logical qubits of a \textit{primary} code. On the decoding side, the proposed decoder uses the LPC syndrome to generate logical error hypotheses and condition belief propagation (BP) on each hypothesis. The proposed \textit{Hierarchical Logical List Decoder (HLLD)} is invoked only when the initial BP decoder for primary code fails to converge. It then selects the correction with the smallest Hamming weight among the syndrome-consistent candidates produced by hypothesis-conditioned BP runs. For numerical evaluation, we focus on short repetition LPCs, which provide a flexible means of trading rate for additional error protection. Each LPC syndrome admits exactly two logical error hypotheses, irrespective of repetition length, which enables HLLD to explore both possibilities without relying on a single logical estimate. Numerical results show that varying the repetition length provides a tunable trade-off between rate and error-correction performance across a wide range of primary code constructions and their operating regimes. On the decoding side, with the overall LA code held fixed, HLLD reduces the logical error rate by up to 81\%, 75\%, and 69\% for LA codes based on mitten, lifted-product, and bivariate bicycle codes, respectively, compared with conventional BP decoding of the same LA codes.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.07062 — 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-11-06T14:24:46.055Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).