We define the quantum utility performance metric and three milestones, which define quantum utility as measured in some limited context. Current and previous-generation annealing quantum systems can outperform classical solvers on a variety of input classes, on Milestones 0 and 1; our tests of Milestone 2 show positive results on a small set of inputs. Characterization of the input properties that drive these outcomes suggests that future tests will yield more widespread successes on these and more challenging milestones.
We define the quantum utility performance metric and three milestones, which define quantum utility as measured in some limited context. Current and previous-generation annealing quantum systems can outperform classical solvers on a variety of input classes, on Milestones 0 and 1; our tests of Milestone 2 show positive results on a small set of inputs. Characterization of the input properties that drive these outcomes suggests that future tests will yield more widespread successes on these and more challenging milestones.
We introduce quantum utility , a new approach to evaluating quantum performance that aims to capture the user experience by considering the overhead costs associated with a quantum computation. A demonstration of quantum utility by the quantum processing unit (QPU) shows that the QPU can outperform classical solvers at some tasks of interest to practitioners, when considering the costs of computational overheads. A milestone is a test of quantum utility that is restricted to a specific subset of overhead costs and input types. We illustrate this approach with a benchmark study of a D-Wave annealing-based QPU versus seven classical solvers for a variety of problems in heuristic optimization. We consider overhead costs that arise in standalone use of the D-Wave QPU (as opposed to a hybrid computation). We define three early milestones on the path to broad-scale quantum utility. Milestone 0 is the purely quantum computation with no overhead costs and is demonstrated implicitly by positive results on other milestones. We evaluate the performance of a D-Wave Advantage QPU with respect to milestones 1 and 2: For milestone 1, the QPU outperformed all classical solvers in 99% of our tests. For milestone 2, the QPU outperformed all classical solvers in 19% of our tests, and the scenarios in which the QPU found success correspond to cases where classical solvers most frequently failed. This approach of isolating subsets of overheads for separate analysis reveals distinct mechanisms in quantum versus classical performance, which explain the observed differences in patterns of success and failure. We present evidence-based arguments that these distinctions bode well for annealing quantum processors to support demonstrations of quantum utility on ever-expanding classes of inputs and with more challenging milestones in the very near future.
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.
We propose a practical, physics-inspired benchmarking suite to challenge both quantum and classical computers by mapping real-time quantum dynamics to a common optimization format. Using a parallel-in-time encoding, we convert the real-time propagator of an n -qubit, possibly non-Hermitian, Hamiltonian into quadratic unconstrained binary optimization (QUBO) instances that are executable in a solver-agnostic manner on quantum annealers and classical optimizers alike. This enables direct, like-for-like performance comparisons across fundamentally different computational paradigms. To stress-test the framework, we consider eight representative dynamical models spanning single-qubit rotations, multiqubit entangling gates (Bell, Greenberger-Horne-Zeilinger, cluster), and P T -symmetric and other non-Hermitian generators, and evaluate success probability and time to solution as standard benchmarking metrics. Applying this method to two generations of D-Wave quantum annealers and to state-of-the-art classical solvers (simulated annealing and the graphics-processing unit–accelerated VeloxQ), we find that Advantage2 consistently outperforms its predecessor, while VeloxQ retains the shortest absolute run-times, reflecting the maturity of classical heuristics. We further extend the benchmarks to large-scale instances ( N ≈ 10 5 ), establishing a demanding classical baseline for future hardware. Together, these results position the parallel-in-time QUBO framework as a versatile and physically motivated test bed for quantitatively tracking progress toward quantum-competitive simulation of dynamical systems.
Several benchmarks have been proposed to holistically measure quantum computing performance. While some have focused on the end user’s perspective (e.g., in application-oriented benchmarks), the real industrial value taking into account the physical footprint of the quantum processor are not discussed. Different use-cases come with different requirements for size, weight, power consumption, or data privacy while demanding to surpass certain thresholds of fidelity, speed, problem size, or precision. This paper aims to incorporate these characteristics into a concept coined quantum utility, which demonstrates the effectiveness and practicality of quantum computers for various applications where quantum advantage – defined as either being faster, more accurate, or demanding less energy – is achieved over a classical machine of similar size, weight, and cost. To successively pursue quantum utility, a level-based classification scheme – constituted as application readiness levels (ARLs) – as well as extended classification labels are introduced. These are demonstratively applied to different quantum applications from the fields of quantum chemistry, quantum simulation, quantum machine learning, and data analysis followed by a brief discussion.
We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing properties. The calculation of Graver bases is exponentially hard (in general) on classical computers, so they not used for solving practical problems on commercial solvers. With a quantum annealer, however, it may be a viable approach to use them. We test two hybrid quantum-classical algorithms (on D-Wave)--one for computing Graver basis and a second for optimizing non-linear integer programs that utilize Graver bases--to understand the strengths and limitations of the practical quantum annealers available today. Our experiments suggest that with a modest increase in coupler precision--along with near-term improvements in the number of qubits and connectivity (density of hardware graph) that are expected--the ability to outperform classical best-in-class algorithms is within reach, with respect to non-linear integer optimization.
The central aim of quantum networks is to facilitate user connectivity via quantum channels, but there is an open need for benchmarking metrics to compare diverse quantum networks. Here, we propose a general framework for quantifying the performance of a quantum network by estimating the value created by connecting users through quantum channels. In this framework, we define the quantum network utility metric [Formula: see text] to capture the social and economic value of quantum networks. The proposed framework accommodates a variety of applications from secure communications to distributed sensing. As a case study, we investigate the example of distributed quantum computing in detail. We determine the scaling laws of quantum network utility, which suggest that distributed edge quantum computing has more potential for success than its classical equivalent. We believe the proposed utility-based framework will serve as a foundation for guiding and assessing the development of quantum network technologies and designs.