Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2108.13862

Comment on the Quantum Supremacy Claim by Google

Anirudh Reddy, Benjamin Perez-García, Adenilton José da Silva, Thomas Konrad

Published Aug 29, 2021• 0 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2108.13862

Related papers

Statistical Aspects of the Quantum Supremacy Demonstration

Yosef Rinott, Tomer Shoham, Gil Kalai

In quantum computing, a demonstration of quantum supremacy (or quantum advantage) consists of presenting a task, possibly of no practical value, whose computation is feasible on a quantum device, but cannot be performed by classical computers in any feasible amount of time. The notable claim of quantum supremacy presented by Google’s team in 2019 consists of demonstrating the ability of a quantum circuit to generate, albeit with considerable noise, bitstrings from a distribution that is considered hard to simulate on classical computers. Very recently, in 2020, a quantum supremacy claim was presented by a group from the University of Science and Technology of China, using a different technology and generating a different distribution, but sharing some statistical principles with Google’s demonstration. Verifying that the generated data is indeed from the claimed distribution and assessing the circuit’s noise level and its fidelity is a statistical undertaking. The objective of this paper is to explain the relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy in terms that are accessible to statisticians, computer scientists, and mathematicians. Starting with the statistical modeling and analysis in Google’s demonstration, which we explain, we study various estimators of the fidelity, and different approaches to testing the distributions generated by the quantum computer. We propose different noise models, and discuss their implications. A preliminary study of the Google data, focusing mostly on circuits of 12 and 14 qubits is given in different parts of the paper.

arXiv:2008.05177•Statistical Science•Jun 22, 2022•24 citations

A Guide to Quantum Computers and the Development of Quantum Advantage

Siddharth Chander

Quantum advantage is when quantum computers can outperform classical computers.One of the first largescale demonstrations of quantum advantage was recently done by Google running random multi-qubit quantum circuits.While Google's quantum computer took 200 seconds, calculations show that the then-fastest classical supercomputer would have taken 10000 years.Since then, different groups have claimed quantum advantage through other quantum systems.This paper will cover why quantum computers can be faster than classical computers by covering the primary differences between classical computing and quantum computing.Then, we will investigate the Deutsch-Jozsa quantum algorithm and Google's claim of quantum advantage.We will review current research regarding "quantum advantage," tying these events to the use cases covered.Additionally, different quantum algorithms that are theoretically faster than any current quantum algorithms will be analyzed, and we will delve into why this is the case.The covered examples will show methods used to improve quantum computers to provide a significant time difference to achieve a quantum advantage.After that, we make predictions concerning two critical quantum hardware limitations.Finally, we will investigate what the future of quantum advantage entails and some future cases of quantum advantage.

International journal of high school research•Jun 30, 2023•0 citations

An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization

Subhasree Patro, Álvaro Piedrafita

Recently, a team of scientists from Google claims to have carried a computation on their noisy, intermediate-scale quantum (NISQ) computer which no regular computer can achieve. A feat that is sometimes referred as quantum supremacy. In the first part of this work, we explain their approach, their randomised circuit construction and the consequences of their work. Having achieved this milestone, the natural question becomes: what else can we do with a quantum computer? We answer this question in the second part of this work and give an overview of the most widely used quantum primitives. We will see how one can implement them using quantum circuits and how these primitive circuits are composed to create fast algorithms capable of solving commercially relevant problems like simulation of complicated quantum systems for chemistry and material science, Monte Carlo simulation, solving large systems of linear equations, or breaking widely used cryptography like RSA.

IEEE International Symposium on Circuits and Systems proceedings•Sep 29, 2020•6 citations

Questions and Concerns About Google's Quantum Supremacy Claim

Gil Kalai, Yosef Rinott, Tomer Shoham

In October 2019, Nature published a paper [6] describing an experimental work that was performed at Google. The paper claims to demonstrate quantum (computational) supremacy on a 53-qubit quantum computer. Since then we have been involved in a long-term project to study various statistical aspects of the Google experiment. In [30] we studied Google's statistical framework that we found to be very sound and offered some technical improvements. This document describes three main concerns (based on statistical analysis) about the Google 2019 experiment. The first concern is that the data do not agree with Google's noise model (or any other specific model). The second concern is that a crucial simple formula for a priori estimation of the fidelity seems to involve an unexpected independence assumption, and yet it gives very accurate predictions. The third concern is about statistical properties of the calibration process.

arXiv:2305.01064•May 1, 2023•13 citations

Google aims for quantum computing supremacy [News]

Rachel E. Courtland

Quantum computers have long held the promise of performing certain calculations that are impossible- or at least, entirely impractical-for even the most powerful conventional computers to perform. Now, researchers at a Google laboratory in Goleta, Calif., may finally be on the cusp of proving it, using the same kinds of quantum bits, or qubits, that one day could make up largescale quantum machines. By the end of this year, the team aims to increase the number of superconducting qubits it builds on integrated circuits to create a 7-by-7 array. With this quantum IC, the Google researchers aim to perform operations at the edge of what's possible with even the best supercomputers, and so demonstrate "quantum supremacy".

IEEE Spectrum•May 29, 2017•41 citations

How do we quantify the utility of quantum algorithms?

Simon J. Devitt

