Pith. sign in

REVIEW 1 cited by

Robust and Resource-Efficient Quantum Circuit Approximation

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 2108.12714 v1 pith:GPKP74O3 submitted 2021-08-28 quant-ph cs.ET

classification quant-phcs.ET
keywords circuitapproximationquantumreduceapproachapproximationscircuitscnot
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present QEst, a procedure to systematically generate approximations for quantum circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for scalability with procedures to 1) reduce circuit length using approximate synthesis, 2) improve fidelity by running circuits that represent key samples in the approximation space, and 3) reason about approximation upper bound. Our evaluation results indicate that our approach of "dissimilar" approximations provides close fidelity to the original circuit. Overall, the results indicate that QEst can reduce CNOT gate count by 30-80% on ideal systems and decrease the impact of noise on existing and near-future quantum systems.

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. Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count

    quant-ph 2025-07 conditional novelty 5.0 of 10

    A dynamic grouping plus ZX-calculus lookahead framework reduces two-qubit gate counts in quantum circuits by 18% on average across 25 benchmarks.

Pith tools