A generic multi-Pauli compilation framework for limited connectivity

TL;DR

This paper introduces a versatile compilation framework for quantum circuits with limited connectivity, leveraging a novel Clifford Executive Representation to efficiently synthesize multiple non-commuting Pauli operators and improve circuit performance.

Contribution

It presents a new generic compilation approach that extends existing techniques by handling multiple Pauli operators simultaneously, including non-commuting ones, and enables effective Clifford circuit synthesis.

Findings

Outperforms state-of-the-art methods on VQE circuits

Efficient synthesis of multiple non-commuting Pauli operators

Effective Clifford circuit synthesis achieved

Abstract

Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particularly suitable for limited connectivity, that extends many of the known techniques for Pauli network synthesis. Our compilation method, built on the introduced Clifford Executive Representation, stands out by considering the implementation of multiple Pauli operators at once, which are not necessarily commuting. The proposed technique also allows for effective Clifford circuit synthesis. We benchmark our methods against circuits resulting from the Variational Quantum Eigensolver algorithm and the results show that the proposed methods outperform the state-of-the-art.