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

Quantum 2.0 Conference and Exhibition

A Quantum Computing Benchmark Based on Circuit Features

Xingxin Liu, Timothy J Proctor, Alaina Green, Norbert M. Linke

Published Jan 1, 2025• 0 citations
Publisher

Abstract

We propose a quantum computing benchmarking protocol based on multiple circuit features, demonstrated on IBM and IonQ systems, which outperforms traditional volumetric benchmarking by more accurately predicting hardware performance.
DOI
10.1364/quantum.2025.qw2a.2

Related papers

Featuremetric benchmarking: Quantum computer benchmarks based on circuit features

Timothy J Proctor, Tran, Anh, Xingxin Liu +4 more

Benchmarks that concisely summarize the performance of many-qubit quantum computers are essential for measuring progress towards the goal of useful quantum computation. In this work, we present a benchmarking framework that is based on quantifying how a quantum computer's performance on quantum circuits varies as a function of features of those circuits, such as circuit depth, width, two-qubit gate density, problem input size, or algorithmic depth. Our featuremetric benchmarking framework generalizes volumetric benchmarking -- a widely-used methodology that quantifies performance versus circuit width and depth -- and we show that it enables richer and more faithful models of quantum computer performance. We demonstrate featuremetric benchmarking with example benchmarks run on IBM Q and IonQ systems of up to 27 qubits, and we show how to produce performance summaries from the data using Gaussian process regression. Our data analysis methods are also of interest in the special case of volumetric benchmarking, as they enable the creation of intuitive two-dimensional capability regions using data from few circuits.

arXiv:2504.12575•Apr 17, 2025•4 citations

How to benchmark a 100-qubit quantum computer using fewer than 100 circuits.

Timothy J Proctor, Kenneth Rudinger, Stefan Seritan +6 more

•Mar 1, 2022•0 citations

Benchmarking quantum computers with any quantum algorithm

Stefan Seritan, Aditya Dhumuntarao, Aidan Wilber-Gauthier +5 more

Application-based benchmarks are increasingly used to quantify and compare quantum computers' performance. However, because contemporary quantum computers cannot run utility-scale computations, these benchmarks currently test this hardware's performance on ``small'' problem instances that are not necessarily representative of utility-scale problems. Furthermore, these benchmarks often employ methods that are unscalable, limiting their ability to track progress towards utility-scale applications. In this work, we present a method for creating scalable and efficient benchmarks from any quantum algorithm or application. Our subcircuit volumetric benchmarking (SVB) method runs subcircuits of varied shape that are ``snipped out'' from some target circuit, which could implement a utility-scale algorithm. SVB is scalable and it enables estimating a capability coefficient that concisely summarizes progress towards implementing the target circuit. We demonstrate SVB with experiments on IBM Q systems using a Hamiltonian block-encoding subroutine from quantum chemistry algorithms.

arXiv:2508.05754•Aug 7, 2025•3 citations

Scalable and targeted benchmarking of quantum computers

Timothy J Proctor, Kenneth Rudinger, Mohan Sarovar +3 more

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Construction and volumetric benchmarking of quantum computing noise models

Tom Weber, K. Borras, Karl Jansen +2 more

Abstract The main challenge of quantum computing on its way to scalability is the erroneous behaviour of current devices. Understanding and predicting their impact on computations is essential to counteract these errors with methods such as quantum error mitigation. Thus, it is necessary to construct and evaluate accurate noise models. However, the evaluation of noise models does not yet follow a systematic approach, making it nearly impossible to estimate the accuracy of a model for a given application. Therefore, we developed and present a systematic approach to benchmarking noise models for quantum computing applications. It compares the results of hardware experiments to predictions of noise models for a representative set of quantum circuits. We also construct a noise model containing five types of quantum noise and optimize its parameters using a series of training circuits. We compare its accuracy to other noise models by volumetric benchmarks involving typical variational quantum circuits. The model can easily be expanded by adding new quantum channels.

arXiv:2306.08427•Physica Scripta•Apr 18, 2024•8 citations

An Effective Framework for Full-Stack Benchmarking of Quantum Computers

Michele Amoretti

•Apr 26, 2021•5 citations
Benchmarks that concisely summarize the performance of many-qubit quantum computers are essential for measuring progress towards the goal of useful quantum computation. In this work, we present a benchmarking framework that is based on quantifying how a quantum computer's performance on quantum circuits varies as a function of features of those circuits, such as circuit depth, width, two-qubit gate density, problem input size, or algorithmic depth. Our featuremetric benchmarking framework generalizes volumetric benchmarking -- a widely-used methodology that quantifies performance versus circuit width and depth -- and we show that it enables richer and more faithful models of quantum computer performance. We demonstrate featuremetric benchmarking with example benchmarks run on IBM Q and IonQ systems of up to 27 qubits, and we show how to produce performance summaries from the data using Gaussian process regression. Our data analysis methods are also of interest in the special case of volumetric benchmarking, as they enable the creation of intuitive two-dimensional capability regions using data from few circuits.
Application-based benchmarks are increasingly used to quantify and compare quantum computers' performance. However, because contemporary quantum computers cannot run utility-scale computations, these benchmarks currently test this hardware's performance on ``small'' problem instances that are not necessarily representative of utility-scale problems. Furthermore, these benchmarks often employ methods that are unscalable, limiting their ability to track progress towards utility-scale applications. In this work, we present a method for creating scalable and efficient benchmarks from any quantum algorithm or application. Our subcircuit volumetric benchmarking (SVB) method runs subcircuits of varied shape that are ``snipped out'' from some target circuit, which could implement a utility-scale algorithm. SVB is scalable and it enables estimating a capability coefficient that concisely summarizes progress towards implementing the target circuit. We demonstrate SVB with experiments on IBM Q systems using a Hamiltonian block-encoding subroutine from quantum chemistry algorithms.
Abstract The main challenge of quantum computing on its way to scalability is the erroneous behaviour of current devices. Understanding and predicting their impact on computations is essential to counteract these errors with methods such as quantum error mitigation. Thus, it is necessary to construct and evaluate accurate noise models. However, the evaluation of noise models does not yet follow a systematic approach, making it nearly impossible to estimate the accuracy of a model for a given application. Therefore, we developed and present a systematic approach to benchmarking noise models for quantum computing applications. It compares the results of hardware experiments to predictions of noise models for a representative set of quantum circuits. We also construct a noise model containing five types of quantum noise and optimize its parameters using a series of training circuits. We compare its accuracy to other noise models by volumetric benchmarks involving typical variational quantum circuits. The model can easily be expanded by adding new quantum channels.