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

arXiv:2610.26099 · International Conference on Quantum Communications, Networking, and Computing (QCNC)

Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks

Yukun Yang, Ranjani G. Sundaram, Himanshu Gupta

cs.ETquant-phSubmitted Oct 19, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Distributing quantum circuits across a network of quantum devices is a recent approach to improve the scalability of quantum computation. Entangled pairs of qubits distributed across network nodes are used as a communication resource for executing inter-node (remote) gates. However, establishing these entanglement pairs incurs significant latency, and doing so during the circuit's execution may lead to the decoherence of logical qubits. Instead, it may be beneficial to distribute certain entanglement pairs before the circuit is executed. Thus, we consider the problem of distributing a quantum circuit across a quantum network containing some pre-distributed entanglement pairs and seek to minimize the execution time of the circuit. We address this problem in three steps. First, given the quantum network and (optionally) a probability distribution over training circuits, we determine a set of pre-distributed entanglement pairs under a specified budget. Second, we compute a qubit-to-memory allocation that minimizes the expected execution time given these pre-distributed resources. Finally, we identify any additional entanglement pairs required during execution, generate them concurrently, and execute the circuit gates. We evaluate our methods on a broad range of benchmark circuits.

AI Summary

The paper studies how to minimize distributed quantum-circuit execution latency when a network can prepare a limited stock of entangled pairs (EPs) before execution. These pairs are consumed once, with additional pairs generated on demand. The approach jointly considers EP provisioning and a static assignment of circuit qubits to network memories; remote CNOTs use telegates, while local routing swaps are reversed to restore the assignment. The optimization uses a weighted sum of pairwise gate demand remaining after subtracting pre-distributed EP supply as a latency surrogate. It proposes three provisioning heuristics—topology-based allocation, workload-aware greedy allocation, and projected subgradient updates—and three placement methods based on greedy search, Hungarian assignment refinement, and simulated annealing. Execution scheduling reuses a prior batching procedure to accommodate decoherence. A further, unevaluated extension adds charges for consuming pre-distributed EPs. NetSquid simulations cover QPE, QFT, Deutsch–Jozsa, and GHZ circuits on randomized networks with 10 nodes and 10 memories per node, using a 1-second decoherence threshold. Each size bin supplies training circuits and 100 test samples from that same bin. Workload-aware provisioning outperforms topology-only provisioning; greedy placement performs best among the tested placement methods. The preferred provisioning method varies by circuit family, and some small instances have essentially no remaining online EP-generation latency. No numerical speedup factors are reported in the text. The scope excludes dynamic qubit mappings, teleportation-based routing, and continuous EP replenishment during execution. The optimization methods are heuristic; the pricing extension likewise provides no constrained-optimality guarantee.

Some signs of AI-generated textIncrementalMissing comparisonStrong assumptionsPossible error

Central claim may not hold: The optimized objective sums independent entanglement-generation latencies, which generally differs from elapsed execution time under concurrent generation and resource constraints. The reported near-zero execution times establish negligible additional entanglement-generation cost under the approximation, not negligible total circuit execution time. Refreshing pre-distributed entanglement only before execution does not ensure that pairs remain valid until consumption, so the claimed decoherence guarantee is unsupported. The projected-subgradient justification incorrectly treats a minimum over placement-dependent convex functions as admitting the asserted convex subgradient, and its placement oracle may not even return an exact minimizer. The local-routing cost charges 2d swaps for memories at distance d, although bringing the operands together and restoring their placement requires only 2(d-1) swaps along that path.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Journal reference
Proceedings - 2026 International Conference on Quantum Communications, Networking, and Computing (QCNC), pp. 252-258 (2026)
DOI
10.1109/QCNC69040.2026.00043
Comments
9 pages, 4 figures. Full author version revised after acceptance; includes the cost-aware entanglement consumption section omitted from the QCNC 2026 version to meet the conference page limit

Related papers

