Metraipolis › archive › dc_68bc1ca884a8

Low-cost algorithm-to-execution framework for surface-code quantum computing — arXiv:2609.10965

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10965
License (as archived)
CC0-1.0
Archived
2026-10-16T06:40:54.880Z
SHA-256 of the archived text
33c710f379c1091fe2661d03fb1456418e31092afbe815a4cce89ba6ce0dd3ee
Stable URL of this page
https://metraipolis.com/documento/dc_68bc1ca884a8

How to cite

Low-cost algorithm-to-execution framework for surface-code quantum computing — arXiv:2609.10965 — arXiv (en), https://arxiv.org/abs/2609.10965 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_68bc1ca884a8 (Metraipolis archive dc_68bc1ca884a8, sha256 33c710f379c1091fe2661d03fb1456418e31092afbe815a4cce89ba6ce0dd3ee)
BibTeX
@misc{dc68bc1ca884a8,
  title = {Low-cost algorithm-to-execution framework for surface-code quantum computing — arXiv:2609.10965},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10965},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_68bc1ca884a8; sha256 33c710f379c1091fe2661d03fb1456418e31092afbe815a4cce89ba6ce0dd3ee},
  year = {2026}
}

Archived text

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

Fault-tolerant quantum computing is progressing from demonstrations of individual logical components toward the execution of useful quantum algorithms on large-scale error-corrected processors. Realizing this transition requires co-design across algorithms, fault-tolerant implementations, and hardware resources. Here we develop an algorithm-to-execution framework for low-cost surface-code quantum computing that carries the structure of a computation from hierarchical logical descriptions to circuit-specific spatial organization, non-Clifford resource planning, and physical resource evaluation. We apply the framework to twenty benchmark circuits spanning seven algorithm families and to a hierarchically reconstructed application-scale elliptic-curve discrete-logarithm workload. Under the stated error and resource-supply models, combining circuit-specific layouts with hybrid non-Clifford implementation reduces space--time volume by up to 12.70x relative to an all-synthesis Litinski fast-block baseline. Circuit-specific layouts reduce both modeled runtime and space--time volume in eighteen benchmarks, while the remaining two retain the fast layout. These results show that the physical cost of fault-tolerant computation emerges from the interaction between algorithm structure, error-corrected implementation, and hardware organization rather than from aggregate logical resource counts alone.

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