Skip to content
Conference Open access

QCOEM: Quantum Cloud Orchestration with Evolutionary Multi-Objective Optimization

Jul 2026 · IEEE International Conference on Cloud Computing · pp. 460-466 · 0 citations · 29 references
Computer Science Physics

TL;DR

The QCOEM framework can deliver stable, high-fidelity execution and lightweight resource management for quantum cloud computing and shows zero task rescheduling and about 30% higher mean fidelity than noise-agnostic heuristics, while maintaining bounded scheduling overhead.

Abstract

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.

Read PDF

Similar papers

#artificial intelligence Preprint Sep 2026

Quantum Reinforcement Learning for Cost and Delay Tradeoffs in Quantum Cloud Orchestration

Quantum cloud computing, delivered through the quantum-as-a-service (QaaS) model, provides access to quantum computing resources. However, applying uniform time-based pricing across fundamentally heterogeneous quantum resources significantly complicates task orchestration, particularly when addressing the tradeoff betw...

An N. H. Phan, Dang van Huynh, Muhammad Usman et al. · 0 citations
Preprint Sep 2026

Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow

Today's Quantum Processing Units (QPUs) are too small and too noisy to solve large combinatorial optimization problems directly, so practical hybrid solvers split a problem into pieces and iterate a decompose-solve-aggregate loop over whatever backends are available: classical heuristics, simulators, emulators, or a QP...

Giuliana Siddi Moreau, M. Clemente, Lorenzo Pisani et al. · 0 citations
Open access Aug 2026

Hierarchical Scheduler with Adaptive Time-Budget Reallocation for Time-Triggered Edge-Fog-Cloud Architectures

The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, res...

Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al. · 0 citations
Book Open access Sep 2026

QMScaler: A QoS-Constrained Resource-Efficient Microservice Autoscaling Framework for Edge Environments

QMScaler is proposed, a QoS-driven microservice horizontal scaling framework based on Monte Carlo Tree Search (MCTS) that aims to minimize the number of container instances while meeting the QoS requirements of multiple application functions.

Tian-Yang Zheng, Peng-Fei Yang, Zhe Xu et al. · 0 citations
Open access Oct 2026

GreenCloud-RL: Carbon-Aware Multi-Cloud Scheduling with SLA Guarantees

We present GreenCloud-RL, a formally defined scheduler for multi-cloud fleets that jointly optimizes carbon emissions, operational cost, and service-level agreement (SLA) risk. The scheduling problem is modeled as a constrained Markov decision process (CMDP) in which expected cost–carbon reward is maximized subject to...

T. V. Ramanao, Narendra Kumar, Karthi Govindharaju et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.