中国物理B ›› 2026, Vol. 35 ›› Issue (5): 50305-050305.doi: 10.1088/1674-1056/ae1c30

• • 上一篇    下一篇

Distributed quantum circuit partitioning and teleportation optimization based on a multi-dimensional evaluation strategy

Le Zhang(张乐)1, Zhijin Guan(管致锦)2,1,†, Shuo Qin(秦硕)1, Zheng Luo(罗政)1, Fei Ding(丁飞)1, and Xueyun Cheng(程学云)1,‡   

  1. 1 School of Artificial Intelligence and Computer Science, Nantong University, Nantong 226019, China;
    2 College of Engineering the Internet of Things, Taihu University, Wuxi 214063, China
  • 收稿日期:2025-09-07 修回日期:2025-10-20 出版日期:2025-11-06 发布日期:2025-11-06
  • 通讯作者: Zhijin Guan, Xueyun Cheng E-mail:guan.zj@ntu.edu.cn;chen.xy@ntu.edu.cn
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No. 62072259), in part by the Natural Science Foundation of Jiangsu Province (Grant No. BK20221411), in part by the Natural Science Foundation of Nantong (Grant No. JC2024100), and in part by the Ph.D. Start-up Fund of Nantong University (Grant No. 23B03).

Distributed quantum circuit partitioning and teleportation optimization based on a multi-dimensional evaluation strategy

Le Zhang(张乐)1, Zhijin Guan(管致锦)2,1,†, Shuo Qin(秦硕)1, Zheng Luo(罗政)1, Fei Ding(丁飞)1, and Xueyun Cheng(程学云)1,‡   

  1. 1 School of Artificial Intelligence and Computer Science, Nantong University, Nantong 226019, China;
    2 College of Engineering the Internet of Things, Taihu University, Wuxi 214063, China
  • Received:2025-09-07 Revised:2025-10-20 Online:2025-11-06 Published:2025-11-06
  • Contact: Zhijin Guan, Xueyun Cheng E-mail:guan.zj@ntu.edu.cn;chen.xy@ntu.edu.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No. 62072259), in part by the Natural Science Foundation of Jiangsu Province (Grant No. BK20221411), in part by the Natural Science Foundation of Nantong (Grant No. JC2024100), and in part by the Ph.D. Start-up Fund of Nantong University (Grant No. 23B03).

PDF (PC)

0

赞

摘要： Distributed quantum computing has emerged as a key approach to extending current quantum computing capabilities, with its performance largely determined by the cost of qubit transmissions across physical nodes. To minimize such cross-partition transmission costs, this paper proposes a distributed quantum circuit partitioning and teleportation optimization method based on a multidimensional evaluation strategy. First, a scoring function is designed using interaction strength and temporal fragmentation, guiding the partitioning process to balance structural compactness with temporal continuity. Building on this, we employ multiple starting points and parameter search strategies to progressively construct candidate partition schemes. Subsequently, a transmission-cost optimization method based on teleportation group partitioning is introduced to evaluate candidates more accurately, taking into account gate timing, interfering operations, and communication resource conflicts, thereby yielding a more realistic estimate of teleportation counts. Simulation results on several benchmark quantum circuits demonstrate that the proposed method consistently generates superior partitions under challenging conditions, such as high interaction density and significant gate interleaving. In some cases, teleportation counts are reduced by up to 64.7%, with an overall average improvement of 8%, verifying the adaptability and effectiveness of the method in optimizing communication across different interaction structures.

关键词: distributed quantum computing, structure-aware scoring, merged teleportation, qubit partitioning

Abstract: Distributed quantum computing has emerged as a key approach to extending current quantum computing capabilities, with its performance largely determined by the cost of qubit transmissions across physical nodes. To minimize such cross-partition transmission costs, this paper proposes a distributed quantum circuit partitioning and teleportation optimization method based on a multidimensional evaluation strategy. First, a scoring function is designed using interaction strength and temporal fragmentation, guiding the partitioning process to balance structural compactness with temporal continuity. Building on this, we employ multiple starting points and parameter search strategies to progressively construct candidate partition schemes. Subsequently, a transmission-cost optimization method based on teleportation group partitioning is introduced to evaluate candidates more accurately, taking into account gate timing, interfering operations, and communication resource conflicts, thereby yielding a more realistic estimate of teleportation counts. Simulation results on several benchmark quantum circuits demonstrate that the proposed method consistently generates superior partitions under challenging conditions, such as high interaction density and significant gate interleaving. In some cases, teleportation counts are reduced by up to 64.7%, with an overall average improvement of 8%, verifying the adaptability and effectiveness of the method in optimizing communication across different interaction structures.

Key words: distributed quantum computing, structure-aware scoring, merged teleportation, qubit partitioning

中图分类号:  (Quantum information)

  • 03.67.-a
03.67.Ac (Quantum algorithms, protocols, and simulations) 03.67.Hk (Quantum communication) 03.67.Lx (Quantum computation architectures and implementations)