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

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.