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.25875 · International Conference on Quantum Communications, Networking, and Computing (QCNC)

Online Scheduling and Distribution of Quantum Circuits over Quantum Networks

Yukun Yang, Himanshu Gupta

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

Abstract

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.

AI Summary

The paper studies online admission, qubit placement, and execution of quantum circuits arriving at a shared quantum network without knowledge of future jobs. It targets completion time and makespan under finite memory, probabilistic entanglement generation, link contention, and a Bell-pair decoherence deadline. An event-driven framework updates decisions at arrivals and circuit completions. Routing costs increase with unfinished entanglement demand; a prediction oracle combines heuristic qubit placement with joint batching of unfinished and newly requested entangled pairs. Three greedy admission policies are compared: FIFO with feasibility scanning, earliest predicted finish, and smallest marginal increase in the current completion-time tail. Placement is formulated as a quadratic-assignment subproblem, establishing NP-hardness even in a simplified single-circuit setting. No competitive-ratio or queue-stability guarantee is provided. Evaluation uses NetSquid simulations of 10 processors with 10 memories each, random 20–30-qubit circuits, Poisson arrivals, and a 1-second decoherence threshold. Defaults include 100 circuits and 50 gates per qubit. Across sweeps of workload size, arrival intensity, and gate count, earliest-predicted-finish generally gives the lowest online mean completion time; marginal-tail admission performs similarly, while FIFO performs worse. Results are reported qualitatively without numerical improvement factors. An offline batching comparator generally performs best, but assumes all circuits are released at time zero. The paper notes that completion predictions are approximate and oracle cost grows with evaluated candidates. Evaluation uses finite workloads; starvation prevention is suggested but not tested. Baseline placements remain fixed, with teleportation-based reassignment discussed as an extension.

Some signs of AI-generated textIncrementalStrong assumptionsUnclear noveltyMissing comparison

Central claim may not hold: The placement and unified EP-batching algorithms underlying the prediction oracle are unspecified, leaving the claimed capacity- and decoherence-respecting execution and the simulation predictions insufficiently established. The offline GSCH comparison uses simultaneous releases rather than the online workload's Poisson release times, so its reported performance gap cannot isolate the benefit of lookahead or constitute a general lower bound for online mean flow time.

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. 264-270 (2026)
DOI
10.1109/QCNC69040.2026.00045
Comments
8 pages, 5 figures. Full author version revised after acceptance; the QCNC 2026 version was shortened to meet the conference page limit

Related papers

Advanced Scheduling Strategies for Distributed Quantum Computing Jobs

Gongyu Ni, Davide Ferrari, Lester Ho +1 more

Distributed quantum computing (DQC) is being actively investigated as a means of scaling the number of qubits across multiple connected quantum devices. This includes quantum circuit compilation and execution management on multiple quantum devices in the network. The latter aspect is very challenging because, while reducing the makespan of job batches remains a relevant objective, novel quantum-specific constraints must be considered, including QPU utilization, non-local gate rate, and the latency associated with queued DQC jobs. In this work, a range of scheduling strategies is proposed, simulated, and evaluated, including heuristics that prioritize resource maximization for QPU utilization, node selection based on heterogeneous network connectivity, asynchronous node release upon job completion, and a scheduling strategy based on reinforcement learning with proximal policy optimization. These approaches are benchmarked against traditional FIFO and LIST schedulers under varying DQC job types and network conditions for the allocation of DQC jobs to devices within a network.

quant-pharXiv:2602.24152•Computer Networks•Mar 2, 2026•3 citations

Execution Management of Distributed Quantum Computing Jobs

Davide Ferrari, Michele Bandini, Michele Amoretti

In a distributed quantum computation, a large quantum circuit gets sliced into sub-circuits that must be executed at the same time on a quantum computing cluster. The interactions between the sub-circuits are usually defined in terms of non-local gates that require shared entangled pairs and classical communication between different nodes. Assuming that multiple end users submit distributed quantum computing (DQC) jobs to the cluster, an execution management problem arises. This is actually a parallel job scheduling problem, in which a set of jobs of varying processing times need to be scheduled on multiple machines while trying to minimize the length of the schedule. In a previous work, we started investigating the problem considering random circuits and approximating the length of each DQC job with the number of layers of the circuit. In this work, we put forward the study by considering a more realistic model for estimating DQC job lengths and by performing evaluations with circuits of practical interest.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•6 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

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

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

Yukun Yang, Ranjani G. Sundaram, Himanshu Gupta

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.

cs.ETCross-listedarXiv:2610.26099•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Oct 20, 2026•0 citations

Effective Scheduling for Quantum Data Centers

Zebo Yang, Chenliang Tian, Raj Kumar Jain +5 more

