← Back to papers
Comment on the Quantum Supremacy Claim by Google
Anirudh Reddy, Benjamin Perez-Garcia, A. J. D. Silva, T. Konrad·August 29, 2021
Physics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
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 [1]. Recently a research team from Google claimed to have carried out such a task with a quantum computer [2], demonstrating in practice a case of this so-called quantum supremacy [3]. Here we argue that this claim was not justified. Unlike other comments [4–11], our criticism is concerned with the missing verification of the output data of the quantum computation.