2021/03/04 by Feng Pan, Pan Zhang, Pan, Feng +1 · 3 citations
Computer Science · Physics and Astronomy · #Computational Physics (physics.comp-ph) #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum chaos and dynamical systems #Quantum many-body systems #physics.comp-ph #quant-ph
paper · pdf · doi:10.48550/arxiv.2103.03074
9 pages, 6 figures, comments are welcome
arxiv created 2021/03/04 · openalex publication_date 2021/03/04 · arxiv updated 2021/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a general tensor network method for simulating quantum circuits. The method is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods. As an application, we study the sampling problem of Google's Sycamore circuits, which are believed to be beyond the reach of classical supercomputers and have been used to demonstrate quantum supremacy. Using our method, employing a small computational cluster containing 60 graphical processing units (GPUs), we have generated one million correlated bitstrings with some entries fixed, from the Sycamore circuit with 53 qubits and 20 cycles, with linear cross-entropy benchmark (XEB) fidelity equals 0.739, which is much higher than those in Google's quantum supremacy experiments.