Quantum Supremacy Review

Transactions on Computational Science and Computational Intelligence

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. In the following, we provide an overview of the Google Quantum Team's experiments, then identify some open questions in the quest to demonstrate quantum supremacy. 1.0 What is quantum supremacy? Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Quantum computers can execute some tasks "faster" than classical computers 1 only if those tasks can be executed "concurrently". 2 For example, the search for prime numbers can be executed concurrently (see, for example, Bokhari 1984). In contrast, solving some computational fluid dynamics systems requires time-ordering of computational steps (see, for example, Kuzmin and Hämäläinen 2014) in the sense that there is no known computational method that would allow us to avoid that ordering.

International Journal of Scientific Research in Computer Science, Engineering and Information Technology, 2020

The main purpose of this paper is to examine some (potential) applications of quantum computation in AI and to review the interplay between quantum theory and AI. For the readers who are not familiar with quantum computation, a brief introduction to it is provided, and a famous but simple quantum algorithm is introduced so that they can appreciate the power of quantum computation. Also, a (quite personal) survey of quantum computation is presented in order to give the readers a (unbalanced) panorama of the field. The author hopes that this paper will be a useful map for AI researchers who are going to explore further and deeper connections between AI and quantum computation as well as quantum theory although some parts of the map are very rough and other parts are empty, and waiting for the readers to fill in.

arXiv (Cornell University), 2021

The first achievement of quantum supremacy has been claimed recently by Google for the random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the randomness of Google's quantum random-bit sampling. The heat maps of Google's random bit-strings show stripe patterns at specific qubits in contrast to the Haar-measure or classical random-bit strings. Google's data contains more bit 0 than bit 1, i.e., about 2.8% difference, and fail to pass the NIST random number tests, while the Haar-measure or classical random-bit samples pass. Their difference is also illustrated by the Marchenko-Pastur distribution and the Girko circular law of random matrices of random bit-strings. The calculation of the Wasserstein distances shows that Google's random bit-strings are farther away from the Haar-measure random bit-strings than the classical random bit-strings. Our results imply that random matrices and the Wasserstein distance could be new tools for analyzing the performance of quantum computers.

The impact of quantum computers on superintelligent AI systems , 2020

ABSTRCT There are so many scientific claims that quantum computers have not yet come of age, their development still is at an early stage and certainly has potential only in theory such as factorization among others. More so, even quantum engineers are not sure of the applications that will emerge once quantum computers becomes truly viable (Tamlin Magee (2020)). On the 23 rd October, 2019, Google (Alphabet) claimed to have created quantum processors that can perform computations in a Hilbert space of dimension 2 53 ≈ 9 × 10 15 to perform task that would take classical supercomputer approximately 10,000 years in 200 seconds! With the arrival of Google's incredible quantum technology breakthrough, the paper is highly excited and delighted to propose real-life quantum applications for superintelligent AI systems of dimension approximately 10 11 and beyond.

ArXiv, 2020

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. Verifying that the generated data is indeed from the claimed distribution and assessing the circuit's noise level and its fidelity is a purely 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 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...

Two technological races, drivers of disruptive change and geostrategic (re)positioning of the great powers, are currently taking place: the quantum technological race and the Artificial Intelligence (AI) race. The present article develops a strategic and technological reflection on the meeting point between these two races, this reflection leads us to the Quantum Artificial Intelligence of Things linked to a Quantum Internet of Things, we discuss these two concepts and provide an experimental example of a utility maximizing quantum robot endowed with a Quantum Recurrent Neural Network works on a decision problem, implemented on IBM's quantum computers, this example is used for a reflection on the strategic challenges coming from the QIoT and the QAIoT, ranging from geopolitical challenges to the issue of the technological singularity.

EPJ Quantum Technology, 2024

The potential of achieving computational hardware with quantum advantage depends heavily on the quality of quantum gate operations. However, the presence of imperfect two-qubit gates poses a significant challenge and acts as a major obstacle in developing scalable quantum information processors. Google's Quantum AI and collaborators claimed to have conducted a supremacy regime experiment. In this experiment, a new two-qubit universal gate called the Sycamore gate is constructed and employed to generate random quantum circuits (RQCs), using a programmable quantum processor with 53 qubits. These computations were carried out in a computational state space of size 9 × 10 15. Nevertheless, even in strictly-controlled laboratory settings, quantum information on quantum processors is susceptible to various disturbances, including undesired interaction with the surroundings and imperfections in the quantum state. To address this issue, we conduct both quantum state tomography (QST) and quantum process tomography (QPT) experiments on Google's Sycamore gate using different artificial architectural superconducting quantum computer. Furthermore, to demonstrate how errors affect gate fidelity at the level of quantum circuits, we design and conduct full QST experiments for the five-qubit eight-cycle circuit, which was introduced as an example of the programability of Google's Sycamore quantum processor. These quantum tomography experiments are conducted in three distinct environments: noise-free, noisy simulation, and on IBM Quantum's genuine quantum computer. Our results offer valuable insights into the performance of IBM Quantum's hardware and the robustness of Sycamore gates within this experimental setup. These findings contribute to our understanding of quantum hardware performance and provide valuable information for optimizing quantum algorithms for practical applications.

Nature, 2019

Quantum Computing and AI, 2023

Machines and humanity share the same space in the world, which is a profound question. It touches on themes of coexistence, technological advancement, and the future of our society. The intersection of Quantum Computing (QC) and Artificial Intelligence (AI) presents a transformative potential for the future of technology and society. QC, with its ability to perform complex calculations at unprecedented speeds, offers a powerful tool for AI to process and analyze vast amounts of data, potentially leading to breakthroughs in various fields. However, this convergence also raises important questions about the implications for humanity. Can these advanced technologies coexist with human society, and what ethical considerations must be addressed to ensure they serve the greater good? This paper explores the promise and challenges of integrating QC and AI, examining the potential for collaboration between machine and humanity, while also considering the risks and ethical dilemmas that accompany such profound technological advancements.

Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2021

We develop a high-performance tensor-based simulator for random quantum circuits(RQCs) on the new Sunway supercomputer. Our major innovations include: (1) a near-optimal slicing scheme, and a path-optimization strategy that considers both complexity and compute density; (2) a three-level parallelization scheme that scales to about 42 million cores; (3) a fused permutation and multiplication design that improves the compute efficiency for a wide range of tensor contraction scenarios; and (4) a mixedprecision scheme to further improve the performance. Our simulator effectively expands the scope of simulatable RQCs to include the 10×10(qubits)×(1+40+1)(depth) circuit, with a sustained performance of 1.2 Eflops (single-precision), or 4.4 Eflops (mixedprecision)as a new milestone for classical simulation of quantum circuits; and reduces the simulation sampling time of Google Sycamore to 304 seconds, from the previously claimed 10,000 years.