Pith. sign in

REVIEW 1 cited by

Benchmarking near-term quantum computers via random circuit sampling

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 2105.05232 v2 pith:JMJIWTQ4 submitted 2021-05-11 quant-ph

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

The increasing scale of near-term quantum hardware motivates the need for efficient noise characterization methods, since qubit and gate level techniques cannot capture crosstalk and correlated noise in many qubit systems. While scalable approaches, such as cycle benchmarking, are known for special classes of quantum circuits, the characterization of noise in general circuits with non-Clifford gates has been an unreachable task. We develop an algorithm that can sample-efficiently estimate the total amount of noise induced by a layer of arbitrary non-Clifford gates, including all crosstalks, and experimentally demonstrate the method on IBM Quantum hardware. Our algorithm is inspired by Google's quantum supremacy experiment and is based on random circuit sampling. In their paper, Google observed that their experimental linear cross entropy was consistent with a simple uncorrelated noise model, and claimed this coincidence indicated that the noise in their device was uncorrelated -- a key step in hardware development towards fault tolerance. As an application, we show that our result provides formal evidence to support such a conclusion.

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. Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity

    quant-ph 2025-02 conditional novelty 5.0 of 10

    Random circuits satisfy an ergodicity condition for positive-coefficient polynomials, and its deviation can benchmark quantum chip fidelity, recovering and generalizing linear cross-entropy benchmarking.

Pith tools