Comment on the Quantum Supremacy Claim by Google

TL;DR

This paper critiques Google's claim of quantum supremacy by highlighting the lack of proper verification of the quantum computer's output, questioning the validity of the claimed achievement.

Contribution

It provides a critical analysis emphasizing the importance of output verification in claims of quantum supremacy, challenging the methodology used by Google.

Findings

Google's quantum supremacy claim lacks output verification

The critique questions the validity of the quantum computation results

Highlights the need for rigorous verification in quantum experiments

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.