Pith. sign in

REVIEW 1 cited by

Random matrix perspective on probabilistic error cancellation

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 2512.01957 v1 pith:CQ64POYY submitted 2025-12-01 quant-ph cond-mat.stat-mech

Random matrix perspective on probabilistic error cancellation

classification quant-ph cond-mat.stat-mech
keywords channelsquantumrandomcancellationerrormatrixnoisenoisy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Probabilistic error cancellation is an attempt to reverse the effect of dissipative noise channels on quantum computers by applying unphysical channels after the execution of a quantum algorithm on noisy hardware. We investigate on general grounds the properties of such unphysical quantum channels by considering a random matrix ensemble modeling noisy quantum algorithms. We show that the complex spectra of denoiser channels inherit their structure from random Lindbladians. Additional structure imposed by the locality of noise channels of the quantum computer emerges in terms of a hierarchy of timescales.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Improved sample complexity bound for sample-based Lindbladian simulation

    quant-ph 2026-05 unverdicted novelty 7.0

    Derives explicit sample complexity bound O(d t²/ε) for WML-based Lindbladian simulation, with typical-case O(t²/ε) when ||L||_∞² = O(1/d) and worst-case Ω(d t²/ε).