Automated window-based partitioning of quantum circuits

Developing a scalable quantum computer as a single processing unit is challenging due to technology limitations. A solution to deal with this challenge is distributed quantum computing where several distant quantum processing units are used to perform the computation. The main design issue of this approach is costly communication between the processing units. Focused on this issue, in this paper, an efficient partitioning approach is proposed which combines both gate and qubit teleportation concepts in an efficient manner to minimize the communication. Experimental results show the proposed approach on average reduces the communication cost by about 29.5% in comparison with the best approaches in the literature.

Automated summary

This paper proposes an efficient partitioning approach for distributed quantum computing, which combines gate and qubit teleportation concepts to reduce communication costs. Experimental results demonstrate that the proposed approach reduces communication costs by an average of 29.5% compared to the best approaches in literature.