arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.19299quant-ph
收藏

间隙定价$|T\rangle$态:动态$|T\rangle$后选择与预算感知工厂配置

Gap-Priced $|T\rangle$-States: Dynamic $|T\rangle$ Post-Selection and Budget-Aware Factory Provisioning

The University of Texas at Austin(德克萨斯大学奥斯汀分校);University of Pennsylvania(宾夕法尼亚大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室)

Maxwell Poster, Sayam Sethi, Steven Hofmeyr, Yuhao Liu, Jonathan Baker, Costin Iancu

AI总结:

该研究提出GP$|T\rangle$-S调度器与工厂分配器,通过动态调整$|T\rangle$态制备间隙阈值、引入制备工厂并结合动态规划分配蒸馏工厂,在指定$T$误差预算下实现时空体积、执行时间或空间开销的优化,且性能优于基线。

摘要:

魔态$|T\rangle$态制备是表面码容错量子计算的主要成本来源,但其制备与蒸馏通常采用静态配置,导致程序的误差预算大量闲置。我们提出间隙定价$|T\rangle$态(GP$|T\rangle$-S),这是一种格点手术调度器与工厂分配器,可在总$T$误差预算下协同优化两种方法。GP$|T\rangle$-S利用每个制备态的互补间隙作为保真度估计值,动态调整制备间隙阈值,通过赋予调度器对制备后选择的控制权,将预算冗余转化为速度提升。GP$|T\rangle$-S还按规模、$|T\rangle$态产率与预算冗余表征蒸馏工厂,并引入将制备嵌入路由通道的制备工厂,实现了原本需两级蒸馏的保真度,且仅占用单级蒸馏的空间。GP$|T\rangle$-S将这些表征整理为工厂目录,结合动态规划在该目录上执行蒸馏工厂分配与间隙阈值调整,以实现以下目标之一:最小时空体积、最小执行时间或最小空间开销,且均在用户指定的$T$误差预算内。在16个基准测试中,分别在$10^{-3}$(高$T$误差预算)与$10^{-5}$(低$T$误差预算)条件下,GP$|T\rangle$-S均未超出预算,且持续优于仅制备与单工厂基线,在逻辑周期数上实现5.5倍几何平均加速,在时空体积上实现3.4倍几何平均缩减。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