Pith. sign in

REVIEW 1 cited by

Unified approach to data-driven quantum error mitigation

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 2011.01157 v2 pith:D5AGMJB2 submitted 2020-11-02 quant-ph

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

Achieving near-term quantum advantage will require effective methods for mitigating hardware noise. Data-driven approaches to error mitigation are promising, with popular examples including zero-noise extrapolation (ZNE) and Clifford data regression (CDR). Here we propose a novel, scalable error mitigation method that conceptually unifies ZNE and CDR. Our approach, called variable-noise Clifford data regression (vnCDR), significantly outperforms these individual methods in numerical benchmarks. vnCDR generates training data first via near-Clifford circuits (which are classically simulable) and second by varying the noise levels in these circuits. We employ a noise model obtained from IBM's Ourense quantum computer to benchmark our method. For the problem of estimating the energy of an 8-qubit Ising model system, vnCDR improves the absolute energy error by a factor of 33 over the unmitigated results and by factors 20 and 1.8 over ZNE and CDR, respectively. For the problem of correcting observables from random quantum circuits with 64 qubits, vnCDR improves the error by factors of 2.7 and 1.5 over ZNE and CDR, respectively.

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. Learning Clifford-structured quantum unitaries and Hamiltonians

    quant-ph 2026-08 conditional novelty 7.0 of 10

    A quasipolynomial-time algorithm finds the closest Clifford unitary to an unknown unitary, enabling tomography of unitaries and Hamiltonians with bounded Clifford decomposition size.

Pith tools