Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns

TL;DR

This paper introduces deterministic, polynomial-time algorithms for compiling recurrent quantum circuit patterns, significantly improving efficiency for circuits used in quantum chemistry simulations on noisy hardware.

Contribution

The paper presents novel pattern-oriented quantum compilation algorithms that outperform existing methods on specific recurrent circuit patterns, especially in VQE applications.

Findings

Comparable CNOT count and depth to state-of-the-art compilers

Unmatched results on RyRz circuits

Efficient swapping strategy enhances compilation quality

Abstract

Current quantum processors are noisy, have limited coherence and imperfect gate implementations. On such hardware, only algorithms that are shorter than the overall coherence time can be implemented and executed successfully. A good quantum compiler must translate an input program into the most efficient equivalent of itself, getting the most out of the available hardware. In this work, we present novel deterministic algorithms for compiling recurrent quantum circuit patterns in polynomial time. In particular, such patterns appear in quantum circuits that are used to compute the ground state properties of molecular systems using the variational quantum eigensolver (VQE) method together with the RyRz heuristic wavefunction Ansatz. We show that our pattern-oriented compiling algorithms, combined with an efficient swapping strategy, produces - in general - output programs that are comparable to those obtained with state-of-art compilers, in terms of CNOT count and CNOT depth. In particular, our solution produces unmatched results on RyRz circuits.