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

Research Directions Quantum Technologies

How do we quantify the utility of quantum algorithms?

Simon J. Devitt

Published Oct 24, 2022• 1 citation
Publisher

Abstract

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).

DOI
10.1017/qut.2022.7

Related papers

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

Quantum Supremacy vs. Quantum Utility - A Critical Evaluation

V N R Sai Krishna Kari, Shamim B, V T R Pavan Kumar M

Quantum computing has progressed from theoretical speculation to experimental realization, leading to milestone demonstrations that claim computational superiority over classical systems. Among these milestones, quantum supremacy experiments have attracted considerable attention by showcasing tasks that are infeasible for classical computation within reasonable time limits. However, the practical value of such demonstrations remains a subject of debate. This paper critically evaluates the distinction between quantum supremacy and quantum utility, emphasizing their conceptual differences, experimental foundations, and real-world relevance. By examining key experimental results, algorithmic developments, and benchmarking approaches, the study argues that quantum utility-defined by practical, application-oriented performance-provides a more meaningful metric for long-term progress. The paper highlights the limitations of supremacy-based demonstrations and discusses pathways toward achieving utility-driven quantum advantage in the near and long term.

Journal of Analytical and Applied Computer Sciences•Dec 31, 2025•0 citations

Prospects and Technological Implementation Aspects of the Quantum Computing Revolution

Mikhail Pavlov

Abstract Quantum computing leverages fundamental quantum-mechanical phenomena—most notably superposition, entanglement, and quantum tunneling—to perform computations in ways that differ fundamentally from classical digital processing. Compared to conventional computing architectures, quantum systems promise significant reductions in computational time and potentially lower energy consumption for specific classes of problems. These advantages, combined with advances in nanoscale engineering and the slowing of traditional hardware scaling trends such as Moore’s Law, have led to substantial commercial and national-security-driven investments in quantum technologies over the past decade. A major milestone was reached when Google announced the experimental demonstration of “quantum supremacy,” showing that a quantum processor could execute a specific computational task infeasible for a classical supercomputer within practical time constraints. Although the demonstrated problem had no immediate practical application, this achievement marked a crucial step toward the development of quantum systems capable of delivering real-world computational advantages and provided a more precise technical framing of the concept of quantum advantage. Despite the fact that the mathematical foundations, programming models, and principal quantum algorithms were established in the 1990s, quantum computing remained largely confined to a specialized research community for decades. Today, the increasing accessibility of cloud-based quantum hardware calls for a broader dissemination of implementation-oriented knowledge among researchers and practitioners in computer science, software engineering, and related fields. The quantum programming paradigm differs fundamentally from classical programming models and often relies on physical and algebraic notations that may pose barriers to traditionally trained computer scientists. This series of articles provides a self-contained and concise introduction to quantum computing and its core algorithms, with a strong emphasis on practical implementation. Given that real quantum processors—such as those accessible via the IBM quantum ecosystem—are now available as cloud services, experimental validation can be conducted both on simulators and on actual hardware for small-scale inputs. While other platforms such as Rigetti and IonQ also offer cloud-based quantum computing services, this review focuses exclusively on the IBM quantum computing ecosystem.

•Mar 4, 2026•0 citations

Quantum Computing: The Next Frontier in Technology

Aruna M. Jarju

