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

超越Sycamore:利用1432个GPU实现快7倍的量子随机线路采样

Leapfrogging Sycamore: Harnessing 1432 GPUs for 7$\times$ Faster Quantum Random Circuit Sampling

Xian-He Zhao, Han-Sen Zhong, Feng Pan, Zi-Han Chen, Rong Fu, Zhongling Su, Xiaotong Xie, Chaoxing Zhao, Pan Zhang, Wanli Ouyang, Chao-Yang Lu, Jian-Wei Pan, Ming-Cheng Chen

AI总结:

本研究提出一种使用1432个GPU的高能效经典模拟算法,通过张量网络和后处理算法降低复杂度,在生成不相关样本、求解速度和能耗上全面超越Sycamore 53比特实验,首次以明确实验证据反驳其量子优势声明。

摘要:

随机量子线路采样作为展示量子计算优势的基准。近期经典算法的进展,尤其是基于张量网络方法的算法,显著缩短了经典模拟时间,并对第一代量子优势实验的声明提出了挑战。然而,在生成不相关样本、求解时间和能耗方面,此前的经典模拟实验仍逊色于Sycamore处理器。在此,我们报告了一种高能效的经典模拟算法,使用1432个GPU模拟量子随机线路采样,生成了具有更高线性交叉熵分数的不相关样本,且速度比Sycamore 53比特实验快7倍。我们提出了一种后处理算法以降低整体复杂度,并集成了最先进的高性能通用GPU,与以往工作相比实现了两个数量级的能耗降低。我们的工作提供了首个明确的实验证据来反驳Sycamore的量子优势声明,并重新定义了使用随机线路采样的量子计算优势边界。

英文摘要:

Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms, especially those based on tensor network methods, has significantly reduced the classical simulation time and challenged the claim of the first-generation quantum advantage experiments. However, in terms of generating uncorrelated samples, time-to-solution, and energy consumption, previous classical simulation experiments still underperform the \textit{Sycamore} processor. Here we report an energy-efficient classical simulation algorithm, using 1432 GPUs to simulate quantum random circuit sampling which generates uncorrelated samples with higher linear cross entropy score and is 7 times faster than \textit{Sycamore} 53 qubits experiment. We propose a post-processing algorithm to reduce the overall complexity, and integrated state-of-the-art high-performance general-purpose GPU to achieve two orders of lower energy consumption compared to previous works. Our work provides the first unambiguous experimental evidence to refute \textit{Sycamore}'s claim of quantum advantage, and redefines the boundary of quantum computational advantage using random circuit sampling.

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

↑