Metraipolis › archive › dc_80edc7b6026f

Quantum error correction at ultra-low overhead — arXiv:2608.02773

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.02773
License (as archived)
CC0-1.0
Archived
2026-10-31T13:10:54.360Z
SHA-256 of the archived text
9dda0fe4d255dd75921caae03e76b9756277404635db900d71f18fc78bca5717
Stable URL of this page
https://metraipolis.com/documento/dc_80edc7b6026f

How to cite

Quantum error correction at ultra-low overhead — arXiv:2608.02773 — arXiv (en), https://arxiv.org/abs/2608.02773 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_80edc7b6026f (Metraipolis archive dc_80edc7b6026f, sha256 9dda0fe4d255dd75921caae03e76b9756277404635db900d71f18fc78bca5717)
BibTeX
@misc{dc80edc7b6026f,
  title = {Quantum error correction at ultra-low overhead — arXiv:2608.02773},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.02773},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_80edc7b6026f; sha256 9dda0fe4d255dd75921caae03e76b9756277404635db900d71f18fc78bca5717},
  year = {2026}
}

Archived text

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

Suppressing errors is the central challenge for useful large-scale quantum computing. While quantum error correction promises a viable solution to this challenge, existing codes typically suffer from trade-offs among encoding efficiency, error threshold, and hardware feasibility. Here, we introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding $1/2$ while maintaining a pseudo-threshold exceeding $0.4\%$ under the standard circuit-level noise model. Inspired by recent affine-permutation-based code constructions and the long-range connectivity available in reconfigurable neutral-atom arrays, we adopt a structured code geometry in which the code layout, atom rearrangement, and syndrome-extraction schedule are co-designed. This structure enables nonlocal syndrome measurements through simple, parallel atom rearrangements. A complete syndrome extraction cycle measures all $X$- and $Z$-type checks in parallel with $12$ entangling layers, independent of the code size. The resulting threshold is comparable to those of the surface code and bivariate bicycle codes. In particular, a single code block $[[2844,1426,18]]$ encodes $1{,}426$ distance-$18$ logical qubits, achieving an extrapolated logical error rate of $2.6\times10^{-16}$ ($1.9\times10^{-31}$) per logical qubit per cycle, assuming the physical error rate of $0.1\%$ ($0.01\%$). By comparison, a bivariate bicycle code implementation would require more than $68{,}000$ physical qubits to encode the same number of logical qubits at a comparable logical error rate. These results bring demonstrations of ultra-low-overhead quantum error correction within the reach of near-term quantum processors.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-05 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.02773 — 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-31T13:00:19.481Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).