| Literature DB >> 31765197 |
Chu Guo1, Yong Liu2, Min Xiong2, Shichuan Xue2, Xiang Fu2, Anqi Huang2, Xiaogang Qiang2, Ping Xu2, Junhua Liu3,4, Shenggen Zheng5, He-Liang Huang1,6,7, Mingtang Deng2, Dario Poletti8, Wan-Su Bao1,7, Junjie Wu2.
Abstract
Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here, we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms. The classical computing complexity of this simulator is directly related to the entanglement generation of the underlying quantum circuit rather than the number of qubits or gate operations. We apply our method to study random quantum circuits, which allows us to quantify precisely the memory usage and the time requirements of random quantum circuits. We demonstrate our method by computing one amplitude for a 7×7 lattice of qubits with depth (1+40+1) on the Tianhe-2 supercomputer.Year: 2019 PMID: 31765197 DOI: 10.1103/PhysRevLett.123.190501
Source DB: PubMed Journal: Phys Rev Lett ISSN: 0031-9007 Impact factor: 9.161