Architecture aware compilation of quantum circuits via lazy synthesis

Abstract

Qubit routing is a key problem for 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.

Open source variational quantum eigensolver extension of the quantum learning machine for quantum chemistry

“…82 It includes a wide variety of low-level tools useful for writing, compiling and optimizing quantum circuits. [83][84][85][86][87] These tools come in the form of so-called "plugins" that can be combined or stacked upon another to construct a quantum compilation chain.…”

“…QLM is a complete environment designed for quantum software programmers, engineers and researchers 82 . It includes a wide variety of low‐level tools useful for writing, compiling and optimizing quantum circuits 83–87 . These tools come in the form of so‐called “plugins” that can be combined or stacked upon another to construct a quantum compilation chain.…”

Phase polynomials synthesis algorithms for NISQ architectures and beyond

“…To evaluate the performances of our algorithm we generate random parity tables for 7, 10, 13 and 16 qubits with a density varying from 1% to 100%. We compare our results to the state of the art, namely the Gray-Synth algorithm [28] and the Lazy-Synth framework [25]. Throughout this paper, we have always set the Lazy-Synth depth parameter to 3 for its recursive search.…”

“…This approach is typically applied on subsets of circuits that can be represented by high-level constructs such as linear reversible functions. These circuits can then be put together to form a complete architecture compliant quantum circuit [25,26]. An important building block in this compilation scheme is the synthesis of circuits composed exclusively of CNOT and R Z gates.…”

“…An altered version of this algorithm was also recently incorporated by Gheorghiu et al in a slice-and-build algorithm that optimizes a given quantum circuit while taking into account the connectivity constraints imposed by the physical hardware architecture [26]. In a recent work and with a similar goal, a framework composed of greedy architecture-aware synthesis routines for the compilation of quantum circuits was presented in [25].…”