Pith. sign in

REVIEW 3 cited by

Concepts and conditions for error suppression through randomized compiling

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 2212.07500 v1 pith:FUCCBZQC submitted 2022-12-14 quant-ph

Concepts and conditions for error suppression through randomized compiling

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

Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling also tailors non-Markovian errors into local stochastic Pauli noise and investigate the technique's limitations. We show through analysis and numerical results that randomized compiling alters errors in three distinct helpful ways. First, it prevents the coherent accumulation of errors (including hard to remove crosstalk effects) across gate cycles by destroying intercycle coherent correlations. Second, it converts individual gate cycle errors into Pauli noise. Finally, randomized compiling reduces the variability inherent to noisy devices. We confirm these theoretical predictions with the IBM Quantum Experience platform and describe experimental data that illustrates a drastic performance improvement across public devices. These results cement the importance of randomized compiling in near- and long-term quantum information processing.

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. Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor

    quant-ph 2026-05 unverdicted novelty 6.0

    A digital quantum processor simulates the 1D Fermi-Hubbard model on up to 120 qubits, observing spin-charge separation and achieving quantitative agreement with TDVP while running up to 3000 times faster in wall-clock...

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