Pith. sign in

REVIEW 3 cited by

Theory of mirror benchmarking and demonstration on a quantum computer

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2108.10431 v2 pith:B5NMQ7YR submitted 2021-08-23 quant-ph

Theory of mirror benchmarking and demonstration on a quantum computer

Karl Mayer , Alex Hall , Thomas Gatterman , Si Khadir Halit , Kenny Lee , Justin Bohnet , Dan Gresh , Aaron Hankin
show 3 more authors
Kevin Gilmore Justin Gerber John Gaebler
This is my paper
classification quant-ph
keywords benchmarkingmirrorcircuitsdatadecayfunctionnoiseperformance
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

A new class of protocols called mirror benchmarking was recently proposed to measure the system-level performance of quantum computers. These protocols involve circuits with random sequences of gates followed by mirroring, that is, inverting each gate in the sequence. We give a simple proof that mirror benchmarking leads to an exponential decay of the survival probability with sequence length, under the uniform noise assumption, provided the twirling group forms a 2-design. The decay rate is determined by a quantity that is a quadratic function of the error channel, and for certain types of errors is equal to the unitarity. This result yields a new method for estimating the coherence of noise. We present data from mirror benchmarking experiments run on the Honeywell System Model H1. This data constitutes a set of performance curves, indicating the success probability for random circuits as a function of qubit number and circuit depth.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. Sampling hard circuits with verifiably high fidelity

    quant-ph 2026-07 conditional novelty 8.0

    A 97-qubit experiment certifies a 0.284 fidelity lower bound for a 468-T-gate sampling circuit by combining spacetime-code error detection with the measured fidelity of an undoped Clifford reference.

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

  3. Benchmarking quantum devices beyond classical capabilities

    quant-ph 2025-02 unverdicted novelty 6.0

    Modified Quantum Volume test uses restricted universal circuits to directly determine heavy outputs without exponential classical simulation cost.