Quantum computing continues to face challenges in scaling both qubit quality and quantity, motivating the shift toward Distributed Quantum Computing (DQC), where multiple interconnected Quantum Processing Units (QPUs) collaboratively solve problems too complex for monolithic systems. In a quantum data center, QPUs distributed across racks can perform remote gate operations by creating entanglement between them, enabling circuit execution through DQC. However, generating end-to-end entangled pairs in a quantum data center often causes congestion and resource contention. To mitigate this, we introduce a resource management framework with efficient schedulers that maximize fidelity-guaranteed throughput while preserving the dependency constraints of sub-circuits derived from the original quantum circuit. We benchmark the scheduling problem using a MixedInteger Linear Programming (MILP) model and then propose a set of lightweight schedulers-Least Resource First (LRF) and its extension, Group LRF (GLRF). These lightweight schedulers provide practical, though less optimal, solutions for handling the high volume of remote gates in DQC workloads. Our initial results on a DCell-based quantum data center show that such heuristics perform well under current DQC conditions, balancing runtime and performance while avoiding the heavy overhead of solvers or machine learning approaches, which often struggle to meet the strict timing demands of short-lived entanglement.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation
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.
The paper studies online admission, qubit placement, and execution of quantum circuits arriving at a shared quantum network without knowledge of future jobs. It targets completion time and makespan under finite memory, probabilistic entanglement generation, link contention, and a Bell-pair decoherence deadline.
An event-driven framework updates decisions at arrivals and circuit completions. Routing costs increase with unfinished entanglement demand; a prediction oracle combines heuristic qubit placement with joint batching of unfinished and newly requested entangled pairs. Three greedy admission policies are compared: FIFO with feasibility scanning, earliest predicted finish, and smallest marginal increase in the current completion-time tail. Placement is formulated as a quadratic-assignment subproblem, establishing NP-hardness even in a simplified single-circuit setting. No competitive-ratio or queue-stability guarantee is provided.
Evaluation uses NetSquid simulations of 10 processors with 10 memories each, random 20–30-qubit circuits, Poisson arrivals, and a 1-second decoherence threshold. Defaults include 100 circuits and 50 gates per qubit. Across sweeps of workload size, arrival intensity, and gate count, earliest-predicted-finish generally gives the lowest online mean completion time; marginal-tail admission performs similarly, while FIFO performs worse. Results are reported qualitatively without numerical improvement factors. An offline batching comparator generally performs best, but assumes all circuits are released at time zero.
The paper notes that completion predictions are approximate and oracle cost grows with evaluated candidates. Evaluation uses finite workloads; starvation prevention is suggested but not tested. Baseline placements remain fixed, with teleportation-based reassignment discussed as an extension.
Distributed quantum computing (DQC) is being actively investigated as a means of scaling the number of qubits across multiple connected quantum devices. This includes quantum circuit compilation and execution management on multiple quantum devices in the network. The latter aspect is very challenging because, while reducing the makespan of job batches remains a relevant objective, novel quantum-specific constraints must be considered, including QPU utilization, non-local gate rate, and the latency associated with queued DQC jobs. In this work, a range of scheduling strategies is proposed, simulated, and evaluated, including heuristics that prioritize resource maximization for QPU utilization, node selection based on heterogeneous network connectivity, asynchronous node release upon job completion, and a scheduling strategy based on reinforcement learning with proximal policy optimization. These approaches are benchmarked against traditional FIFO and LIST schedulers under varying DQC job types and network conditions for the allocation of DQC jobs to devices within a network.
In a distributed quantum computation, a large quantum circuit gets sliced into sub-circuits that must be executed at the same time on a quantum computing cluster. The interactions between the sub-circuits are usually defined in terms of non-local gates that require shared entangled pairs and classical communication between different nodes. Assuming that multiple end users submit distributed quantum computing (DQC) jobs to the cluster, an execution management problem arises. This is actually a parallel job scheduling problem, in which a set of jobs of varying processing times need to be scheduled on multiple machines while trying to minimize the length of the schedule. In a previous work, we started investigating the problem considering random circuits and approximating the length of each DQC job with the number of layers of the circuit. In this work, we put forward the study by considering a more realistic model for estimating DQC job lengths and by performing evaluations with circuits of practical interest.
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.
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.
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.
Quantum computing continues to face challenges in scaling both qubit quality and quantity, motivating the shift toward Distributed Quantum Computing (DQC), where multiple interconnected Quantum Processing Units (QPUs) collaboratively solve problems too complex for monolithic systems. In a quantum data center, QPUs distributed across racks can perform remote gate operations by creating entanglement between them, enabling circuit execution through DQC. However, generating end-to-end entangled pairs in a quantum data center often causes congestion and resource contention. To mitigate this, we introduce a resource management framework with efficient schedulers that maximize fidelity-guaranteed throughput while preserving the dependency constraints of sub-circuits derived from the original quantum circuit. We benchmark the scheduling problem using a MixedInteger Linear Programming (MILP) model and then propose a set of lightweight schedulers-Least Resource First (LRF) and its extension, Group LRF (GLRF). These lightweight schedulers provide practical, though less optimal, solutions for handling the high volume of remote gates in DQC workloads. Our initial results on a DCell-based quantum data center show that such heuristics perform well under current DQC conditions, balancing runtime and performance while avoiding the heavy overhead of solvers or machine learning approaches, which often struggle to meet the strict timing demands of short-lived entanglement.