Efficiently mapping quantum programs onto Distributed quantum computing (DQC) are challenging, particularly when considering the heterogeneous quantum processing units (QPUs) with different structures. In this paper, we present a comprehensive compilation framework that addresses these challenges with three key insights: exploiting structural patterns within quantum circuits, using clustering for initial qubit placement, and adjusting qubit mapping with annealing algorithms. Experimental results demonstrate the effectiveness of our methods and the capability to handle complex heterogeneous distributed quantum systems. Our evaluation shows that our method reduces the objective value at most 88.40\% compared to the baseline.
@article{arxiv.2508.15267,
title = {Optimizing Compilation for Distributed Quantum Computing via Clustering and Annealing},
author = {Ruilin Zhou and Jinglei Cheng and Yuhang Gan and Junyu Liu and Chen Qian},
journal= {arXiv preprint arXiv:2508.15267},
year = {2026}
}