Architecture aware compilation of quantum circuits via lazy synthesis

TL;DR

This paper introduces a meta-heuristic combining SWAP insertion and architecture-aware synthesis to improve quantum circuit compilation, significantly reducing entangling gate overhead.

Contribution

It proposes two new compilation algorithms that integrate SWAP insertion with greedy synthesis, advancing quantum circuit compilation methods.

Findings

Significant reduction in entangling gate overhead.

Improved performance over state-of-the-art techniques.

Effective for standard quantum circuit classes.

Abstract

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 new compilation algorithms based on this meta-heuristic and compare their performances to state-of-the-art quantum circuit compilation techniques for several standard classes of quantum circuits and show significant reduction in the entangling gate overhead due to compilation.