Application-Oriented Performance Benchmarks for Quantum Computing

Thomas Lubinski, Sonika Johri, Paul D. Varosy, Jeremiah Coleman, Luning Zhao, Jason Necaise, Charles H. Baldwin, Karl Ulrich Mayer, Timothy Proctor

arXiv (Cornell University) · 2021 · 15 citations · 0 references

DOIFull text

Open access

Concepts

TL;DR

The authors introduce an open‑source suite of quantum application‑oriented benchmarks designed to measure the effectiveness of quantum hardware at executing quantum applications and to anticipate advances in the field over the next five years. The suite probes hardware performance by mapping result fidelity as a function of circuit width and depth for a variety of algorithms, estimating both quality and time‑to‑solution, and is built for broad accessibility with benchmarks covering many well‑known quantum computing algorithms.

Abstract

In this work we introduce an open source suite of quantum application-oriented performance benchmarks that is designed to measure the effectiveness of quantum computing hardware at executing quantum applications. These benchmarks probe a quantum computer's performance on various algorithms and small applications as the problem size is varied, by mapping out the fidelity of the results as a function of circuit width and depth using the framework of volumetric benchmarking. In addition to estimating the fidelity of results generated by quantum execution, the suite is designed to benchmark certain aspects of the execution pipeline in order to provide end-users with a practical measure of both the quality of and the time to solution. Our methodology is constructed to anticipate advances in quantum computing hardware that are likely to emerge in the next five years. This benchmarking suite is designed to be readily accessible to a broad audience of users and provides benchmarks that correspond to many well-known quantum computing algorithms.