Deadline-Aware Scheduling of Distributed Quantum Circuits in Near-Term Quantum Cloud

• URL: http://arxiv.org/abs/2512.06157v1
• Date: Thu, 04 Dec 2025 18:50:11 GMT
• Title: Deadline-Aware Scheduling of Distributed Quantum Circuits in Near-Term Quantum Cloud
• Abstract summary: Distributed quantum computing (DQC) enables scalable quantum computations by distributing large quantum circuits on multiple quantum processing units (QPUs) in the quantum cloud.<n>The proposed framework schedules partitioned quantum subcircuits while accounting for circuit deadlines and QPU capacity limits.<n>It also captures dependencies between partitioned subcircuits and distributes the execution of the sampling shots on different QPUs to have efficient wire cutting and faster execution.
• Score: 2.0718953516814103
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed quantum computing (DQC) enables scalable quantum computations by distributing large quantum circuits on multiple quantum processing units (QPUs) in the quantum cloud. In DQC, after partitioning quantum circuits, they must be scheduled and executed on heterogenous QPUs while balancing latency, overhead, QPU communication resource limits. However, since fully functioning quantum communication networks have not been realized yet, near-term quantum clouds will only rely on local operations and classical communication settings between QPUs, without entangled quantum links. Additionally, existing DQC scheduling frameworks do not account for user-defined execution deadlines and adopt inefficient wire cutting techniques. Accordingly, in this work, a deadline aware DQC scheduling framework with efficient wire cutting for near-term quantum cloud is proposed. The proposed framework schedules partitioned quantum subcircuits while accounting for circuit deadlines and QPU capacity limits. It also captures dependencies between partitioned subcircuits and distributes the execution of the sampling shots on different QPUs to have efficient wire cutting and faster execution. In this regard, a deadline-aware circuit scheduling optimization problem is formulated, and solved using simulated annealing. Simulation results show a marked improvement over existing shot-agnostic frameworks under urgent deadlines, reaching a 12.8% increase in requests served before their deadlines. Additionally, the proposed framework serves 8.16% more requests, on average, compared to state-of-the-art dependency-agnostic baseline frameworks, and by 9.60% versus the dependency-and-shot-agnostic baseline, all while achieving a smaller makespan of the DQC execution. Moreover, the proposed framework serves 23.7%, 24.5%, and 25.38% more requests compared to greedy, list scheduling, and random schedulers, respectively.

Related papers

• Performance Analysis of QAOA Across Distributed Quantum Network Topologies Using SwitchQNet [0.32622301272834514]
  We study the Quantum Approximate Optimization Algorithm (QAOA) as a graph-structured optimization workload for QDC-based quantum computing.<n>We adapt QAOA to SwitchQNet, a distributed quantum compiler framework that schedules communication and entanglement generation over switch-based QDC networks.<n>We evaluate QAOA instances across Clos, fat-tree, and spine-leaf topologies, measuring communication latency, EPR-pair overhead, EPR wait time, retry overhead, and sensitivity to buffer size.
  arXiv  Detail & Related papers  (2026-07-26T01:45:57Z)
• Qurator: Scheduling Hybrid Quantum-Classical Workflows Across Heterogeneous Cloud Providers [0.0]
  We present Qurator, an architecture-agnostic quantum-classical task scheduler that jointly optimize queue time and circuit fidelity across heterogeneous providers.<n>We evaluate Qurator on a simulator driven by four months of real queue data using circuits from the Munich Quantum Toolkit benchmark suite.
  arXiv  Detail & Related papers  (2026-04-07T06:58:46Z)
• Advanced Scheduling Strategies for Distributed Quantum Computing Jobs [1.4757786825685777]
  Scaling the number of qubits available across multiple quantum devices is an active area of research within distributed quantum computing (DQC)<n>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 density, and the latency associated with queued DQC jobs.
  arXiv  Detail & Related papers  (2026-02-27T16:35:32Z)
• DC-MBQC: A Distributed Compilation Framework for Measurement-Based Quantum Computing [19.12165843725862]
  We propose DC-MBQC, the first distributed quantum compilation framework tailored for measurement-based quantum computing.<n>We develop an adaptive graph partitioning algorithm that preserves the structure of the graph state while balancing the workload across quantum processing units.<n>Experiments demonstrate a $7.46times$ improvement on required photon lifetime and $6.82times$ speedup with 8 fully-connected QPUs.
  arXiv  Detail & Related papers  (2026-01-01T05:16:53Z)
• Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network [3.1856756516735936]
  A novel Deep Q-Network (DQN) based scheduling method is proposed to optimize delay time and fairness among entanglement requests in quantum repeater networks.<n>Results show that the proposed technique achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.
  arXiv  Detail & Related papers  (2025-05-18T15:32:21Z)
• CloudQC: A Network-aware Framework for Multi-tenant Distributed Quantum Computing [12.138985966967965]
  This work is the first attempt to design a circuit placement and resource scheduling framework for a multi-tenant environment.<n>The proposed framework is called CloudQC, which includes two main functional components, circuit placement and network scheduler.
  arXiv  Detail & Related papers  (2025-04-29T03:19:35Z)
• QSRA: A QPU Scheduling and Resource Allocation Approach for Cloud-Based Quantum Computing [1.1481775081593757]
  Quantum cloud platforms rely on Noisy Intermediate-Scale Quantum (NISQ) devices. This paper proposes a QPU Scheduling and Resource Allocation (QSRA) approach to address these challenges.
  arXiv  Detail & Related papers  (2024-11-08T02:25:46Z)
• Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation [0.0]
  Two quantum operation scheduling methods are proposed for quantum circuit simulation. The proposed methods reduce all-to-all communication caused by qubit reordering. We develop these methods tailored for two primary procedures in variational quantum eigensolver (VQE) simulation.
  arXiv  Detail & Related papers  (2024-10-05T18:20:37Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Shuttling for Scalable Trapped-Ion Quantum Computers [2.8956730787977083]
  We propose an efficient shuttling schedule for Trapped-ion quantum computers. The proposed approach produces shuttling schedules with a close-to-minimal amount of time steps. An implementation of the proposed approach is publicly available as part of the open-source Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-02-21T19:00:04Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Matching Game for Optimized Association in Quantum Communication Networks [65.16483325184237]
  This paper proposes a swap-stable request-QS association algorithm for quantum switches. It achieves a near-optimal (within 5%) performance in terms of the percentage of served requests. It is shown to be scalable and maintain its near-optimal performance even when the size of the QCN increases.
  arXiv  Detail & Related papers  (2023-05-22T03:39:18Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.