Featuremetric benchmarking: Quantum computer benchmarks based on circuit features
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Non-Clifford Benchmarking via Ensemble Feature Selection
Ensemble Feature Selection trains a ridge-regression linear estimator on an ensemble of noisy channels to estimate process infidelity of non-Clifford gates, validated against IRB on IBM hardware with 0.01 precision ov...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.