2QAN: Efficient Quantum Circuit Compilation for Hamiltonian Simulation

2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms

We develop a compiler, named 2qan, to optimize quantum circuits for 2-local qubit simulation problems, a framework which includes the important quantum approximate optimization algorithm (qaoa).We propose permutation-aware qubit mapping, qubit routing, gate optimization and scheduling techniques to minimize the compilation overhead.We evaluate 2qan by compiling three applications (up to 50 qubits) onto three quantum computers that have different qubit topologies and hardware two-qubit gates, namely, google sycamore, ibmq montreal and rigetti aspen.Compared to state-of-the-art quantum compilers, 2qan can reduce the number of inserted swap gates by up to 11.5x, reduce overhead in hardware gate count by up to 30.7x, and reduce overhead in circuit depth by up to 21.5x.Experimental results on the montreal device demonstrate that benchmarks compiled by 2qan achieve highest fidelity.