Optimized Quantum Circuit Partitioning

TL;DR

This paper introduces a method to partition quantum circuits to minimize communication costs, especially teleportations, in distributed quantum computing, enhancing efficiency and scalability.

Contribution

It presents a novel approach for generating distributed quantum circuits from monolithic ones, reducing teleportation and communication costs compared to prior methods.

Findings

Effective reduction in teleportation count

Improved communication efficiency in distributed circuits

Partitioning is essential for scalable distributed quantum computing

Abstract

The main objective of this paper is to improve the communication costs in distributed quantum circuits. To this end, we present a method for generating distributed quantum circuits from monolithic quantum circuits in such a way that communication between partitions of a distributed quantum circuit is minimized. Thus, the communication between distributed components is performed at a lower cost. Compared to existing works, our approach can effectively map a quantum circuit into an appropriate number of distributed components. Since teleportation is usually the protocol used to connect components in a distributed quantum circuit, our approach ultimately reduces the number of teleportations. The results of applying our approach to the benchmark quantum circuits determine its effectiveness and show that partitioning is a necessary step in constructing distributed quantum circuit.