Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
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.
Versions
Related
- Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems
- Concurrent Entanglement Purification Scheduling in Dynamic Quantum Networks
- Priority-Aware Routing for Quantum Networks:Integrating Coherence-Time Constraints into Scheduling
- Local random quantum circuits converge to the Porter-Thomas distribution in polynomial depth
- ReFINE: Scheduling of Distillation and Coding for Rate-Fidelity Tradeoff in Quantum Networks
BibTeX
@misc{yang2026online,
title = {{Online Scheduling and Distribution of Quantum Circuits over Quantum Networks}},
author = {Yukun Yang and Himanshu Gupta},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.25875},
eprint = {2610.25875},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.25875},
}
RIS
TY - UNPB
TI - Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
AU - Yukun Yang
AU - Himanshu Gupta
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.25875
UR - https://arxiv.org/abs/2610.25875
AB - 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.
ER -