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 QPU. In practice, the loop is a driver script. It sits on top of the quantum-HPC middleware, handling task generation, provenance, recovery, and portability. Instead, we treat the loop as a scientific workflow and ask what a workflow layer adds to a generic workflow management system and QPU-sharing middleware. Two decomposition patterns from real applications, iterative consensus (ADMM) and hierarchical partitioning, turn out to stress the orchestration layer very differently: over 120 managed runs, orchestration took 78.4% of end-to-end time for the iterative pattern, almost all of it in a per-round barrier, but only 6.2% for the hierarchical one. Our workflow model adds four things a generic engine does not have: a termination predicate residing in the task graph that reads the previous round's residuals, subproblem-level recovery with warm-start and quorum-deferred aggregation, failover from a QPU to a classical replica within a round, and a provenance schema that describes CPUs, simulators and QPUs with the same fields, including the shot budget included. We report the cost of each layer on our engine, show that speculative re-execution enable runs to complete under injected failures that stall an unmanaged driver. We also use the same provenance to give per-device latency tails across simulators, emulators and IQM QPUs.
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 QPU. In practice, the loop is a driver script. It sits on top of the quantum-HPC middleware, handling task generation, provenance, recovery, and portability. Instead, we treat the loop as a scientific workflow and ask what a workflow layer adds to a generic workflow management system and QPU-sharing middleware. Two decomposition patterns from real applications, iterative consensus (ADMM) and hierarchical partitioning, turn out to stress the orchestration layer very differently: over 120 managed runs, orchestration took 78.4% of end-to-end time for the iterative pattern, almost all of it in a per-round barrier, but only 6.2% for the hierarchical one. Our workflow model adds four things a generic engine does not have: a termination predicate residing in the task graph that reads the previous round's residuals, subproblem-level recovery with warm-start and quorum-deferred aggregation, failover from a QPU to a classical replica within a round, and a provenance schema that describes CPUs, simulators and QPUs with the same fields, including the shot budget included. We report the cost of each layer on our engine, show that speculative re-execution enable runs to complete under injected failures that stall an unmanaged driver. We also use the same provenance to give per-device latency tails across simulators, emulators and IQM QPUs.
Hybrid quantum-classical workflows combine quantum processing units (QPUs) with classical hardware to address computational tasks that are challenging or infeasible for conventional systems alone. Coordinating these heterogeneous resources at scale demands robust orchestration, reproducibility, and observability. Even in the presence of fault-tolerant quantum devices, quantum computing will continue to operate within a broader hybrid ecosystem, where classical infrastructure plays a central role in task scheduling, data movement, error mitigation, and large-scale workflow coordination.
In this work, we present a cloud-native framework for managing hybrid quantum-HPC pipelines using Kubernetes, Argo Workflows, and Kueue. Our system unifies CPUs, GPUs, and QPUs under a single orchestration layer, enabling multi-stage workflows with dynamic, resource-aware scheduling. We demonstrate the framework with a proof-of-concept implementation of distributed quantum circuit cutting, showcasing execution across heterogeneous nodes and integration of classical and quantum tasks. This approach highlights the potential for scalable, reproducible, and flexible hybrid quantum-classical computing in cloud-native environments.
High-performance computing (HPC) has evolved over decades through multiple architectural transitions, from vector supercomputers to massively parallel CPU clusters and GPU-accelerated systems, continuously expanding the frontier of scientific discovery. With the emergence of quantum processing units (QPUs) as practical computational accelerators, a new opportunity arises to further extend this trajectory by integrating quantum and classical computing paradigms. Building on the emerging vision of Quantum Integrated High-Performance Computing (QHPC), this paper contributes a full-stack layered architecture that integrates QPUs as first-class accelerators within, not merely alongside, the classical HPC software and hardware stack, with tight, on-premise quantum-classical coupling as its defining characteristic. The architecture comprises of unified resource management, quantum-aware scheduling, hybrid workflow orchestration, middleware and programming abstraction, interconnect technologies, and a tiered execution model enabling seamless workload partitioning across classical and quantum backends. A central aspect of this architecture is a strong user requests abstraction layer that exposes heterogeneous resources through a unified job submission interface, similar in spirit to existing schedulers such as Slurm, allowing users to describe workloads in a consistent template independent of underlying compute type or location. Drawing insights from prior accelerator integration eras, we outline how QHPC can support emerging workloads in quantum chemistry, materials discovery, combinatorial optimization, and climate modeling. We conclude by highlighting open challenges in building scalable, reliable, and programmable quantum-classical infrastructures that seamlessly connect global users to heterogeneous compute resources for future quantum-classical HPC ecosystems.
Hybrid quantum-classical applications pose significant resource management challenges due to heterogeneity and dynamism in both infrastructure and workloads. Quantum-HPC environments integrate quantum processing units (QPUs) with diverse classical resources (CPUs, GPUs), while applications span coupling patterns from tightly coupled execution to loosely coupled task parallelism with varying resource requirements. Traditional HPC schedulers lack visibility into application semantics and cannot respond to fluctuating resource availability at runtime. This paper presents a middleware-based approach for adaptive resource, workload, and task management in hybrid quantum-HPC systems. We make four contributions: (i) a conceptual four-layer middleware architecture that decomposes management across workflow, workload, task, and resource levels, enabling application-aware scheduling over heterogeneous quantum-HPC resources; (ii) a set of execution motifs capturing interaction and coupling characteristics of hybrid applications, realized as quantum mini-apps for systematic workload characterization; (iii) Pilot-Quantum, a middleware framework built on the pilot abstraction that enables late binding and dynamic resource allocation, adapting to resource and workload dynamics at runtime; and (iv) Q-Dreamer, a performance modeling toolkit providing reusable components for informed workload partitioning, including a circuit-cutting optimizer that analytically derives optimal partitioning strategies. Evaluation on heterogeneous HPC platforms (Perlmutter, NVIDIA DGX with H100/B200 GPUs) demonstrates efficient multi-backend orchestration across CPUs, GPUs, and QPUs for diverse execution motifs. Q-Dreamer predicts optimal circuit cutting configurations with up to 82% accuracy.
Although quantum hardware has made significant progress, constraints such as limited qubit counts and noise still hinder its practical impact on scientific and industrial challenges. Integrating multiple quantum processing units (QPUs) with HPC resources (e.g., GPUs and CPUs) is a promising approach. However, quantum–HPC integration introduces new complexities, including resource orchestration, workload partitioning, and quantum-classical coordination. This paper identifies emerging quantum workflow execution patterns, illustrating the interaction between quantum and classical components in hybrid quantum workflow applications. We classify these execution patterns into six basic motifs centered on simple quantum-classical interactions (e.g., circuit execution) and introduce two compositional motifs as orchestration of one or more basic motifs. The variational quantum algorithm (VQA) compositional motif captures new parallelism strategies by concurrently running classical solvers and quantum circuit evaluations. The generative quantum algorithm (GQA) compositional motif describes how GPU-accelerated AI models can generate or refine quantum circuits, which are then executed on QPUs. Characterizing these basic and compositional motifs provides a structured path toward scalable quantum–HPC middleware solutions, informing design at the task, workload orchestration, and application levels.
The Noisy Intermediate-Scale Quantum (NISQ) era, defined by qubit counts in the hundreds and gate error rates that preclude long coherence times, imposes severe constraints on purely quantum computation. The central problem is that achieving practical quantum advantage for real-world tasks must overcome these hardware limitations, yet fault-tolerant quantum computers with full error correction remain years away. To address this, we present a systematic survey of hybrid classical-quantum computing models, in which classical high-performance resources orchestrate the workflow, perform iterative optimization, and apply error mitigation to noisy quantum processing units. Our review encompasses variational quantum algorithms, such as the variational quantum eigensolver and quantum approximate optimization algorithm; classical optimizers tailored for noisy quantum landscapes; error mitigation techniques including zero-noise extrapolation and probabilistic error cancellation; and circuit knitting that partitions large circuits across small QPUs. We find that these hybrid architectures have already demonstrated domain-specific utility in quantum chemistry for molecular ground-state estimation, in logistics and finance for combinatorial optimization, and in machine learning for generative and recommendation models. Notably, they often surpass purely classical or purely quantum approaches on carefully chosen benchmarks. The evidence indicates that hybrid classical-quantum systems are not a temporary stopgap but a durable paradigm. Their role will persist into the early fault-tolerant era, where small, logical qubits will similarly require classical coordination. Consequently, the field urgently demands the establishment of standardized hybrid performance benchmarks, the maturation of robust quantum-classical middleware capable of efficient transpiration and execution management, and holistic co-design frameworks that seamlessly integrate hardware constraints, software stack layers, and application-specific requirements from the outset.
As quantum hardware advances, integrating quantum processing units (QPUs) into HPC environments and managing diverse infrastructure and software stacks becomes increasingly essential. Pilot-Quantum addresses these challenges as a middleware designed to provide unified application-level management of resources and workloads across hybrid quantumclassical environments. It is built on a rigorous analysis of existing quantum middleware systems and application execution patterns. It implements the Pilot Abstraction conceptual model, originally developed for HPC, to manage resources, workloads, and tasks. It is designed for quantum applications that rely on task parallelism, including (i) Hybrid algorithms, such as variational approaches, and (ii) Circuit cutting systems, used to partition and execute large quantum circuits. Pilot-Quantum facilitates seamless integration of QPUs, classical CPUs, and GPUs, while supporting high-level programming frameworks like Qiskit and Pennylane. This enables users to efficiently design and execute hybrid workflows across diverse computing resources. The capabilities of Pilot-Quantum are demonstrated through mini-apps - simplified yet representative kernels focusing on critical performance bottlenecks. We demonstrate the capabilities of Pilot-Quantum through multiple mini-apps, including different circuit execution (e.g., using IBM's Eagle QPU and simulators), circuit-cutting, and quantum machine learning scenarios.