arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.02501quant-ph
收藏

任意几何结构中随机量子电路的计算能力

The computational power of random quantum circuits in arbitrary geometries

Matthew DeCross, Reza Haghshenas, Minzhao Liu, Enrico Rinaldi, Johnnie Gray, Yuri Alexeev, Charles H. Baldwin, John P. Bartolotta, Matthew Bohn, Eli Chertkov, J… 展开作者

Matthew DeCross, Reza Haghshenas, Minzhao Liu, Enrico Rinaldi, Johnnie Gray, Yuri Alexeev, Charles H. Baldwin, John P. Bartolotta, Matthew Bohn, Eli Chertkov, Julia Cline, Jonhas Colina, Davide DelVento, Joan M. Dreiling, Cameron Foltz, John P. Gaebler, Thomas M. Gatterman, Christopher N. Gilbreth, Joshua Giles, Dan Gresh, Alex Hall, Aaron Hankin, Azure Hansen, Nathan Hewitt, Ian Hoffman, Craig Holliman, Ross B. Hutson, Trent Jacobs, Jacob Johansen, Patricia J. Lee, Elliot Lehman, Dominic Lucchetti, Danylo Lykov, Ivaylo S. Madjarov, Brian Mathewson, Karl Mayer, Michael Mills, Pradeep Niroula, Juan M. Pino, Conrad Roman, Michael Schecter, Peter E. Siegfried, Bruce G. Tiemann, Curtis Volin, James Walker, Ruslan Shaydulin, Marco Pistoia, Steven. A. Moses, David Hayes, Brian Neyenhuis, Russell P. Stutz, Michael Foss-Feig

AI总结:

本文介绍 Quantinuum H2 升级后在56量子比特、任意连通性和高门保真度下进行随机电路采样,显示其规模或已超越现有经典模拟能力。

摘要:

对二维量子电路输出分布进行采样的实验,已经为经典计算机与量子计算机之间的计算能力差距提供了经验证据。许多旨在缩小这一差距的尝试都采用了基于张量网络技术的经典模拟,而这些模拟的局限性揭示了:要使经典可模拟性受挫,量子硬件需要作出哪些改进。具体而言,拥有超过约50个量子比特的量子计算机之所以主要仍易受经典模拟影响,是因为其门保真度和连通性受到限制;后者决定了在生成高度纠缠态时需要多少个门(并因此决定会承受多少非保真度)。在这里,我们描述了 Quantinuum H2 量子计算机近期的硬件升级,这些升级使其能够在多达56个量子比特上运行,具有任意连通性以及99.843(5)%的双量子比特门保真度。利用 H2 灵活的连通性,我们展示了在高度连通几何结构中进行随机电路采样的数据,其保真度前所未有,并且规模似乎超出了最先进经典算法的能力范围。经典模拟 H2 的巨大难度可能只受限于量子比特数量,这证明了在持续迈向构建更大机器的过程中,QCCD 架构的前景和可扩展性。

英文摘要:

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and therefore how much infidelity is suffered) in generating highly-entangled states. Here, we describe recent hardware upgrades to Quantinuum's H2 quantum computer enabling it to operate on up to $56$ qubits with arbitrary connectivity and $99.843(5)\%$ two-qubit gate fidelity. Utilizing the flexible connectivity of H2, we present data from random circuit sampling in highly connected geometries, doing so at unprecedented fidelities and a scale that appears to be beyond the capabilities of state-of-the-art classical algorithms. The considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the QCCD architecture as continued progress is made towards building larger machines.

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

↑