Efficient quantum circuit execution with continuous distribution of entanglement
Phys. Rev. A 112, 012607 – Published 8 July, 2025
DOI: https://doi.org/10.1103/3xc7-j3mn
Abstract
In recent years, the rapid development of quantum networks and distributed quantum clusters has created new opportunities to implement large-scale quantum algorithms. However, this advancement also presents a significant challenge: efficiently executing quantum programs based on entanglement distribution protocols within quantum clusters. This paper analyzes existing entanglement distribution protocols in the context of distributed quantum circuit execution, focusing on the on-demand distribution of entanglement (on-demand protocols) and the continuous distribution of entanglement (CD protocols). We define the min-depth qubit mapping and scheduling problem within the CD protocols, and we propose a systematic solution that encompasses protocol analysis, circuit partitioning and mapping, and remote operation scheduling. Furthermore, we introduce a connectivity-first swapping (CFS) scheme that outperforms the single random swap (SRS) scheme in the execution of distributed quantum circuits in most cases. Extensive evaluations demonstrate the effectiveness of our algorithms, achieving significant reductions in circuit execution times of 52.4%, 49.9%, and 53.1% in clusters with average bandwidths of 1, 3, and 5, respectively. The CFS protocol further enhances performance, reducing execution time by 24.5%, 19.7%, and 17.8% compared to the SRS protocol. Our method also reduces entanglement costs, decreasing consumption by an average of 20.3% compared to the baseline method at an average bandwidth of 3, while the CFS protocol further reduces costs by 11.5% compared to the SRS protocol.
