Skip to content

Hybrid Quantum and Classical Workload Management with Graph-based Scheduling

Jul 2026 · arXiv.org · Vol abs/2607.09151 · 2 citations · 32 references
Computer Science Physics

TL;DR

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.

View source

Similar papers

Conference Aug 2026

Orchestrating High-Performance Quantum Applications in Distributed Environments

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)...

Alejandro Olvera, Harry Fu, Song Fu · 0 citations
Preprint Aug 2026

Enabling Hybrid HPCQC Workflows with a Heterogeneous Software Stack

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...

Muhammad Nufail Farooqi, Minh Chung, B. Mete et al. · 0 citations
Conference Open access Jul 2026

QCOEM: Quantum Cloud Orchestration with Evolutionary Multi-Objective Optimization

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.

Tam N. Pham, H. T. Nguyen, Quan Le-Trung · 0 citations
Jul 2026

Examining QRMI as a Unified Interface for Quantum-HPC Integration

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.

Thomas Badts, T. Boyle, Claudio Carvalho et al. · 4 citations
Preprint Aug 2026

Dataflows and Computational Patterns for Hybrid Quantum-Classical Scientific Computing

The Quantum Execution Locality Framework is introduced, 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...

Ryan Landfield, Jordan J. Winetrout, Michael A. Sandoval · 0 citations
Jul 2026

Queue-Theoretic Admission Control for Multi-Tenant GPU Clusters

It is proved that optimal admission ordering is NP-hard under multi-dimensional resource demands via reduction from vector bin packing, and that optimal admission ordering is NP-hard under multi-dimensional resource demands via reduction from vector bin packing.

Sohan Kunkerkar · 0 citations

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