Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers

TL;DR

This paper introduces araQne, a quantum compiler that optimizes distributed quantum circuit execution by reordering gates to minimize inter-QPU communication costs in quantum data centers.

Contribution

The paper presents a novel gate reordering strategy within araQne that significantly reduces entanglement resources needed for distributed quantum computing.

Findings

Reordering gates reduces distribution cost by up to 50%.

araQne outperforms baseline approaches in minimizing entanglement usage.

Efficient gate reordering improves scalability of quantum data centers.

Abstract

Just as classical computing relies on distributed systems, the quantum computing era requires new kinds of infrastructure and software tools. Quantum networks will become the backbone of hybrid, quantum-augmented data centers, in which quantum algorithms are distributed over a local network of quantum processing units (QPUs) interconnected via shared entanglement. In this context, it is crucial to develop methods and software that minimize the number of inter-QPU communications. Here we describe key features of the quantum compiler araQne, which is designed to minimize distribution cost, measured by the number of entangled pairs required to distribute a monolithic quantum circuit using gate teleportation protocols. We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach.