Pith. sign in

REVIEW 5 cited by

SupermarQ: A Scalable Quantum Benchmark Suite

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 2202.11045 v3 pith:XWPUK35E submitted 2022-02-22 quant-ph cs.AR

SupermarQ: A Scalable Quantum Benchmark Suite

classification quant-ph cs.AR
keywords quantumbenchmarksupermarqsuitebenchmarkingmeasureperformancescalable
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The emergence of quantum computers as a new computational paradigm has been accompanied by speculation concerning the scope and timeline of their anticipated revolutionary changes. While quantum computing is still in its infancy, the variety of different architectures used to implement quantum computations make it difficult to reliably measure and compare performance. This problem motivates our introduction of SupermarQ, a scalable, hardware-agnostic quantum benchmark suite which uses application-level metrics to measure performance. SupermarQ is the first attempt to systematically apply techniques from classical benchmarking methodology to the quantum domain. We define a set of feature vectors to quantify coverage, select applications from a variety of domains to ensure the suite is representative of real workloads, and collect benchmark results from the IBM, IonQ, and AQT@LBNL platforms. Looking forward, we envision that quantum benchmarking will encompass a large cross-community effort built on open source, constantly evolving benchmark suites. We introduce SupermarQ as an important step in this direction.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

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

  1. Helios: A 98-qubit trapped-ion quantum computer

    quant-ph 2025-11 accept novelty 7.0

    Helios achieves 98 qubits with single-qubit gate infidelity 2.5(1)×10^{-5}, two-qubit 7.9(2)×10^{-4}, and SPAM 4.8(6)×10^{-4}, enabling circuits beyond classical simulation.

  2. Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization

    quant-ph 2026-07 conditional novelty 6.0

    A learning-to-rank model over feature-model-sampled Qiskit transpiler pass configurations reliably outperforms Qiskit's fixed optimization levels on two-qubit gate reduction.

  3. InferQ: A Database-Oriented Benchmark for Quantum Circuits Simulation

    quant-ph 2026-07 conditional novelty 6.0

    InferQ generates 202,975 compositional quantum circuits as SQL workloads and shows RDBMS engines beat Qiskit Aer on peak memory for ~51% of them, with ML selectors predicting the best backend at up to 95-97% accuracy.

  4. 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.

  5. A Physics-Informed Neuro-Fuzzy Framework for Quantum Error Attribution

    quant-ph 2026-02 reject novelty 5.0

    An ANFIS classifier with a Bhattacharyya-distance veto reports 89.5% effective accuracy separating quantum hardware noise from software bugs, but its main features presuppose the ground-truth circuit and its veto thre...