Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2024 Jan 19;132(3):030601.
doi: 10.1103/PhysRevLett.132.030601.

Verifying Quantum Advantage Experiments with Multiple Amplitude Tensor Network Contraction

Yong Liu  1 , Yaojian Chen  2 , Chu Guo  3 , Jiawei Song  4 , Xinmin Shi  5 , Lin Gan  2   4 , Wenzhao Wu  4 , Wei Wu  4 , Haohuan Fu  2   4 , Xin Liu  1   4 , Dexun Chen  4 , Zhifeng Zhao  1 , Guangwen Yang  1   2   4 , Jiangang Gao  6
Affiliations

Verifying Quantum Advantage Experiments with Multiple Amplitude Tensor Network Contraction

Yong Liu et al. Phys Rev Lett. .

Abstract

The quantum supremacy experiment, such as Google Sycamore [F. Arute et al., Nature (London) 574, 505 (2019).NATUAS0028-083610.1038/s41586-019-1666-5], 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×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.

PubMed Disclaimer

Similar articles

See all similar articles

Cited by

  • Certified randomness using a trapped-ion quantum processor.
    Liu M, Shaydulin R, Niroula P, DeCross M, Hung SH, Kon WY, Cervero-Martín E, Chakraborty K, Amer O, Aaronson S, Acharya A, Alexeev Y, Berg KJ, Chakrabarti S, Curchod FJ, Dreiling JM, Erickson N, Foltz C, Foss-Feig M, Hayes D, Humble TS, Kumar N, Larson J, Lykov D, Mills M, Moses SA, Neyenhuis B, Eloul S, Siegfried P, Walker J, Lim C, Pistoia M. Liu M, et al. Nature. 2025 Apr;640(8058):343-348. doi: 10.1038/s41586-025-08737-1. Epub 2025 Mar 26. Nature. 2025. PMID: 40140579 Free PMC article.

LinkOut - more resources