Pith. sign in

REVIEW 2 cited by

Application-Oriented Performance Benchmarks for Quantum Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.03137 v3 pith:BMOMJJYQ submitted 2021-10-07 quant-ph

Application-Oriented Performance Benchmarks for Quantum Computing

classification quant-ph
keywords quantumbenchmarkscomputingdesignedperformancesuitealgorithmsapplication-oriented
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Fidelity-per-Cost: A Metric for Evaluation of Quantum Computing Systems

    quant-ph 2026-07 conditional novelty 5.5

    Cost-aware ranking of cloud QPUs via QFC disagrees with fidelity-only ranking; billing model, not hardware, fixes how the score scales with shot count.

  2. Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

    quant-ph 2026-06 unverdicted novelty 5.0

    An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...