Comment on the Quantum Supremacy Claim by Google
arXiv:2108.13862
Abstract
Quantum computation promises to execute certain computational tasks on time scales much faster than any known algorithm on an existing classical computer, for example calculating the prime factors of large integers. Recently a research team from Google claimed to have carried out such a task with a quantum computer, demonstrating in practice a case of this so-called quantum supremacy. Here we argue that this claim was not justified. Unlike other comments, our criticism is concerned with the missing verification of the output data of the quantum computation.
arXiv comment2 pages
References in corpus (8)
- Quantum Computing in the NISQ era and beyond
- Characterizing Quantum Supremacy in Near-Term Devices
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Efficient classical simulation of noisy random quantum circuits in one dimension
- Classical Simulation of Quantum Supremacy Circuits
- Simulating the Sycamore quantum supremacy circuits
- Comment on "Quantum supremacy using a programmable superconducting processor"
- On the meaning of "quantum supremacy" experiments