2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
arXiv:2108.02099
Abstract
Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit architecture (connectivity) and instruction (gate) set. General-purpose quantum compilers work at the gate level and have little knowledge of the mathematical properties of quantum applications, missing further optimization opportunities. Existing application-specific compilers only apply advanced optimizations in the scheduling procedure and are restricted to the CNOT or CZ gate set. In this work, we develop a compiler, named 2QAN, to optimize quantum circuits for 2-local qubit Hamiltonian simulation problems, a framework which includes the important quantum approximate optimization algorithm (QAOA). In particular, we exploit the flexibility of permuting different operators in the Hamiltonian (no matter whether they commute) and propose permutation-aware techniques for qubit routing, gate optimization and scheduling to minimize compilation overhead. 2QAN can target different qubit topologies and different hardware gate sets. Compilation results on four applications (up to 50 qubits) and three quantum computers (namely, Google Sycamore, IBMQ Montreal and Rigetti Aspen) show that 2QAN outperforms state-of-the-art general-purpose compilers and application-specific compilers. Specifically, 2QAN can reduce the number of inserted SWAP gates by 11.5X, reduce overhead in hardware gate count by 68.5X, and reduce overhead in circuit depth by 21X. Experimental results on the Montreal device demonstrate that benchmarks compiled by 2QAN achieve the highest fidelity.
arXiv commentAdd comparison with application-specific compilers. Comments are welcome
References in corpus (28)
- Quantum Computing in the NISQ era and beyond
- A Quantum Approximate Optimization Algorithm
- Error mitigation for short-depth quantum circuits
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Time Optimal Control in Spin Systems
- Toward the first quantum simulation with quantum speedup
- Quantum Algorithms for Quantum Field Theories
- Optimal Quantum Circuits for General Two-Qubit Gates
- Optimal Creation of Entanglement Using a Two--Qubit Gate
- A random compiler for fast Hamiltonian simulation
- Mitigating measurement errors in multi-qubit experiments
- Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
- Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
- Compiling quantum circuits to realistic hardware architectures using temporal planners
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
- Timing and resource-aware mapping of quantum circuits to superconducting processors
- Circuit Transformations for Quantum Architectures
- Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model
- Designing calibration and expressivity-efficient instruction sets for quantum computing
- Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
- Term Grouping and Travelling Salesperson for Digital Quantum Simulation
- Heuristics for Quantum Compiling with a Continuous Gate Set
- A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors