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

Lecture notes in computer science

Scheduling with Multiple Dispatch Rules: A Quantum Computing Approach

Poojith U Rao, Balwinder Sodhi

Published Jan 1, 2022• 4 citations
Publisher
DOI
10.1007/978-3-031-08760-8_20

Related papers

Simulation Analysis of Scheduling and Dispatching Strategies for Quantum Systems Using Iquantum

Mohamad R. Pourbaba, Ehsan Ataie

Optimizing scheduling and dispatching algorithms can significantly reduce energy consumption in quantum computing. This paper examines the impact of various schedulingdispatching combinations on quantum job waiting and completion times. Experiments using iQuantum on six 27-qubit IBM quantum nodes across nine configurations show that our proposed LECLFLCF achieves the shortest waiting and completion times, reducing queue sizes and improving energy efficiency and resource utilization in quantum environments.

International Conference on Technology and Energy Management (ICTEM)•Apr 21, 2025•0 citations

A New Scheduling Problem Motivated by Quantum Computation.

Cynthia A. Phillips, Robert D. Carr, Anand Ganti

•May 1, 2008•0 citations

QCOEM: Quantum Cloud Orchestration with Evolutionary Multi-Objective Optimization

Tam N. Pham, Hoa T. Nguyen, Quan Le-Trung

Quantum cloud platforms need to dynamically orchestrate workloads across heterogeneous quantum computation backends whose noise profiles, qubit topologies, and queues vary over time. Existing orchestrators use noise-agnostic heuristics that ignore backend-specific errors, causing reduced execution fidelity, load imbalance, and frequent rescheduling. To address these challenges, we propose QCOEM - a Quantum Cloud Orchestration framework that leverages Evolutionary algorithms for Multi-objective optimization of quantum task scheduling. We compare NSGA-II and NSGA-III for jointly minimizing mean completion time, execution error rate, and load imbalance. To select schedules from a non-convex Pareto front, we apply an Augmented Achievement Scalarization Function (AASF) as a preference-based decision rule that maps the Pareto set to a single dispatchable schedule aligned with user priorities. Our extensive performance evaluation in a heterogeneous quantum cloud environment shows zero task rescheduling and about 30% higher mean fidelity than noise-agnostic heuristics, while maintaining bounded scheduling overhead. The experiment results indicate that our QCOEM framework can deliver stable, high-fidelity execution and lightweight resource management for quantum cloud computing.

cs.DCCross-listedarXiv:2607.25358•IEEE ... International Conference on Cloud Computing•Jul 29, 2026•0 citations

Quantum Approximation for Multi-Scale Scheduling

Jaeho Choi, Seunghyeok Oh, Joongheon Kim

•Apr 24, 2020•0 citations

A Backend-Agnostic MWIS Kernel for Stochastic Unit Commitment with Neutral-Atom Hardware Validation

Jiying Chen, Min Lin, Jingwei Wen +2 more

Quantum hardware is beginning to address structured combinatorial optimisation, but two steps still block practical use: mapping real operational models onto hardware-compatible instances, and converting noisy hardware output back into feasible decisions. Here we introduce a backend-agnostic computational interface that compiles the discrete decision layer of stochastic unit commitment into a move-based maximum-weight independent set (MWIS) problem, while retaining continuous dispatch and feasibility recovery in the classical computational layer. We validate the approach in a green hydrogen scheduling setting and deploy it on the QuEra Aquila neutral-atom quantum processor. This is the first end-to-end industrial scheduling workflow that connects real operational decisions to programmable neutral-atom hardware through a solver-agnostic MWIS representation. Across a 15-day hardware campaign on 50-node instances, hardware-generated solutions after classical refinement match or exceed the dispatch margins obtained from exact MWIS on every day. When scaling to 144 nodes, encoding quality remains stable, while the probability that the full atom array survives, rather than graph embedding, emerges as the dominant bottleneck to further scaling. Together, these results establish a hardware-compatible computational pathway toward larger problem scales, and lay the groundwork for exploring regimes in which exact classical optimisation may no longer scale efficiently.

quant-pharXiv:2609.01248•Sep 2, 2026•0 citations

INTEGRATION OF QUANTUM AND CLASSICAL COMPUTING: A DISTRIBUTED TASK MANAGEMENT MODEL

