Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

Omid Daei, Keivan Navi, Mariam Zomorodi Moghadam

Published Aug 9, 2021• 11 citations
Publisher
DOI
10.1007/s10773-021-04920-y

Related papers

Optimizing Teleportation Cost in Distributed Quantum Circuits

Mariam Zomorodi Moghadam, Mahboobeh Houshmand, Monireh Houshmand

International Journal of Theoretical Physics•Dec 7, 2017•64 citations

Generalised Circuit Partitioning for Distributed Quantum Computing

Felix Burt, Kuan‐Cheng Chen, Kin Kwong Leung

Distributed quantum computing (DQC) is a new paradigm aimed at scaling up quantum computing via the interconnection of smaller quantum processing units (QPUs). Shared entanglement allows teleportation of both states and gates between QPUs. This leads to an attractive horizontal scaling of quantum processing power that comes at the expense of the additional time and noise introduced by entanglement sharing protocols. Consequently, protocols for partitioning quantum circuits should aim to minimise the amount of entanglement-based communication required between distributed QPUs. Existing protocols tend to focus primarily on optimising entanglement costs for gate teleportation or state teleportation to cover operations between QPUs, rather than both at the same time. The most general form of the problem should treat gate and state teleportation on the same footing, allowing minimal cost circuit partitions through a combination of the two. This work introduces a graph-based formulation that allows joint optimisation of gate and state teleportation cost. The formulation permits lowe-bit cost for a variety of circuit types. Using a genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.

arXiv:2408.01424•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•39 citations

An Evolutionary Approach to Optimizing Teleportation Cost in Distributed Quantum Computation

Mahboobeh Houshmand, Zahra Mohammadi, Mariam Zomorodi Moghadam +1 more

arXiv:1910.07877•International Journal of Theoretical Physics•Feb 27, 2020•36 citations

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

Le 乐 Zhang 张, Zhijin Guan, Shuo 硕 Qin 秦 +3 more

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.

Chinese Physics B•Nov 6, 2025•0 citations

Schemes for teleportation of quantum gates

F. V. Mendes, Rubens Viana Ramos

Quantum Information Processing•Jul 27, 2010•3 citations

Distributing Quantum Circuits Using Teleportations

Ranjani G. Sundaram, Himanshu Gupta

Scalability is currently one of the most sought-after objectives in the field of quantum computing. Distributing a quantum circuit across a quantum network is one way to facilitate large computations using current quantum computers. In this paper, we consider the problem of distributing a quantum circuit across a network of heterogeneous quantum computers, while minimizing the number of teleportations (the communication cost) needed to implement gates spanning multiple computers. We design two algorithms for this problem. The first, called Local-Best, initially distributes the qubits across the network, then tries to teleport qubits only when necessary, with teleportations being influenced by gates in the near future. The second, called Zero-Stitching, divides the given circuit into sub-circuits such that each sub-circuit can be executed using zero teleportations and the teleportation cost incurred at the borders of the sub-circuits is minimal. We evaluate our algorithms over a wide range of randomly-generated circuits as well as known benchmarks, and compare their performance to prior work. We observe that our techniques outperform the prior approach by a significant margin (up to 50%).

arXiv:2306.00195•IEEE International Conference on Quantum Software (QSW)•Jul 1, 2023•30 citations
Distributed quantum computing (DQC) is a new paradigm aimed at scaling up quantum computing via the interconnection of smaller quantum processing units (QPUs). Shared entanglement allows teleportation of both states and gates between QPUs. This leads to an attractive horizontal scaling of quantum processing power that comes at the expense of the additional time and noise introduced by entanglement sharing protocols. Consequently, protocols for partitioning quantum circuits should aim to minimise the amount of entanglement-based communication required between distributed QPUs. Existing protocols tend to focus primarily on optimising entanglement costs for gate teleportation or state teleportation to cover operations between QPUs, rather than both at the same time. The most general form of the problem should treat gate and state teleportation on the same footing, allowing minimal cost circuit partitions through a combination of the two. This work introduces a graph-based formulation that allows joint optimisation of gate and state teleportation cost. The formulation permits lowe-bit cost for a variety of circuit types. Using a genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.
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.
Scalability is currently one of the most sought-after objectives in the field of quantum computing. Distributing a quantum circuit across a quantum network is one way to facilitate large computations using current quantum computers. In this paper, we consider the problem of distributing a quantum circuit across a network of heterogeneous quantum computers, while minimizing the number of teleportations (the communication cost) needed to implement gates spanning multiple computers. We design two algorithms for this problem. The first, called Local-Best, initially distributes the qubits across the network, then tries to teleport qubits only when necessary, with teleportations being influenced by gates in the near future. The second, called Zero-Stitching, divides the given circuit into sub-circuits such that each sub-circuit can be executed using zero teleportations and the teleportation cost incurred at the borders of the sub-circuits is minimal. We evaluate our algorithms over a wide range of randomly-generated circuits as well as known benchmarks, and compare their performance to prior work. We observe that our techniques outperform the prior approach by a significant margin (up to 50%).