Quantum computing advantage emerges not from brute force power, but from subtle differences in information processing that can occur for key bottleneck subroutines. In 2019, the Google Quantum AI team performed a landmark experiment demonstrating quantum computational supremacy (Arute et al., 2019) where they performed a quantum computation that, at the time, could not be done on a classical supercomputer. This was remarkable because it was achieved by a processor with only 53 qubits, an observation that emerged from theoretical work which identified that quantum computers could have a massive advantage for certain specially designed benchmarking tasks (Boixo et al., 2018; Bremner et al., 2016).

Research Directions Quantum Technologies•Oct 24, 2022•1 citation
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.
In quantum computing, a demonstration of quantum supremacy (or quantum advantage) consists of presenting a task, possibly of no practical value, whose computation is feasible on a quantum device, but cannot be performed by classical computers in any feasible amount of time. The notable claim of quantum supremacy presented by Google’s team in 2019 consists of demonstrating the ability of a quantum circuit to generate, albeit with considerable noise, bitstrings from a distribution that is considered hard to simulate on classical computers. Very recently, in 2020, a quantum supremacy claim was presented by a group from the University of Science and Technology of China, using a different technology and generating a different distribution, but sharing some statistical principles with Google’s demonstration. Verifying that the generated data is indeed from the claimed distribution and assessing the circuit’s noise level and its fidelity is a statistical undertaking. The objective of this paper is to explain the relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy in terms that are accessible to statisticians, computer scientists, and mathematicians. Starting with the statistical modeling and analysis in Google’s demonstration, which we explain, we study various estimators of the fidelity, and different approaches to testing the distributions generated by the quantum computer. We propose different noise models, and discuss their implications. A preliminary study of the Google data, focusing mostly on circuits of 12 and 14 qubits is given in different parts of the paper.
Quantum advantage is when quantum computers can outperform classical computers.One of the first largescale demonstrations of quantum advantage was recently done by Google running random multi-qubit quantum circuits.While Google's quantum computer took 200 seconds, calculations show that the then-fastest classical supercomputer would have taken 10000 years.Since then, different groups have claimed quantum advantage through other quantum systems.This paper will cover why quantum computers can be faster than classical computers by covering the primary differences between classical computing and quantum computing.Then, we will investigate the Deutsch-Jozsa quantum algorithm and Google's claim of quantum advantage.We will review current research regarding "quantum advantage," tying these events to the use cases covered.Additionally, different quantum algorithms that are theoretically faster than any current quantum algorithms will be analyzed, and we will delve into why this is the case.The covered examples will show methods used to improve quantum computers to provide a significant time difference to achieve a quantum advantage.After that, we make predictions concerning two critical quantum hardware limitations.Finally, we will investigate what the future of quantum advantage entails and some future cases of quantum advantage.
Recently, a team of scientists from Google claims to have carried a computation on their noisy, intermediate-scale quantum (NISQ) computer which no regular computer can achieve. A feat that is sometimes referred as quantum supremacy. In the first part of this work, we explain their approach, their randomised circuit construction and the consequences of their work. Having achieved this milestone, the natural question becomes: what else can we do with a quantum computer? We answer this question in the second part of this work and give an overview of the most widely used quantum primitives. We will see how one can implement them using quantum circuits and how these primitive circuits are composed to create fast algorithms capable of solving commercially relevant problems like simulation of complicated quantum systems for chemistry and material science, Monte Carlo simulation, solving large systems of linear equations, or breaking widely used cryptography like RSA.
In October 2019, Nature published a paper [6] describing an experimental work that was performed at Google. The paper claims to demonstrate quantum (computational) supremacy on a 53-qubit quantum computer. Since then we have been involved in a long-term project to study various statistical aspects of the Google experiment. In [30] we studied Google's statistical framework that we found to be very sound and offered some technical improvements. This document describes three main concerns (based on statistical analysis) about the Google 2019 experiment. The first concern is that the data do not agree with Google's noise model (or any other specific model). The second concern is that a crucial simple formula for a priori estimation of the fidelity seems to involve an unexpected independence assumption, and yet it gives very accurate predictions. The third concern is about statistical properties of the calibration process.
Quantum computers have long held the promise of performing certain calculations that are impossible- or at least, entirely impractical-for even the most powerful conventional computers to perform. Now, researchers at a Google laboratory in Goleta, Calif., may finally be on the cusp of proving it, using the same kinds of quantum bits, or qubits, that one day could make up largescale quantum machines. By the end of this year, the team aims to increase the number of superconducting qubits it builds on integrated circuits to create a 7-by-7 array. With this quantum IC, the Google researchers aim to perform operations at the edge of what's possible with even the best supercomputers, and so demonstrate "quantum supremacy".
Quantum computing advantage emerges not from brute force power, but from subtle differences in information processing that can occur for key bottleneck subroutines. In 2019, the Google Quantum AI team performed a landmark experiment demonstrating quantum computational supremacy (Arute et al., 2019) where they performed a quantum computation that, at the time, could not be done on a classical supercomputer. This was remarkable because it was achieved by a processor with only 53 qubits, an observation that emerged from theoretical work which identified that quantum computers could have a massive advantage for certain specially designed benchmarking tasks (Boixo et al., 2018; Bremner et al., 2016).