Quantum computing represents a revolutionary leap in computational power, leveraging the principles of quantum mechanics to process information in fundamentally new ways. Unlike classical computers, which use bits to represent data as 0s or 1s, quantum computers use quantum bits or qubits, enabling the phenomena of superposition and entanglement to perform complex calculations more efficiently (Nielsen & Chuang, 2010). This article explores the basic principles of quantum computing, the different models and algorithms that have been developed, and the current state of quantum hardware. The power of quantum computing lies in its ability to solve certain types of problems exponentially faster than classical computers. For instance, Shor's algorithm can factorize large integers in polynomial time, posing a significant threat to classical encryption methods (Shor, 1997). Similarly, Grover's algorithm provides a quadratic speedup for unstructured search problems, showcasing the potential for dramatic improvements in database search capabilities (Grover, 1996). These algorithms exemplify how quantum computing can revolutionize fields that rely on complex computations. Quantum hardware, however, is still in its nascent stage, with significant challenges to be overcome. Current quantum computers, such as those developed by IBM and Google, have demonstrated quantum supremacy but are limited by issues of qubit coherence and error rates (Arute et al., 2019). Quantum error correction and the development of more stable qubit technologies are critical areas of ongoing research (Preskill, 2018). Despite these challenges, recent advancements in quantum hardware and algorithms continue to drive the field forward, promising transformative impacts on industries such as cryptography, drug discovery, and artificial intelligence. As quantum computing continues to advance, it holds the promise of solving problems that are currently intractable for classical computers, paving the way for unprecedented technological and scientific advancements (Shor, 1997; Grover, 1996). This article provides a comprehensive overview of the current landscape of quantum computing, discussing its foundational principles, key algorithms, hardware challenges, and potential applications. By understanding these aspects, we can better appreciate the profound implications of quantum computing for the future of technology and science.

•Aug 11, 2025•2 citations

Comment on the Quantum Supremacy Claim by Google

Anirudh Reddy, Benjamin Perez-García, Adenilton José da Silva +1 more

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.

arXiv:2108.13862•Aug 29, 2021•0 citations

Quantum Computing and Artificial Intelligence: Progress, Possibilities and Gaps

Neelesh Agarwal, Kiran Kumar Makam, Deepak Kumar Yadav

Artificial Intelligence (AI) has been evolving at a very rapid pace, with increase in compute power, thus reshaping how complex problems are handled and interpreted from vast amounts of information. AI and newly emerging Quantum Computing have each made significant strides in recent years. Quantum computing has surfaced as a promising new paradigm that leverages on unique quantum phenomena such as like superposition and entanglement to potentially deliver dramatic gains in computational power. Increasingly, researchers are combining these distinct fields into "quantum AI," exploring ways to harness quantum devices for data-intensive tasks, advanced optimisation, and even tentative investigations into emergent machine "awareness." Already researchers have established the quantum advantage over classical AI. This paper outlines the fundamental aspects of AI with respect to quantum computing. It also surveys possible benefits for deep learning and optimization, and considers key concerns related to hardware readiness, algorithmic design, and ethical frameworks. By mapping current progress and pinpointing ongoing hurdles, we provide an entry-level guide to quantum AI's prospects and the steps required for its real-world deployment.