I G Blagoveshchenskiy, Anna A. Ilmushkina, Vladislav E. Vilkov +1 more

This article addresses the problem of constructing a distributed task management model in a hybrid quantum-classical computing environment. The relevance of this topic stems from the need for efficient distribution of computing resources in the face of limited availability of quantum devices and the high complexity of applied problems requiring quantum acceleration. A three-tier architecture of the hybrid system is proposed, with responsibilities divided between the task, control, and hardware infrastructure levels. Dispatching and adaptive scheduling principles are described, taking into account the specific features of variational quantum-classical algorithms, the stochastic nature of quantum computing, and the capacity limitations of quantum resources. A methodology for formalizing hybrid workflows, selecting optimality criteria, and synthesizing control rules is developed based on queuing theory, Markov processes, and multi-agent models.

SOFT MEASUREMENTS AND COMPUTING•Jan 1, 2025•0 citations
Optimizing scheduling and dispatching algorithms can significantly reduce energy consumption in quantum computing. This paper examines the impact of various schedulingdispatching combinations on quantum job waiting and completion times. Experiments using iQuantum on six 27-qubit IBM quantum nodes across nine configurations show that our proposed LECLFLCF achieves the shortest waiting and completion times, reducing queue sizes and improving energy efficiency and resource utilization in quantum environments.
Quantum cloud platforms need to dynamically orchestrate workloads across heterogeneous quantum computation backends whose noise profiles, qubit topologies, and queues vary over time. Existing orchestrators use noise-agnostic heuristics that ignore backend-specific errors, causing reduced execution fidelity, load imbalance, and frequent rescheduling. To address these challenges, we propose QCOEM - a Quantum Cloud Orchestration framework that leverages Evolutionary algorithms for Multi-objective optimization of quantum task scheduling. We compare NSGA-II and NSGA-III for jointly minimizing mean completion time, execution error rate, and load imbalance. To select schedules from a non-convex Pareto front, we apply an Augmented Achievement Scalarization Function (AASF) as a preference-based decision rule that maps the Pareto set to a single dispatchable schedule aligned with user priorities. Our extensive performance evaluation in a heterogeneous quantum cloud environment shows zero task rescheduling and about 30% higher mean fidelity than noise-agnostic heuristics, while maintaining bounded scheduling overhead. The experiment results indicate that our QCOEM framework can deliver stable, high-fidelity execution and lightweight resource management for quantum cloud computing.
Quantum hardware is beginning to address structured combinatorial optimisation, but two steps still block practical use: mapping real operational models onto hardware-compatible instances, and converting noisy hardware output back into feasible decisions. Here we introduce a backend-agnostic computational interface that compiles the discrete decision layer of stochastic unit commitment into a move-based maximum-weight independent set (MWIS) problem, while retaining continuous dispatch and feasibility recovery in the classical computational layer. We validate the approach in a green hydrogen scheduling setting and deploy it on the QuEra Aquila neutral-atom quantum processor. This is the first end-to-end industrial scheduling workflow that connects real operational decisions to programmable neutral-atom hardware through a solver-agnostic MWIS representation. Across a 15-day hardware campaign on 50-node instances, hardware-generated solutions after classical refinement match or exceed the dispatch margins obtained from exact MWIS on every day. When scaling to 144 nodes, encoding quality remains stable, while the probability that the full atom array survives, rather than graph embedding, emerges as the dominant bottleneck to further scaling. Together, these results establish a hardware-compatible computational pathway toward larger problem scales, and lay the groundwork for exploring regimes in which exact classical optimisation may no longer scale efficiently.
This article addresses the problem of constructing a distributed task management model in a hybrid quantum-classical computing environment. The relevance of this topic stems from the need for efficient distribution of computing resources in the face of limited availability of quantum devices and the high complexity of applied problems requiring quantum acceleration. A three-tier architecture of the hybrid system is proposed, with responsibilities divided between the task, control, and hardware infrastructure levels. Dispatching and adaptive scheduling principles are described, taking into account the specific features of variational quantum-classical algorithms, the stochastic nature of quantum computing, and the capacity limitations of quantum resources. A methodology for formalizing hybrid workflows, selecting optimality criteria, and synthesizing control rules is developed based on queuing theory, Markov processes, and multi-agent models.