mlsanityData to 14 Oct 2026

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

arXiv 2212.04749 ↗First posted 9 Dec 2022quant-ph cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

The quantum supremacy experiment, such as Google Sycamore [Nature 574, 505 (2019)], poses great challenge for classical verification due to the exponentially-increasing compute cost. Using a new-generation Sunway supercomputer within 8.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% (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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 9 Dec 2022.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.