English

Validating quantum-supremacy experiments with exact and fast tensor network contraction

Quantum Physics 2024-01-18 v2 Distributed, Parallel, and Cluster Computing

Abstract

The quantum supremacy experiment, such as Google Sycamore [Nature \textbf{574}, 505 (2019)], poses great challenge for classical verification due to the exponentially-increasing compute cost. Using a new-generation Sunway supercomputer within 8.58.5 days, we provide a direct verification by computing three million exact amplitudes for the experimentally generated bitstrings, obtaining an XEB fidelity of 0.191%0.191\% (the estimated value is 0.224%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.

Cite

@article{arxiv.2212.04749,
  title  = {Validating quantum-supremacy experiments with exact and fast tensor network contraction},
  author = {Yong Liu and Yaojian Chen and Chu Guo and Jiawei Song and Xinmin Shi and Lin Gan and Wenzhao Wu and Wei Wu and Haohuan Fu and Xin Liu and Dexun Chen and Zhifeng Zhao and Guangwen Yang and Jiangang Gao},
  journal= {arXiv preprint arXiv:2212.04749},
  year   = {2024}
}

Comments

5 pages, 3 figures, comments are welcome!

R2 v1 2026-06-28T07:27:28.218Z