Fluence, a Kubernetes scheduler plugin backed by the Fluxion graph-based scheduler, enabling gang-scheduled placement for quantum-classical workloads and custom resources and shows that quantum-awareness can be added to a cloud-native scheduler without modifying user containers.
Abstract
High Performance Computing (HPC) centers are expanding to integrate quantum resources, enabling hybrid quantum-classical workflows for complex optimization. Integrating quantum processing units (QPUs) into workload managers poses an orchestration challenge: a remote QPU introduces a second queue - a"two-queue problem"- alongside the scheduler's own. We present Fluence, a Kubernetes scheduler plugin backed by the Fluxion graph-based scheduler, enabling gang-scheduled placement for quantum-classical workloads and custom resources. First, under contention, Fluence's atomic gang placement eliminates the node-time a default scheduler wastes on partially placed gangs. Second, a synchronization primitive gates consumers behind a single producer's shared quantum task, cutting worker idle time roughly 1.2-12x under short queues and orders of magnitude under long ones. Third, policy-aware backend selection cuts mean per-run cost roughly 72x and time-to-result from hours to under two minutes. Together, these results show that quantum-awareness can be added to a cloud-native scheduler without modifying user containers.
Quantum computing is rapidly moving toward cloud-native, High-Performance Computing (HPC) models. However, current job submission systems rely on sequential, exclusive-use execution, causing severe resource under-utilization and excessive user wait times. This paper introduces QUDA (Quantum Unified Device Architecture), a distributed orchestration platform designed to solve this bottleneck by decoupling the control and execution planes. QUDA employs a master-worker hierarchy in the form of the Joint Unified Gateway (JUG) for global control and distributed Quantum Processor Schedulers (QuPS) for hardware-aware execution. By abstracting hardware complexity and leveraging OpenQASM 3.0, QUDA enables backend-agnostic portability across heterogeneous systems. We evaluate QUDA using W-state probes and combinatorial optimization benchmarks, demonstrating significant gains in system-wide throughput and qubit utilization over direct submission models. QUDA provides a scalable foundation for modern, distributed quantum workloads.
Alejandro Olvera, Harry Fu, Song Fu· 2026 International Conferenc...· 0 citations
In this work, we demonstrate hybrid High Performance Computing-Quantum Computing (HPCQC) workflows on a production petascale system. The demonstration combines three components: the SuperMUC-NG supercomputer at the Leibniz Supercomputing Centre (LRZ), a 20-qubit superconducting quantum processor provided by IQM Quantum Computers (IQM), and Munich Quantum Valley (MQV)'s Munich Quantum Software Stack (MQSS). Integrating quantum processors into High Performance Computing (HPC) systems requires a heterogeneous software stack capable of orchestrating classical and quantum resources within established supercomputing workflows. MQSS treats Quantum Processing Units (QPUs) as scheduler-managed accelerators and it performs resource coordination following a two-level scheduling scheme. Slurm performs system-level allocation by exposing QPUs as Generic RESources (GRES), while the MQSS Quantum Resource Manager&Compiler Infrastructure (QRM&CI) performs just-in-time compilation and subsequent dispatch of quantum circuits. To integrate with existing HPC operations without modifying the scheduler core, MQSS introduces an open-source SLURM Plugin Suite based on Prolog/Epilog scripts and SPANK modules. Experimental results show that hybrid HPCQC workflows can be executed without significant latency overhead compared to conventional workloads. The presented architecture provides a portable integration model for quantum accelerators on large-scale HPC systems and is directly applicable to next-generation Hewlett Packard Enterprise (HPE) Cray platforms, including LRZ's upcoming'Blue Lion'supercomputer.
Muhammad Nufail Farooqi, Minh Chung, B. Mete et al.· 0 citations
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.
Tam N. Pham, H. Nguyen, Quan Le-Trung· IEEE International Conferenc...· 0 citations
The efficient and scalable integration of quantum resources into high-performance computing (HPC) environments requires standardized mechanisms for resource management, scheduling, and workflow orchestration across diverse and heterogeneous infrastructures. The Quantum Resource Management Interface (QRMI) addresses this challenge through a thin, vendor-agnostic middleware layer that provides standardized APIs for scheduling, executing, and monitoring quantum workloads while exposing quantum resources as first-class schedulable resources alongside CPUs and GPUs. Although previous work demonstrated QRMI integration with the Slurm workload manager, its applicability across other workload managers remained unexamined. This paper extends the validation of QRMI to a broad range of workload managers, including PBS, LSF, Grid Engine, Kubernetes, and the Flux Framework, encompassing traditional batch schedulers, a cloud-native orchestration platform, and a graph-based scheduler. We examine the integration patterns, implementation requirements, and scheduler-specific considerations associated with each environment and compare QRMI with alternative approaches to quantum resource integration. We demonstrate that QRMI provides a portable and flexible abstraction layer that minimizes scheduler-specific modifications while enabling consistent access to heterogeneous quantum resources across both on-premises and cloud environments.
Thomas Badts, T. Boyle, Claudio Carvalho et al.· arXiv.org· 3 citations
Hybrid quantum-classical computing has emerged as the dominant paradigm for near-term quantum applications, yet hybrid workflows are typically described by individual algorithms rather than their underlying execution behavior. We introduce the Quantum Execution Locality Framework (QELF), a qualitative framework for characterizing hybrid quantum-classical workflows according to recurring dataflow structures and quantum execution locality, the extent to which computation remains resident on the Quantum Processing Unit (QPU) before host intervention or classical synchronization. From a representative cross-section of applications, QELF identifies five recurring computational patterns with distinct locality characteristics and discusses their implications for communication overhead, workflow organization, and future hybrid computing architectures. By providing a common vocabulary for reasoning about hybrid workloads, QELF establishes a foundation for future quantitative validation and the co-design of algorithms, runtime systems, and hybrid computing architectures.
Ryan Landfield, Jordan J. Winetrout, Michael A. Sandoval· 0 citations
GPU cluster operators cannot predict how long pending workloads will wait for admission. Existing systems use greedy heuristics with no formal wait time guarantees. We formalize GPU cluster admission as a multi-class, multi-resource queueing network and prove a structural decomposition: the pending queue partitions into quotable workloads (bounded wait time under stability) and unfeasible workloads (no finite bound without reconfiguration). For quotable workloads, we model each cluster queue as an M/G/k system where the effective server count k is determined by a vector packing reduction; under an explicit stochastic domination assumption, we establish O(1/(1-rho)) wait time scaling. We prove that optimal admission ordering is NP-hard under multi-dimensional resource demands via reduction from vector bin packing. We validate on Kueue, the standard Kubernetes workload queuing system, using CPU, memory, and GPU (via Dynamic Resource Allocation) resources. The vector k_eff correctly identifies bottleneck resource dimensions, Little's Law holds exactly, and the Erlang-C approximation consistently overestimates observed wait times in the conservative direction.
Sohan Kunkerkar· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
