Robust and Resource-Efficient Quantum Circuit Approximation
arXiv:2108.12714
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.
References in corpus (5)
- Synthesis of Quantum Logic Circuits
- A new quantum ripple-carry addition circuit
- Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- An Introduction to Cartan's KAK Decomposition for QC Programmers