Validating quantum-supremacy experiments with exact and fast tensor network contraction
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913198330871808 |
|---|---|
| author | Liu, Yong Chen, Yaojian Guo, Chu Song, Jiawei Shi, Xinmin Gan, Lin Wu, Wenzhao Wu, Wei Fu, Haohuan Liu, Xin Chen, Dexun Zhao, Zhifeng Yang, Guangwen Gao, Jiangang |
| author_facet | Liu, Yong Chen, Yaojian Guo, Chu Song, Jiawei Shi, Xinmin Gan, Lin Wu, Wenzhao Wu, Wei Fu, Haohuan Liu, Xin Chen, Dexun Zhao, Zhifeng Yang, Guangwen Gao, Jiangang |
| contents | 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.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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_04749 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Validating quantum-supremacy experiments with exact and fast tensor network contraction Liu, Yong Chen, Yaojian Guo, Chu Song, Jiawei Shi, Xinmin Gan, Lin Wu, Wenzhao Wu, Wei Fu, Haohuan Liu, Xin Chen, Dexun Zhao, Zhifeng Yang, Guangwen Gao, Jiangang Quantum Physics Distributed, Parallel, and Cluster Computing 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.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. |
| title | Validating quantum-supremacy experiments with exact and fast tensor network contraction |
| topic | Quantum Physics Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2212.04749 |