Pith. sign in

REVIEW 3 cited by

Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime

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 2405.07720 v4 pith:ZLRMIHPG submitted 2024-05-13 quant-ph

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

Twirling noise affecting quantum gates is essential in understanding and controlling errors, but applicable operations to noise are usually restricted by symmetries inherent in quantum gates. In this work, we propose symmetric Clifford twirling, a Clifford twirling utilizing only symmetric Clifford operators that commute with certain Pauli subgroups. We fully characterize how each Pauli noise is converted through the twirling and show that certain Pauli noise can be scrambled to a noise exponentially close to the global white noise. Moreover, we provide numerical demonstrations for highly structured circuits, such as Trotterized Hamiltonian simulation circuits, that noise effect on typical observables can be described by the global white noise. We further demonstrate that symmetric Clifford twirling and its hardware-efficient variant using only local symmetric Clifford operators can significantly accelerate the scrambling. These findings enable us to mitigate errors in non-Clifford operations with minimal sampling overhead in the early fault-tolerant regime.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms

    quant-ph 2025-09 accept novelty 7.0 of 10

    Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).

  2. Syndrome aware mitigation of logical errors

    quant-ph 2025-12 conditional novelty 6.0 of 10

    Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.

  3. Faster Probabilistic Error Cancellation

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A binomial-expansion reformulation of PEC, with deterministic shot allocation and truncation-based bias control, reduces the sampling overhead of quantum error mitigation.

Pith tools