计算机科学
冯·诺依曼熵
冯·诺依曼建筑
超级计算机
振幅
量子计算机
量子
张量(固有定义)
忠诚
失败
算法
量子纠缠
并行计算
计算科学
物理
量子力学
数学
电信
纯数学
操作系统
作者
Yong Liu,Yaojian Chen,Chu Guo,Jiawei Song,Xinmin Shi,Lin Gan,Wenzhao Wu,Wei Wu,Haohuan Fu,Xin Liu,Dexun Chen,Zhifeng Zhao,Guangwen Yang,Jiangang Gao
标识
DOI:10.1103/physrevlett.132.030601
摘要
The quantum supremacy experiment, such as Google Sycamore [F. Arute et al., Nature (London) 574, 505 (2019).], poses a great challenge for classical verification due to the exponentially increasing compute cost. Using a new-generation Sunway supercomputer within 8.5 d, we provide a direct verification by computing $3\ifmmode\times\else\texttimes\fi{}{10}^{6}$ exact amplitudes for the experimentally generated bitstrings, obtaining a cross-entropy benchmarking fidelity of 0.191% (the estimated value is 0.224%). The leap of simulation capability is built on a multiple-amplitude tensor network contraction algorithm which systematically exploits the ``classical advantage'' (the inherent ``store-and-compute'' operation mode of von Neumann machines) of current supercomputers, and a fused tensor network contraction algorithm which drastically increases the compute efficiency on heterogeneous architectures. Our method has a far-reaching impact in solving quantum many-body problems, statistical problems, as well as combinatorial optimization problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI