Pith. sign in

REVIEW 9 cited by

Quality, Speed, and Scale: three key attributes to measure the performance of near-term quantum computers

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.14108 v2 pith:JUOXICHG submitted 2021-10-27 quant-ph

classification quant-ph
keywords quantumperformancequalityscalespeedattributesclopscomputing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Defining the right metrics to properly represent the performance of a quantum computer is critical to both users and developers of a computing system. In this white paper, we identify three key attributes for quantum computing performance: quality, speed, and scale. Quality and scale are measured by quantum volume and number of qubits, respectively. We propose a speed benchmark, using an update to the quantum volume experiments that allows the measurement of Circuit Layer Operations Per Second (CLOPS) and identify how both classical and quantum components play a role in improving performance. We prescribe a procedure for measuring CLOPS and use it to characterize the performance of some IBM Quantum systems.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

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

  1. Self-Specializing Vision-Language Transmon Chip Calibration in a Physics-Grounded Environment

    quant-ph 2026-07 conditional novelty 6.5 of 10

    A vision-language agent calibrates drifting transmon chips in a physics-grounded simulator and specializes via a gradient-free, human-readable device note that raises worst-case CZ fidelity under budget pressure.

  2. Performance Model for Hybrid Quantum-Classical Workflows

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A two-level runtime model decomposes hybrid quantum-classical cycles into quantum, classical, and communication time, allowing a communication-to-computation ratio to classify workflows as compute- or communication-bound.

  3. Accelerating qubit reset through the Mpemba effect

    quant-ph 2026-02 conditional novelty 6.0 of 10

    A single entangling gate that turns slow-decaying local qubit coherences into fast-decaying two-qubit coherences shortens passive reset by up to T2/T1 (about 30-50% time reduction) in the T2>T1 regime.

  4. Quantum Computer Benchmarking: An Explorative Systematic Literature Review

    quant-ph 2025-09 conditional novelty 6.0 of 10

    A systematic review of 329 quantum benchmarking studies yields a stack-aligned taxonomy and definitions for hardware-, software-, and application-focused benchmarks.

  5. Real-Time Dynamics in a (2+1)-D Gauge Theory: The Stringy Nature on a Superconducting Quantum Simulator

    quant-ph 2025-07 conditional novelty 6.0 of 10

    On a 144-qubit superconducting processor, the authors observe the real-time dynamics of confining electric strings in a (2+1)-D Z2 gauge theory, distinguishing longitudinal yo-yo modes from transverse bending and demo...

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

    quant-ph 2026-07 conditional novelty 5.5 of 10

    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.

  7. On the Figures of Merit for Quantum Software Security: Toward a Benchmarking Rubric

    cs.CR 2026-08 conditional novelty 5.0 of 10

    The paper defines a structured set of Security Figures of Merit and a normalization and aggregation rubric that turns incomparable quantum software security metrics into a composite Quantum Software Security Posture score.

  8. A Cost-Effective Quantum Boolean-Phase SWAP Gate with Only Two CNOT Gates

    quant-ph 2025-07 reject novelty 3.0 of 10

    A two-CNOT swap-like gate is introduced whose transpiled version has lower gate count and depth than the standard three-CNOT SWAP, at the cost of user-selected phase distortions.

  9. Localized Kernel Methods for Signal Processing

    eess.SP 2025-08 reject novelty 2.0 of 10

    The manuscript is internally inconsistent: the abstract describes localized kernel signal processing, while the body is a different paper on quantum task scheduling, leaving the abstract's claims entirely unsupported.

Pith tools