Architecture aware compilation of quantum circuits via lazy synthesis

Simon Martiel, Timothée Goubault de Brugière

Published 2020-12-17Version 1

Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints. Usually, this problem is tackled via either SWAP insertion techniques or re-synthesis of portions of the circuit using architecture aware synthesis algorithms. In this work, we propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We propose two concrete compilation algorithms based on this meta-heuristic and compare their performances to SWAP insertion techniques for several standard classes of quantum circuits. We compare our approach with existing universal compilation techniques and show significant reduction in the entangling gate overhead due to compilation.