Metraipolis › archive › dc_776e2198807a
Flow-Based Lattice Surgery Optimization with Runtime T Gate Scheduling — arXiv:2609.23756
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23756
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:46:51.767Z
- SHA-256 of the archived text
c7676e3398a0aa9da28973397899a149547b41e154405878be250684711186c4- Stable URL of this page
https://metraipolis.com/documento/dc_776e2198807a
How to cite
Flow-Based Lattice Surgery Optimization with Runtime T Gate Scheduling — arXiv:2609.23756 — arXiv (en), https://arxiv.org/abs/2609.23756 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_776e2198807a (Metraipolis archive dc_776e2198807a, sha256 c7676e3398a0aa9da28973397899a149547b41e154405878be250684711186c4)
BibTeX
@misc{dc776e2198807a,
title = {Flow-Based Lattice Surgery Optimization with Runtime T Gate Scheduling — arXiv:2609.23756},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23756},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_776e2198807a; sha256 c7676e3398a0aa9da28973397899a149547b41e154405878be250684711186c4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23756. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Lattice surgery on the surface code is a leading route to fault-tolerant quantum computation. Compiling logical circuits into lattice surgery operations is a pivotal step that determines the resource cost of a computation. Prior compilers build on idealized assumptions, and one that works in practical settings remains to be developed. Existing works are either unscalable or route one gate at a time within a layer, so the embedding depends on the order of gates and opportunities to route many gates at once are lost. In addition, they assume magic states are always available and cost-free, even though preparing one costs more than a Clifford operation. We present FlowRouter, the first topological lattice surgery compiler that places Clifford routing and stochastic magic state cultivation inside a single 3D embedding. At compile time, FlowRouter formulates the routing of an entire circuit layer as a maximum-flow problem, embedding many gates simultaneously. At runtime, it allows magic states to be cultivated at every idling patch, works with the realistic cultivation process with multiplexing and multi-stage post-selections, and absorbs the stochasticity by introducing delay mechanisms that add as little spacetime volume as possible. With magic states assumed free, FlowRouter reduces spacetime volume by 2.3x and compiles 10.8x faster than the state-of-the-art static topological lattice surgery compiler. With the cultivation-aware setting that includes both Clifford and magic state cost, FlowRouter reduces spacetime volume by 2.3x on a distance-13 surface code when compared with the state-of-the-art runtime compiler. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-22 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.23756 — 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-09T22:25:52.422Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).