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

面向megaquop应用的部分容错量子计算

Partially Fault-Tolerant Quantum Computation for Megaquop Applications

QunaSys Inc.(QunaSys公司);QB Information Technologies (1QBit)(1QB信息技术公司);HPE Quantum, Emergent Machine Intelligence, HPE Labs(HPE量子计算、新兴人工智能、HPE实验室);Fujitsu Quantum Computing Joint Research Division, Center for Quantum Information and Quantum Biology, Osaka University(富士通量子计算联合研究部,大阪大学量子信息与量子生物学中心);Graduate School of Engineering Science, Osaka University(大阪大学工学研究科);Center for Quantum Information and Quantum Biology, Osaka University(大阪大学量子信息与量子生物学中心);RIKEN Center for Quantum Computing (RQC)(理化学研究所量子计算中心);Qolab;Department of Physics & Astronomy, University of Waterloo(滑铁卢大学物理与天文系)
Ming-Zhi Chung, Ali H. Z. Kavaki, Artur Scherer, Abdullah Khalid, Xiangzhou Kong, Toru Kawakubo, Namit Anand, Gebremedhin A Dagnew, Zachary Webb, Allyson Silva,… 展开作者

Ming-Zhi Chung, Ali H. Z. Kavaki, Artur Scherer, Abdullah Khalid, Xiangzhou Kong, Toru Kawakubo, Namit Anand, Gebremedhin A Dagnew, Zachary Webb, Allyson Silva, Gaurav Gyawali, Tennin Yan, Keisuke Fujii, Alan Ho, Masoud Mohseni, Pooya Ronagh, John Martinis

AI总结:

本文研究了部分容错量子计算在大规模电路中的应用,通过量子资源估算分析STAR架构的性能,发现其在硬件改进下的表现,并提出降低空间需求的方法,揭示了代码距离与旋转角度的关系,以及空间-时间的权衡。

摘要:

部分容错量子计算(FTQC)近期作为一种执行大规模电路的有前景的方法出现。本文通过使用超导处理器的现实硬件规格对空间-时间高效类比旋转(STAR)架构进行量子资源估算(QRE),并将其与完整FTQC架构的QRE进行比较。我们展示了STAR架构协议性能受硬件改进的影响。我们还通过利用代码生长开发了一种程序,以减少生产类比旋转状态的工厂大小。我们的结果揭示了最优预生长代码距离与旋转角度相对于后生长不忠实度的非平凡依赖性。此外,我们分析了工厂大小与错误缓解开销之间的空间-时间权衡,并发现,在应用无关的设置中,大约10^5-10^6个小角度旋转门的电路存在一个Goldilocks区域。我们展示了量子模拟二维费米- Hubbard模型系统特别适合STAR架构,仅需数万个物理量子比特和分钟级的运行时间。由于其对更大系统规模的有利算法扩展性,利用部分FTQC可能实现实用规模的二维费米- Hubbard模型模拟。

英文摘要:

Partially fault-tolerant quantum computing (FTQC) has recently emerged as a promising approach for the execution of megaquop-scale circuits with millions of logical operations. In this work, we demonstrate the strengths and the limitations of this approach by conducting quantum resource estimation (QRE) of the space--time-efficient analog rotation (STAR) architecture using realistic hardware specifications for superconducting processors, and compare it against the QRE of the full FTQC architecture. We show how the performance of the STAR architecture's protocols is affected by hardware improvements. We also reduce the space requirements for partial FTQC by developing a procedure leveraging code growth to decrease the size of a factory producing analog rotation states. Our results reveal a non-trivial dependence of the optimal pre-growth code distance on the rotation angle with respect to post-growth infidelity. Further, we analyze space--time trade-offs between the factory size and the error-mitigation overhead, and observe that in an application-agnostic setting, there is a Goldilocks zone for circuits in the regime of roughly $10^5$--$10^6$ small-angle rotation gates. We show that quantum simulation of 2D Fermi--Hubbard model systems is a particularly well-suited application for the STAR architecture, requiring only hundreds of thousands of physical qubits and runtimes on the order of minutes for modest system sizes. Due to its favourable algorithmic scaling to larger system sizes, utility-scale simulation of the 2D Fermi--Hubbard model could potentially be attained using partial FTQC.

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

↑