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 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 cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration. These issues complicate the optimisation of quantum task allocation and scheduling, as existing heuristic methods fall short in adapting to dynamic conditions or effectively balancing execution fidelity and time. Here, we propose QFOR, a Q uantum F idelity-aware O rchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep R einforcement learning. We model the quantum task orchestration as a Markov Decision Process and employ the Proximal Policy Optimisation algorithm to learn adaptive scheduling policies, using IBM quantum processor calibration data for noise-aware performance estimation. Our configurable framework balances overall quantum task execution fidelity and time, enabling adaptation to different operational priorities. Extensive evaluation demonstrates that QFOR is adaptive and achieves significant performance with 29.5-84% improvements in relative fidelity performance over other deep reinforcement learning and heuristic baselines. Furthermore, it maintains comparable quantum execution times, contributing to cost-efficient use of quantum computation resources.
Abstract The convergence of quantum optimization and autonomous agentic reasoning defines a new computational frontier in large-scale resource coordination. This work introduces Q-PACT, a Quantum-Parallel Agentic Coordination Toolkit that unifies quantum optimization, fairness-driven orchestration, and adaptive multi-agent intelligence into a reproducible hybrid framework. Q-PACT addresses a key limitation in distributed and cloud-based quantum infrastructures; inefficient, inequitable scheduling of scarce quantum resources among competing agents and tasks. The proposed architecture formulates multi-agent scheduling as a Quadratic Unconstrained Binary Optimization (QUBO) model, solved through a heterogeneous pipeline integrating quantum annealing (D-Wave), variational optimization (QAOA on IonQ/Azure), and classical meta-heuristics. A noise-aware encoder, solver-adapter layer, and agentic manager collaborate to maintain fairness, adaptability, and load balance, while the QML-AURA subsystem continuously refines solver hyperparameters through feedback-driven variational learning. Q-PACT’s hybrid orchestration layer enables dynamic re-optimization, fault-tolerant fallback execution, and secure artifact exchange across distributed backends, achieving resilience under the noise and queueing constraints of NISQ-era hardware. Empirical evaluations demonstrate significant improvements in makespan reduction, workload variance, and energy minimization compared with classical heuristics, establishing the viability of quantum-assisted agentic scheduling at scale. By bridging quantum optimization paradigms, multi-agent systems, and fairness-aware orchestration, Q-PACT provides a foundational blueprint for the next generation of autonomous, cloud-integrated, and quantum-enabled coordination systems.
Quantum computers face challenges due to hardware constraints, noise errors, and heterogeneity, and face fundamental design tradeoffs between key performance metrics such as \textit{quantum fidelity} and system utilization. This substantially complicates managing quantum resources to scale the size and number of quantum algorithms that can be executed reliably in a given time. We introduce QOS, a cloud operating system for managing quantum resources while mitigating their inherent limitations and balancing the design tradeoffs of quantum computing. QOS exposes a hardware-agnostic API for transparent quantum job execution, mitigates hardware errors, and systematically multi-programs and schedules the jobs across space and time to achieve high quantum fidelity in a resource-efficient manner. To achieve this, it leverages two key insights: First, to maximize utilization and minimize fidelity loss, some jobs are more compatible than others for multi-programming on the same quantum computer. Second, sacrificing minimal fidelity can significantly reduce job waiting times. We evaluate QOS on real quantum devices hosted by IBM, using 7000 real quantum runs of more than 70.000 benchmark instances. We show that the QOS achieves 2.6--456.5× higher fidelity, increases resource utilization by up to 9.6×, and reduces waiting times by up to 5× while sacrificing only 1--3\% fidelity, on average, compared to the baselines.
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 between execution costs and system performance. While heuristic methods rely on predefined scheduling rules, classical deep reinforcement learning (DRL) models may require more trainable parameters in this setting. Motivated by the potential of parameterised quantum circuits (PQCs) as compact function approximators, we propose QRLQ, a cost-delay-aware quantum cloud scheduling framework integrating PQCs with a dueling double deep Q-network (D3QN) to dynamically account for both cost and delay. Our simulation results show that QRLQ achieves lower mean cost and delay than the heuristic baselines, achieving a 5-11% lower mean cost relative to availability-based and rotation-based heuristics and reducing mean delay by 17% and 82% relative to the strongest and weakest heuristic baselines, respectively, while retaining execution fidelity within 2% of a fidelity-greedy policy. Compared with the classical DRL baseline, QRLQ achieves comparable scheduling performance while using 72% fewer trainable parameters. This work explores the feasibility of using QRL for task orchestration in quantum cloud environments and demonstrates its potential for cost-delay-aware quantum resource management.
The integration of quantum computing into multi-cloud environments represents a transformative paradigm in distributed computing, offering substantial improvements in computational efficiency, security resilience, and adaptive workload orchestration. However, the heterogeneous nature of cloud infrastructures, combined with the nascent and resource-sensitive characteristics of quantum systems, introduces significant architectural, operational, and security challenges. This paper proposes an optimized quantum computing integration approach designed specifically for multi-cloud ecosystems, emphasizing scalable architecture design, intelligent workload distribution, and enhanced cryptographic security mechanisms.The study synthesizes foundational quantum computing principles with contemporary multi-cloud orchestration strategies to develop a hybrid architectural framework. The proposed model leverages quantum-enhanced optimization techniques, including quantum approximate optimization principles, to dynamically allocate computational tasks across distributed cloud nodes. Additionally, it integrates quantum-safe security protocols to mitigate emerging cyber threats in cloud environments. Prior research highlights the relevance of such integration, particularly in solving complex optimization problems and enhancing system-level security (Brown & White, 2022; Cao et al., 2020).A structured literature synthesis reveals that while cloud computing and quantum computing have individually matured, their convergence remains underexplored in practical deployment contexts. This paper addresses this gap by introducing an architecture that supports adaptive workload balancing, quantum-classical hybrid execution layers, and secure inter-cloud communication channels. The findings indicate that quantum-enhanced orchestration can significantly reduce computational latency and improve resource utilization efficiency in multi-cloud systems.
The convergence of quantum computing and high-performance computing (HPC) is giving rise to hybrid cloud platforms that coordinate workflows across classical and quantum resources. These heterogeneous environments introduce new challenges for workload management, including device variability, noise-prone quantum processors, and the need for synchronized orchestration across distributed systems. This survey reviews state-of-the-art techniques for scheduling, resource allocation, and workflow management in classical HPC, quantum clouds, and emerging hybrid infrastructures. A taxonomy is proposed to categorize workload management approaches by scheduling strategy, allocation model, orchestration mechanism, and performance metric. We present HybridCloudSim, a novel simulation framework designed to model hybrid quantum–HPC cloud environments and optimize resource usage under realistic constraints. HybridCloudSim is a conceptual foundation and a practical tool for advancing workload management in hybrid quantum–HPC systems.