Pith. sign in

REVIEW 2 cited by

When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits

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 2503.05943 v2 pith:EDZL4MB3 submitted 2025-03-07 quant-ph

When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits

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

The goal of benchmarking is to determine how far the output of a noisy system is from its ideal behavior; this becomes exceedingly difficult for large quantum systems where classical simulations become intractable. A common approach is to turn to circuits comprised of elements of the Clifford group (e.g., CZ, CNOT, $\pi$ and $\pi/2$ gates), which probe quantum behavior but are nevertheless efficient to simulate classically. However, there is some concern that these circuits may overlook error sources that impact the larger Hilbert space. In this manuscript, we show that for a broad class of error models these concerns are unwarranted. In particular, we show that, for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates. We discuss methods for extracting the fidelities of these Clifford proxy circuits in a manner that is robust to errors in state preparation and measurement and demonstrate these methods in simulation and on IBM Quantum's fleet of deployed heron devices.

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. 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. Noise Correlations as a Resource in Pauli-Twirled Circuits

    quant-ph 2026-03 conditional novelty 6.0

    Noise correlations increase the fidelity of randomly compiled Clifford circuits under a broad class of Gaussian noise.