Benchmarking the computational power of quantum computers

• URL: http://arxiv.org/abs/2609.12146v1
• Date: Thu, 10 Sep 2026 19:24:52 GMT
• Title: Benchmarking the computational power of quantum computers
• Abstract summary: Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs.<n> Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems.<n>Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits.
• Score: 3.854708597918177
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.

Related papers

• Benchmarking quantum computers with any quantum algorithm [0.0]
  Application-based benchmarks are increasingly used to quantify and compare quantum computers' performance.<n>We present a method for creating scalable and efficient benchmarks from any quantum algorithm or application.
  arXiv  Detail & Related papers  (2025-08-07T18:11:22Z)
• Benchmarking fault-tolerant quantum computing hardware via QLOPS [2.0464713282534848]
  To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels.<n>Various fault-tolerant quantum computing schemes have been developed for different hardware platforms.<n>We propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes.
  arXiv  Detail & Related papers  (2025-07-16T08:31:51Z)
• Sequential Quantum Computing [41.94295877935867]
  We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple or heterogeneous quantum processors.<n>SQC overcomes the limitations of each type of quantum computer by combining their complementary strengths.<n>These results highlight SQC as a powerful and versatile approach for addressing complex quantum optimization problems.
  arXiv  Detail & Related papers  (2025-06-25T17:51:29Z)
• How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits [3.970891204847277]
  Small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits.<n>We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits.<n>We argue that, to tackle industry-scale classical optimization and machine learning problems, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered.
  arXiv  Detail & Related papers  (2024-11-15T18:22:46Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study [11.29246196323319]
  We describe NASA's work in assessing and advancing the potential of quantum computing. We discuss advances in algorithms, both near- and longer-term, and the results of our explorations on current hardware and with simulations. This work also includes physics-inspired classical algorithms that can be used at application scale today.
  arXiv  Detail & Related papers  (2024-06-21T19:05:42Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• The Future of Quantum Computing with Superconducting Qubits [2.6668731290542222]
  We see a branching point in computing paradigms with the emergence of quantum processing units (QPUs) Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Long term, we see hardware that exploits qubit connectivity in higher than 2D topologies to realize more efficient quantum error correcting codes.
  arXiv  Detail & Related papers  (2022-09-14T18:00:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.