Pith. sign in

REVIEW 1 cited by

Defining Standard Strategies for Quantum Benchmarks

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 2303.02108 v1 pith:GKTH2Y6O submitted 2023-03-03 quant-ph

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

As quantum computers grow in size and scope, a question of great importance is how best to benchmark performance. Here we define a set of characteristics that any benchmark should follow -- randomized, well-defined, holistic, device independent -- and make a distinction between benchmarks and diagnostics. We use Quantum Volume (QV) [1] as an example case for clear rules in benchmarking, illustrating the implications for using different success statistics, as in Ref. [2]. We discuss the issue of benchmark optimizations, detail when those optimizations are appropriate, and how they should be reported. Reporting the use of quantum error mitigation techniques is especially critical for interpreting benchmarking results, as their ability to yield highly accurate observables comes with exponential overhead, which is often omitted in performance evaluations. Finally, we use application-oriented and mirror benchmarking techniques to demonstrate some of the highlighted optimization principles, and introduce a scalable mirror quantum volume benchmark. We elucidate the importance of simple optimizations for improving benchmarking results, and note that such omissions can make a critical difference in comparisons. For example, when running mirror randomized benchmarking, we observe a reduction in error per qubit from 2% to 1% on a 26-qubit circuit with the inclusion of dynamic decoupling.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries

    quant-ph 2025-02 conditional novelty 7.0 of 10

    Fat-Tree QRAM pipelines up to log(N) simultaneous queries to a size-N memory in about log(N) time, using only about twice the hardware of a bucket-brigade QRAM.

Pith tools