•May 1, 2025•0 citations
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).
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.
Quantum computing has progressed from theoretical speculation to experimental realization, leading to milestone demonstrations that claim computational superiority over classical systems. Among these milestones, quantum supremacy experiments have attracted considerable attention by showcasing tasks that are infeasible for classical computation within reasonable time limits. However, the practical value of such demonstrations remains a subject of debate. This paper critically evaluates the distinction between quantum supremacy and quantum utility, emphasizing their conceptual differences, experimental foundations, and real-world relevance. By examining key experimental results, algorithmic developments, and benchmarking approaches, the study argues that quantum utility-defined by practical, application-oriented performance-provides a more meaningful metric for long-term progress. The paper highlights the limitations of supremacy-based demonstrations and discusses pathways toward achieving utility-driven quantum advantage in the near and long term.
Abstract Quantum computing leverages fundamental quantum-mechanical phenomena—most notably superposition, entanglement, and quantum tunneling—to perform computations in ways that differ fundamentally from classical digital processing. Compared to conventional computing architectures, quantum systems promise significant reductions in computational time and potentially lower energy consumption for specific classes of problems. These advantages, combined with advances in nanoscale engineering and the slowing of traditional hardware scaling trends such as Moore’s Law, have led to substantial commercial and national-security-driven investments in quantum technologies over the past decade. A major milestone was reached when Google announced the experimental demonstration of “quantum supremacy,” showing that a quantum processor could execute a specific computational task infeasible for a classical supercomputer within practical time constraints. Although the demonstrated problem had no immediate practical application, this achievement marked a crucial step toward the development of quantum systems capable of delivering real-world computational advantages and provided a more precise technical framing of the concept of quantum advantage. Despite the fact that the mathematical foundations, programming models, and principal quantum algorithms were established in the 1990s, quantum computing remained largely confined to a specialized research community for decades. Today, the increasing accessibility of cloud-based quantum hardware calls for a broader dissemination of implementation-oriented knowledge among researchers and practitioners in computer science, software engineering, and related fields. The quantum programming paradigm differs fundamentally from classical programming models and often relies on physical and algebraic notations that may pose barriers to traditionally trained computer scientists. This series of articles provides a self-contained and concise introduction to quantum computing and its core algorithms, with a strong emphasis on practical implementation. Given that real quantum processors—such as those accessible via the IBM quantum ecosystem—are now available as cloud services, experimental validation can be conducted both on simulators and on actual hardware for small-scale inputs. While other platforms such as Rigetti and IonQ also offer cloud-based quantum computing services, this review focuses exclusively on the IBM quantum computing ecosystem.
Quantum computing represents a revolutionary leap in computational power, leveraging the principles of quantum mechanics to process information in fundamentally new ways. Unlike classical computers, which use bits to represent data as 0s or 1s, quantum computers use quantum bits or qubits, enabling the phenomena of superposition and entanglement to perform complex calculations more efficiently (Nielsen & Chuang, 2010). This article explores the basic principles of quantum computing, the different models and algorithms that have been developed, and the current state of quantum hardware. The power of quantum computing lies in its ability to solve certain types of problems exponentially faster than classical computers. For instance, Shor's algorithm can factorize large integers in polynomial time, posing a significant threat to classical encryption methods (Shor, 1997). Similarly, Grover's algorithm provides a quadratic speedup for unstructured search problems, showcasing the potential for dramatic improvements in database search capabilities (Grover, 1996). These algorithms exemplify how quantum computing can revolutionize fields that rely on complex computations. Quantum hardware, however, is still in its nascent stage, with significant challenges to be overcome. Current quantum computers, such as those developed by IBM and Google, have demonstrated quantum supremacy but are limited by issues of qubit coherence and error rates (Arute et al., 2019). Quantum error correction and the development of more stable qubit technologies are critical areas of ongoing research (Preskill, 2018). Despite these challenges, recent advancements in quantum hardware and algorithms continue to drive the field forward, promising transformative impacts on industries such as cryptography, drug discovery, and artificial intelligence. As quantum computing continues to advance, it holds the promise of solving problems that are currently intractable for classical computers, paving the way for unprecedented technological and scientific advancements (Shor, 1997; Grover, 1996). This article provides a comprehensive overview of the current landscape of quantum computing, discussing its foundational principles, key algorithms, hardware challenges, and potential applications. By understanding these aspects, we can better appreciate the profound implications of quantum computing for the future of technology and science.
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.
Artificial Intelligence (AI) has been evolving at a very rapid pace, with increase in compute power, thus reshaping how complex problems are handled and interpreted from vast amounts of information. AI and newly emerging Quantum Computing have each made significant strides in recent years. Quantum computing has surfaced as a promising new paradigm that leverages on unique quantum phenomena such as like superposition and entanglement to potentially deliver dramatic gains in computational power. Increasingly, researchers are combining these distinct fields into "quantum AI," exploring ways to harness quantum devices for data-intensive tasks, advanced optimisation, and even tentative investigations into emergent machine "awareness." Already researchers have established the quantum advantage over classical AI. This paper outlines the fundamental aspects of AI with respect to quantum computing. It also surveys possible benefits for deep learning and optimization, and considers key concerns related to hardware readiness, algorithmic design, and ethical frameworks. By mapping current progress and pinpointing ongoing hurdles, we provide an entry-level guide to quantum AI's prospects and the steps required for its real-world deployment.