Distributing Quantum Circuits with Minimum Circuit Execution Time over Quantum Networks

Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan

Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time. We provide two-step solutions for the above problem: In the first step, we allocate qubits to memories to minimize the estimated execution time; for this step, we design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem. In the second step, we determine an efficient execution scheme, including generating required entanglements with minimum latency under the network re-source and decoherence constraints; for this step, we develop two algorithms with appropriate performance guarantees under certain settings or assumptions. We consider multiple protocols for executing remote gates, viz., telegates and cat-entanglements. With extensive simulations over NetSquid, a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform a scheme based on prior work by up to 95%.

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

DQC-QR: Distributing and Routing Quantum Circuits with Minimum Execution Time

Ranjani G. Sundaram, Himanshu Gupta, CR Ramakrishnan

Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time. We provide two-step solutions for the above problem: In the first step, we allocate qubits to memories to minimize the estimated execution time; for this step, we design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem. In the second step, we determine an efficient execution scheme, including generating required entanglements with minimum latency under the network resource and decoherence constraints; for this step, we develop two algorithms with appropriate performance guarantees under certain settings or assumptions. We consider multiple protocols for executing remote gates, viz., telegates and cat-entanglements. With extensive simulations over NetSquid, a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform a scheme based on prior work by 40 to 50% on average and up to 95% in some cases.

ACM Transactions on Quantum Computing•Jul 30, 2025•3 citations

Efficient Execution of Multiple Quantum Circuits Over a Quantum Network

Yukun Yang, Ranjani G. Sundaram, Himanshu Gupta

As quantum computing continues to scale, the ability to execute quantum circuits across distributed quantum networks is becoming increasingly important. While prior work has largely focused on distributing a single circuit to optimize the number of entanglement pairs (EPs) used or the execution time, future applications will require the efficient scheduling and execution of multiple circuits on a shared quantum network. Therefore, we study the problem of efficiently distributing multiple quantum circuits across a shared quantum network under decoherence and network constraints and seek to minimize the execution time required to execute all circuits (makespan). Solving the above problem involves jointly determining when and where each circuit should be executed, and how to schedule concurrent EP generation required to execute remote gates. We propose several algorithmic approaches for this multi-circuit distribution problem and provide theoretical performance guarantees for special cases. To assess the practical effectiveness of our methods, we conduct extensive simulations using the NetSquid quantum network simulator.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Dynamic Distribution of Quantum Circuits with Minimum Circuit-Execution Time

Ranjani G. Sundaram, Himanshu Gupta

Distribution of quantum circuits (DQC) is a promising strategy to enable large-scale quantum computations by utilizing a network of quantum computers. However, executing distributed quantum programs entails generating entanglements (to execute remote gates), which can incur significant latency and lead to qubits’ decoherence. Prior works on the problem of distributing quantum circuits with minimum circuit-execution time have only considered a static allocation of qubits to network nodes, presumably for simplicity. In this work, we show that distributing quantum circuits with a dynamic allocation of qubits, i.e., qubit allocation (over the quantum computers) that changes during the circuit execution, can lower circuit execution time. For this DQC problem wherein qubit allocation can be dynamic (i.e., change over time), we design efficient algorithms and demonstrate the effectiveness of designed techniques via extensive simulations over NetSquid, a quantum network simulator; our techniques outperform the best prior work (using static qubit allocation) by up to 50%.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•4 citations

Pre-Distribution of Entanglements in Quantum Networks

Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan +1 more

Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. Establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. To reduce EP generation latency, prior works have looked at selection of efficient entanglement-routing paths and simultaneous use of multiple such paths for EP generation.In this paper, we propose and investigate a complementary technique to reduce EP generation latency—to pre-distribute EPs over certain (pre-determined) pairs of network nodes; these pre-distributed EPs can then be used to generate EPs for the requested pairs, when needed, with lower generation latency. For such a pre-distribution approach to be most effective, we need to address an optimization problem of selection of node-pairs where the EPs should be pre-distributed to minimize the generation latency of expected EP requests, under a given cost constraint. In this paper, we appropriately formulate the above optimization problem and design two efficient algorithms, one of which is a greedy approach based on an approximation algorithm for a special case. Via extensive evaluations over the NetSquid simulator [1], we demonstrate the effectiveness of our approach and developed techniques; we show that our developed algorithms outperform a naive approach by up to an order of magnitude.

