Pith. sign in

REVIEW 2 cited by

Resource Efficient Zero Noise Extrapolation with Identity Insertions

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 2003.04941 v1 pith:4KUH63CU submitted 2020-03-10 quant-ph

classification quant-ph
keywords quantumerrorsgategatesidentitynoiseaccuratecalculations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In addition to readout errors, two-qubit gate noise is the main challenge for complex quantum algorithms on noisy intermediate-scale quantum (NISQ) computers. These errors are a significant challenge for making accurate calculations for quantum chemistry, nuclear physics, high energy physics, and other emerging scientific and industrial applications. There are two proposals for mitigating two-qubit gate errors: error-correcting codes and zero-noise extrapolation. This paper focuses on the latter, studying it in detail and proposing modifications to existing approaches. In particular, we propose a random identity insertion method (RIIM) that can achieve competitive asymptotic accuracy with far fewer gates than the traditional fixed identity insertion method (FIIM). For example, correcting the leading order depolarizing gate noise requires $n_\text{CNOT}+2$ gates for RIIM instead of $3n_\text{CNOT}$ gates for FIIM. This significant resource saving may enable more accurate results for state-of-the-art calculations on near term quantum hardware.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Enhanced Extrapolation-Based Quantum Error Mitigation Using Repetitive Structure in Quantum Algorithms

    quant-ph 2025-07 conditional novelty 5.0 of 10

    A block-level fidelity characterization method that corrects the success probability of structured quantum algorithms, outperforming standard ZNE in high-noise Grover search.

  2. ProvideQ: A Quantum Optimization Toolbox

    quant-ph 2025-07 conditional novelty 4.0 of 10

    ProvideQ is a configurable toolbox for composing classical and quantum optimization subroutines, demonstrated on small VRP instances where the classical solver outperforms the hybrid quantum approach.

Pith tools