Metraipolis › archive › dc_77aed0c7405a
Gap-Priced $|T\rangle$-States: Dynamic $|T\rangle$ Post-Selection and Budget-Aware Factory Provisioning — arXiv:2610.19299
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19299
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:47:14.182Z
- SHA-256 of the archived text
4d70ecc4b67dc0901723d7da22d0fb95473768897d304a4916402a1513efff15- Stable URL of this page
https://metraipolis.com/documento/dc_77aed0c7405a
How to cite
Gap-Priced $|T\rangle$-States: Dynamic $|T\rangle$ Post-Selection and Budget-Aware Factory Provisioning — arXiv:2610.19299 — arXiv (en), https://arxiv.org/abs/2610.19299 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_77aed0c7405a (Metraipolis archive dc_77aed0c7405a, sha256 4d70ecc4b67dc0901723d7da22d0fb95473768897d304a4916402a1513efff15)
BibTeX
@misc{dc77aed0c7405a,
title = {Gap-Priced $|Trangle$-States: Dynamic $|Trangle$ Post-Selection and Budget-Aware Factory Provisioning — arXiv:2610.19299},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19299},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_77aed0c7405a; sha256 4d70ecc4b67dc0901723d7da22d0fb95473768897d304a4916402a1513efff15},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19299. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Magic $|T\rangle$-state preparation dominates the cost of fault-tolerant quantum computation on surface codes, yet cultivation and distillation are typically provisioned statically, leaving much of the program's error budget unused. We present Gap-Priced $|T\rangle$ States (GP$|T\rangle$-S), a lattice surgery scheduler and factory allocator that co-optimizes both methods under a total $T$-error budget. GP$|T\rangle$-S uses the complementary gap of each cultivated state as a fidelity estimate and dynamically adjusts the cultivation gap cutoff, converting budget slack into speed by giving the scheduler control over the cultivation post-selection. GP$|T\rangle$-S also characterizes distillation factories by size, $|T\rangle$-state production rate, and budget slack, and introduces cultivating factories that embed cultivation within routing channels, achieving fidelities otherwise requiring two-level distillation at a single-level footprint. GP$|T\rangle$-S organizes these characterizations into a factory catalog, and performs distillation factory allocation over this catalog in tandem with the gap cutoff using dynamic-programming to achieve one of i) minimum spacetime volume, ii) minimum execution time, or iii) minimum space overhead, all within a user-provided $T$-error budget. Across sixteen benchmarks under high and low $T$-error budgets of $10^{-3}$ and $10^{-5}$ respectively, GP$|T\rangle$-S consistently outperforms cultivation-only and single-factory baselines without exceeding the budget, achieving a 5.5$\times$ geometric mean speedup in logical cycle count and a 3.4$\times$ geometric mean reduction in space-time volume.
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.19299 — 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-15T14:01:23.606Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).