What Have Google's Random Quantum Circuit Simulation Experiments Demonstrated about Quantum Supremacy?
Jack K. Horner, John F. Symons

TL;DR
This paper reviews Google's quantum supremacy experiments, arguing that they do not definitively settle the debate and highlighting open questions in demonstrating true quantum advantage.
Contribution
It provides an overview of Google's experiments and critically analyzes their implications, emphasizing unresolved issues in quantum supremacy demonstrations.
Findings
Google's experiments suggest quantum advantage but are not conclusive
Open questions remain about the scalability and verification of quantum supremacy
The debate over quantum supremacy is still ongoing
Abstract
Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, "the Google Quantum Team") report the results of experiments that purport to demonstrate "quantum supremacy" -- the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. We provide an overview of the Google Quantum Team's experiments, then identify some open questions in the quest to demonstrate quantum supremacy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Quantum Computing Algorithms and Architecture
