Metraipolis › archive › dc_f8773854637b
Maximally-Matched Mixture Decoding for Correlated Atom Loss in Quantum LDPC Codes — arXiv:2610.38283
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38283
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:49:57.942Z
- SHA-256 of the archived text
7600c2dd80027e08892665afcd9f43a2e53f5fbc610e315fbb73171ffb9b8e37- Stable URL of this page
https://metraipolis.com/documento/dc_f8773854637b
How to cite
Maximally-Matched Mixture Decoding for Correlated Atom Loss in Quantum LDPC Codes — arXiv:2610.38283 — arXiv (en), https://arxiv.org/abs/2610.38283 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f8773854637b (Metraipolis archive dc_f8773854637b, sha256 7600c2dd80027e08892665afcd9f43a2e53f5fbc610e315fbb73171ffb9b8e37)
BibTeX
@misc{dcf8773854637b,
title = {Maximally-Matched Mixture Decoding for Correlated Atom Loss in Quantum LDPC Codes — arXiv:2610.38283},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38283},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f8773854637b; sha256 7600c2dd80027e08892665afcd9f43a2e53f5fbc610e315fbb73171ffb9b8e37},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38283. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Heralded atom loss is a dominant noise channel in neutral atom quantum computing platforms, and losses at a two-qubit gate are strongly correlated: when one atom is lost, its gate partner is often lost too. This work shows how to exploit this correlation to construct a better decoder, focusing on [[144,12,12]] Gross code syndrome extraction circuits. Given a loss readout, the possible pairings of the lost qubits according to shared gates form a graph whose maximum matchings carry almost all of the conditional probability mass. Our maximal-matching-mixture (MMM) decoder builds a per-readout decoding hypergraph as a weighted mixture over exactly these loss scenarios. This decoding hypergraph can be used by an ordinary belief-propagation decoder. On the [[144,12,12]] Gross code, MMM lowers the logical error rate by as much as ~25x relative to a loss-unaware decoder and ~2x relative to a loss-aware uniform-mixture baseline from Baranes et al. (2026). Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2610.38283 — 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-01T02:19:43.443Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).