Simulating the Sycamore quantum supremacy circuits

Abstract

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.

9 pages, 6 figures, comments are welcome

References in corpus (2)

• Quantum computing and the entanglement frontier
• Simulation of low-depth quantum circuits as complex undirected graphical models

Cited by in corpus (6)

• Strong quantum computational advantage using a superconducting quantum processor
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks
• Comment on the Quantum Supremacy Claim by Google
• Towards a NISQ Algorithm to Simulate Hermitian Matrix Exponentiation