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 (19)
- Quantum Computing in the NISQ era and beyond
- The theory of variational hybrid quantum-classical algorithms
- Measure for the Degree of Non-Markovian Behavior of Quantum Processes in Open Systems
- Synthesis of Quantum Logic Circuits
- Distance measures to compare real and ideal quantum processes
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Quantum advantage with shallow circuits
- Quantum-assisted quantum compiling
- A new quantum ripple-carry addition circuit
- Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
- Quantum Circuits for Isometries
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- Asymptotically Optimal Topological Quantum Compiling
- Qiskit Backend Specifications for OpenQASM and OpenPulse Experiments
- Compiling quantum algorithms for architectures with multi-qubit gates
- An Introduction to Cartan's KAK Decomposition for QC Programmers
- QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
- Introduction to UniversalQCompiler