Optimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits

There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems. Due to the complexity of reducing teleportation costs in multi-partition quantum computing, a two-level optimization is proposed. In the first level, using graph partition methods, the quantum circuit is divided into k partitions. Secondly, using a series of proposed rules and functions, the number of teleportations for the partitioned quantum circuit is improved. In previous work, only optimization at the first level has been conisdered for the distributed quantum circuits. The implementation results show that the cost of teleportation in the proposed algorithm has been improved compared to previous work on benchmark circuits.