arXiv:2205.04036•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•23 citations

Online Scheduling and Distribution of Quantum Circuits over Quantum Networks

Yukun Yang, Himanshu Gupta

Emerging quantum networks enable distributed quantum computing (DQC) by interconnecting modest, noisy quantum processors. However, practical deployments face tight memory budgets, probabilistic entanglement generation, and decoherence, all while serving multiple users. In realistic settings -- cloud execution, iterative/interactive workloads and concurrent jobs -- circuits do not arrive in a single batch but as a stream. This creates a fundamentally online problem: the system must react to stochastic arrivals, balance latency and throughput, and remain stable under varying loads without foresight of future jobs. We study Online Scheduling and Distribution of Quantum Circuits (OS-DQC) and formalize the online scheduling problem for quantum networks: circuits arrive over time and must be executed without knowledge of future arrivals. At each event time (arrival or completion), the system decides which waiting circuits to launch and how to place their qubits, while accounting for congestion from in-flight circuits and constraints due to finite memories and decoherence. The objective is to minimize the mean completion time and makespan under these physical and resource constraints.

cs.ETCross-listedarXiv:2610.25875•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Oct 20, 2026•0 citations
Distributing quantum circuits across a network of quantum devices is a recent approach to improve the scalability of quantum computation. Entangled pairs of qubits distributed across network nodes are used as a communication resource for executing inter-node (remote) gates. However, establishing these entanglement pairs incurs significant latency, and doing so during the circuit's execution may lead to the decoherence of logical qubits. Instead, it may be beneficial to distribute certain entanglement pairs before the circuit is executed. Thus, we consider the problem of distributing a quantum circuit across a quantum network containing some pre-distributed entanglement pairs and seek to minimize the execution time of the circuit.
We address this problem in three steps. First, given the quantum network and (optionally) a probability distribution over training circuits, we determine a set of pre-distributed entanglement pairs under a specified budget. Second, we compute a qubit-to-memory allocation that minimizes the expected execution time given these pre-distributed resources. Finally, we identify any additional entanglement pairs required during execution, generate them concurrently, and execute the circuit gates. We evaluate our methods on a broad range of benchmark circuits.
The paper studies how to minimize distributed quantum-circuit execution latency when a network can prepare a limited stock of entangled pairs (EPs) before execution. These pairs are consumed once, with additional pairs generated on demand. The approach jointly considers EP provisioning and a static assignment of circuit qubits to network memories; remote CNOTs use telegates, while local routing swaps are reversed to restore the assignment.
The optimization uses a weighted sum of pairwise gate demand remaining after subtracting pre-distributed EP supply as a latency surrogate. It proposes three provisioning heuristics—topology-based allocation, workload-aware greedy allocation, and projected subgradient updates—and three placement methods based on greedy search, Hungarian assignment refinement, and simulated annealing. Execution scheduling reuses a prior batching procedure to accommodate decoherence. A further, unevaluated extension adds charges for consuming pre-distributed EPs.
NetSquid simulations cover QPE, QFT, Deutsch–Jozsa, and GHZ circuits on randomized networks with 10 nodes and 10 memories per node, using a 1-second decoherence threshold. Each size bin supplies training circuits and 100 test samples from that same bin. Workload-aware provisioning outperforms topology-only provisioning; greedy placement performs best among the tested placement methods. The preferred provisioning method varies by circuit family, and some small instances have essentially no remaining online EP-generation latency. No numerical speedup factors are reported in the text.
The scope excludes dynamic qubit mappings, teleportation-based routing, and continuous EP replenishment during execution. The optimization methods are heuristic; the pricing extension likewise provides no constrained-optimality guarantee.
Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time. We provide two-step solutions for the above problem: In the first step, we allocate qubits to memories to minimize the estimated execution time; for this step, we design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem. In the second step, we determine an efficient execution scheme, including generating required entanglements with minimum latency under the network re-source and decoherence constraints; for this step, we develop two algorithms with appropriate performance guarantees under certain settings or assumptions. We consider multiple protocols for executing remote gates, viz., telegates and cat-entanglements. With extensive simulations over NetSquid, a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform a scheme based on prior work by up to 95%.
Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time. We provide two-step solutions for the above problem: In the first step, we allocate qubits to memories to minimize the estimated execution time; for this step, we design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem. In the second step, we determine an efficient execution scheme, including generating required entanglements with minimum latency under the network resource and decoherence constraints; for this step, we develop two algorithms with appropriate performance guarantees under certain settings or assumptions. We consider multiple protocols for executing remote gates, viz., telegates and cat-entanglements. With extensive simulations over NetSquid, a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform a scheme based on prior work by 40 to 50% on average and up to 95% in some cases.
As quantum computing continues to scale, the ability to execute quantum circuits across distributed quantum networks is becoming increasingly important. While prior work has largely focused on distributing a single circuit to optimize the number of entanglement pairs (EPs) used or the execution time, future applications will require the efficient scheduling and execution of multiple circuits on a shared quantum network. Therefore, we study the problem of efficiently distributing multiple quantum circuits across a shared quantum network under decoherence and network constraints and seek to minimize the execution time required to execute all circuits (makespan). Solving the above problem involves jointly determining when and where each circuit should be executed, and how to schedule concurrent EP generation required to execute remote gates. We propose several algorithmic approaches for this multi-circuit distribution problem and provide theoretical performance guarantees for special cases. To assess the practical effectiveness of our methods, we conduct extensive simulations using the NetSquid quantum network simulator.
Distribution of quantum circuits (DQC) is a promising strategy to enable large-scale quantum computations by utilizing a network of quantum computers. However, executing distributed quantum programs entails generating entanglements (to execute remote gates), which can incur significant latency and lead to qubits’ decoherence. Prior works on the problem of distributing quantum circuits with minimum circuit-execution time have only considered a static allocation of qubits to network nodes, presumably for simplicity. In this work, we show that distributing quantum circuits with a dynamic allocation of qubits, i.e., qubit allocation (over the quantum computers) that changes during the circuit execution, can lower circuit execution time. For this DQC problem wherein qubit allocation can be dynamic (i.e., change over time), we design efficient algorithms and demonstrate the effectiveness of designed techniques via extensive simulations over NetSquid, a quantum network simulator; our techniques outperform the best prior work (using static qubit allocation) by up to 50%.
Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. Establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. To reduce EP generation latency, prior works have looked at selection of efficient entanglement-routing paths and simultaneous use of multiple such paths for EP generation.In this paper, we propose and investigate a complementary technique to reduce EP generation latency—to pre-distribute EPs over certain (pre-determined) pairs of network nodes; these pre-distributed EPs can then be used to generate EPs for the requested pairs, when needed, with lower generation latency. For such a pre-distribution approach to be most effective, we need to address an optimization problem of selection of node-pairs where the EPs should be pre-distributed to minimize the generation latency of expected EP requests, under a given cost constraint. In this paper, we appropriately formulate the above optimization problem and design two efficient algorithms, one of which is a greedy approach based on an approximation algorithm for a special case. Via extensive evaluations over the NetSquid simulator [1], we demonstrate the effectiveness of our approach and developed techniques; we show that our developed algorithms outperform a naive approach by up to an order of magnitude.
Emerging quantum networks enable distributed quantum computing (DQC) by interconnecting modest, noisy quantum processors. However, practical deployments face tight memory budgets, probabilistic entanglement generation, and decoherence, all while serving multiple users. In realistic settings -- cloud execution, iterative/interactive workloads and concurrent jobs -- circuits do not arrive in a single batch but as a stream. This creates a fundamentally online problem: the system must react to stochastic arrivals, balance latency and throughput, and remain stable under varying loads without foresight of future jobs. We study Online Scheduling and Distribution of Quantum Circuits (OS-DQC) and formalize the online scheduling problem for quantum networks: circuits arrive over time and must be executed without knowledge of future arrivals. At each event time (arrival or completion), the system decides which waiting circuits to launch and how to place their qubits, while accounting for congestion from in-flight circuits and constraints due to finite memories and decoherence. The objective is to minimize the mean completion time and makespan under these physical and resource constraints.