Non-Randomness of Google's Quantum Supremacy Benchmark
arXiv:2110.06046 · doi:10.1021/acs.jpclett.2c02045
Abstract
The first achievement of quantum supremacy has been claimed recently by Google for the random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the randomness of Google's quantum random-bit sampling. The heat maps of Google's random bit-strings show stripe patterns at specific qubits in contrast to the Haar-measure or classical random-bit strings. Google's data contains more bit 0 than bit 1, i.e., about 2.8\% difference, and fail to pass the NIST random number tests, while the Haar-measure or classical random-bit samples pass. Their difference is also illustrated by the Marchenko-Pastur distribution and the Girko circular law of random matrices of random bit-strings. The calculation of the Wasserstein distances shows that Google's random bit-strings are farther away from the Haar-measure random bit-strings than the classical random bit-strings. Our results imply that random matrices and the Wasserstein distance could be new tools for analyzing the performance of quantum computers.
13 pages
References in corpus (12)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum algorithm for solving linear systems of equations
- Quantum computational advantage using photons
- Black holes as mirrors: quantum information in random subsystems
- Strong quantum computational advantage using a superconducting quantum processor
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Introduction to Random Matrices - Theory and Practice
- Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
- Classical Simulation of Quantum Supremacy Circuits
- Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits
- On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking