Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Dependable Systems and Networks workshops

A Dependability Profile for Hybrid Quantum–Classical Systems

Piyush A. Sonawane, Andrew Kelly, Naveed Mahmud

Published Jun 22, 2026• 0 citations
Publisher

Abstract

Hybrid quantum–classical computing is a key paradigm for executing quantum algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices. However, the dependability of quantum–classical workflows under realistic system conditions remains underexplored. These workflows often involve heterogeneous resources, including CPUs, GPUs, FPGAs, and cloud-accessible QPUs, introducing variability, resource constraints, and trust concerns. In this work, we propose a methodology for benchmarking the dependability of quantum–classical workflows and their execution on hybrid systems. Our methodology involves establishing a dependability profile for workloads and corresponding systems using empirical measurements and evaluations of standard metrics of speed, scalability, and security of the overall system. Experimental evaluation includes two variational algorithms as case studies deployed on a hybrid CPU–FPGA system with QPU emulation backends that replicate the noise characteristics and gate sets of real quantum processors. For the dependability profile, we define iteration-level metrics for speed: variance, jitter, worst-case latency, stability, and resource-aware scalability metrics: Circuit Layer Operations Per Second (CLOPS). Results demonstrate that the proposed dependability profile enables practical decision-making by linking system behavior to deployability and performance limitations.

DOI
10.1109/dsn-w70714.2026.00046

Related papers

Hybrid Classical-Quantum Systems: The Unsung Heroes of the NISQ Era

Sayed Mahbub Hasan Amiri, Atiar Zahan

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.

•Jan 1, 2026•0 citations

Kubernetes-Orchestrated Hybrid Quantum-Classical Workflows

Mar Tejedor, Michele Grossi, Cenk Tüysüz +2 more

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.

quant-pharXiv:2603.24206•Mar 26, 2026•6 citations

Latency Characterization of Quantum-Classical Workflows on an Embedded System-on-Chip

Piyush A. Sonawane, Andrew Kelly, Naveed Mahmud

Hybrid quantum-classical algorithms rely on iterative data exchange between quantum circuit execution and classical post-processing. As the quantum circuit size increases, communication and computation latencies within these exchanges become a critical system bottleneck. In this work, we present a system-level latency characterization of a hybrid quantumclassical learning workflow implemented on a cost-effective embedded system-on-chip (SoC). We evaluate a heterogeneous execution model where the quantum forward pass is executed on either local simulator or actual Quantum Processing Unit (QPU), while classical post-processing functions such as loss computation, gradient estimation, and parameter updates are accelerated on a low-latency Field-Programmable Gate Array (FPGA) pipeline. We measure end-to-end iteration latency for quantum machine learning circuits ranging from 4 to 14 qubits, investigating CPU-FPGA and QPU-FPGA workflows. Our findings provide a performance blueprint for future design and integration of low-latency embedded systems with utility-scale quantum computing systems.

IEEE Dallas Circuits and Systems Conference (DCAS)•Apr 10, 2026•0 citations

NISQ in practice: navigating noise, scale, and hardware constraints of near-term devices in quantum machine learning workflows

Chisomo Daka, Somnath Bhattacharyya

Abstract The arrival of noisy intermediate-scale quantum (NISQ) devices defines an era in which quantum utility is fundamentally constrained by finite coherence times, limited qubit counts, gate infidelities, restricted connectivity, and measurement noise. Within this regime, hybrid quantum-classical frameworks have emerged as the dominant operational paradigm, particularly for quantum machine learning (QML). This review identifies a fundamental trade-off between expressivity, trainability, and noise resilience that governs the performance and scalability of NISQ-era QML systems. To contextualize these challenges, we introduce the resource-constrained iterative routing framework, a hardware-aware conceptual architecture that integrates topology-aware classical compression and distributed quantum orchestration to maintain circuit depths within device-dependent limits while routing representations toward symmetry-constrained Hilbert subspaces to mitigate noise-induced barren plateaus. Furthermore, we shift the discussion of quantum advantage away from asymptotic fault-tolerant complexity toward the notion of operational NISQ advantage based on finite-resource scaling, trainability preservation, and sampling complexity. We evaluate the practical resource efficiency of variational quantum algorithms, quantum kernel methods, and quantum neural networks across superconducting, trapped-ion, neutral-atom, and photonic platforms. The review also examines reproducibility challenges, emphasizing benchmarking against optimized classical baselines, and discusses strategies for managing the sampling overhead of error mitigation alongside distributed execution and quantum circuit compilation. Ultimately, NISQ in Practice positions hybrid QML as a physically constrained computational paradigm while outlining a pathway from contemporary noisy workflows toward early fault-tolerant quantum architectures.

New Journal of Physics•Jun 22, 2026•1 citation

CLOPS: Benchmarking System Speed at Utility Scale

Andrew Wack

As quantum processors scale to hundreds of qubits, execution speed is a critical performance dimension alongside scale and quality. While substantial progress has been made in benchmarking circuit fidelity, existing speed metrics often fail to reflect the sustained, end-to-end throughput experienced by users running utility-scale workloads. This shortfall is especially pronounced for layered, parameterized circuits executed repeatedly within classical-quantum workflows, such as variational algorithms and error-mitigated simulations. In this work, we formalize CLOPS_h (Circuit Layer Operations Per Second) as a holistic speed benchmark defined over layered, hardware-aware circuits. CLOPS_h measures the sustained rate at which the system executes physical layers, parallel slices of qubit-disjoint two-qubit gates separated by synchronization barriers. Because each such layer is one time slice of an N-qubit circuit, this rate maps directly to the execution rate of layered $N$-qubit circuits, connecting CLOPS_h to published device capability claims, and to the device-level throughput ceiling we formalize as Max Circuits Per Second (MCPS). CLOPS_h is obtained under layer-fidelity operating conditions, binding the speed measurement to an independently verified quality envelope, and it shares its layer decomposition with scalable layer-fidelity (LF) quality benchmarks, enabling coherent interpretation of speed and quality without conflating the two.

quant-pharXiv:2608.18044•Aug 19, 2026•0 citations

Empirical Characterization of Quantum Workloads on Heterogeneous Resources for Quantum Simulation

Jiwon Ha, 박숙영, Hyeonsang Eom +1 more

Quantum cloud platforms increasingly provide access to heterogeneous execution backends including real QPUs and quantum simulators. Effective backend selection is challenging because runtime and output quality vary with workload structure, backend characteristics, and noise conditions. This paper presents an empirical characterization study of how quantum workload properties shape execution across heterogeneous classical simulator backends, focusing on a CPU/GPU-based statevector simulation method. The workload characteristics examined in this study include qubit count, circuit depth, two-qubit gate density, workload class, and noise sensitivity. The experiments show qubit count and circuit depth are primary factors for simulation cost. Two-qubit gate density and workload class affect backend affinity. For example, CPU/GPU affinity in Grover varies with the depth of circuits. Shallow circuits have lower runtime on CPUs, whereas deep circuits have lower runtime on GPUs. Four backend-selection criteria (BS1-BS4) provide analytical bases to examine the effects of circuit structure, workload class, noise tiers, and measurement-derived profiles. The results show characterization-driven backend selection performs better than relying on coarse-grained workload information alone in heterogeneous quantum simulation environments.

IEEE International Conference on Cluster Computing (CLUSTER)•Sep 1, 2026•0 citations
Hybrid quantum–classical computing is a key paradigm for executing quantum algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices. However, the dependability of quantum–classical workflows under realistic system conditions remains underexplored. These workflows often involve heterogeneous resources, including CPUs, GPUs, FPGAs, and cloud-accessible QPUs, introducing variability, resource constraints, and trust concerns. In this work, we propose a methodology for benchmarking the dependability of quantum–classical workflows and their execution on hybrid systems. Our methodology involves establishing a dependability profile for workloads and corresponding systems using empirical measurements and evaluations of standard metrics of speed, scalability, and security of the overall system. Experimental evaluation includes two variational algorithms as case studies deployed on a hybrid CPU–FPGA system with QPU emulation backends that replicate the noise characteristics and gate sets of real quantum processors. For the dependability profile, we define iteration-level metrics for speed: variance, jitter, worst-case latency, stability, and resource-aware scalability metrics: Circuit Layer Operations Per Second (CLOPS). Results demonstrate that the proposed dependability profile enables practical decision-making by linking system behavior to deployability and performance limitations.
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.
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.
Hybrid quantum-classical algorithms rely on iterative data exchange between quantum circuit execution and classical post-processing. As the quantum circuit size increases, communication and computation latencies within these exchanges become a critical system bottleneck. In this work, we present a system-level latency characterization of a hybrid quantumclassical learning workflow implemented on a cost-effective embedded system-on-chip (SoC). We evaluate a heterogeneous execution model where the quantum forward pass is executed on either local simulator or actual Quantum Processing Unit (QPU), while classical post-processing functions such as loss computation, gradient estimation, and parameter updates are accelerated on a low-latency Field-Programmable Gate Array (FPGA) pipeline. We measure end-to-end iteration latency for quantum machine learning circuits ranging from 4 to 14 qubits, investigating CPU-FPGA and QPU-FPGA workflows. Our findings provide a performance blueprint for future design and integration of low-latency embedded systems with utility-scale quantum computing systems.
Abstract The arrival of noisy intermediate-scale quantum (NISQ) devices defines an era in which quantum utility is fundamentally constrained by finite coherence times, limited qubit counts, gate infidelities, restricted connectivity, and measurement noise. Within this regime, hybrid quantum-classical frameworks have emerged as the dominant operational paradigm, particularly for quantum machine learning (QML). This review identifies a fundamental trade-off between expressivity, trainability, and noise resilience that governs the performance and scalability of NISQ-era QML systems. To contextualize these challenges, we introduce the resource-constrained iterative routing framework, a hardware-aware conceptual architecture that integrates topology-aware classical compression and distributed quantum orchestration to maintain circuit depths within device-dependent limits while routing representations toward symmetry-constrained Hilbert subspaces to mitigate noise-induced barren plateaus. Furthermore, we shift the discussion of quantum advantage away from asymptotic fault-tolerant complexity toward the notion of operational NISQ advantage based on finite-resource scaling, trainability preservation, and sampling complexity. We evaluate the practical resource efficiency of variational quantum algorithms, quantum kernel methods, and quantum neural networks across superconducting, trapped-ion, neutral-atom, and photonic platforms. The review also examines reproducibility challenges, emphasizing benchmarking against optimized classical baselines, and discusses strategies for managing the sampling overhead of error mitigation alongside distributed execution and quantum circuit compilation. Ultimately, NISQ in Practice positions hybrid QML as a physically constrained computational paradigm while outlining a pathway from contemporary noisy workflows toward early fault-tolerant quantum architectures.
As quantum processors scale to hundreds of qubits, execution speed is a critical performance dimension alongside scale and quality. While substantial progress has been made in benchmarking circuit fidelity, existing speed metrics often fail to reflect the sustained, end-to-end throughput experienced by users running utility-scale workloads. This shortfall is especially pronounced for layered, parameterized circuits executed repeatedly within classical-quantum workflows, such as variational algorithms and error-mitigated simulations. In this work, we formalize CLOPS_h (Circuit Layer Operations Per Second) as a holistic speed benchmark defined over layered, hardware-aware circuits. CLOPS_h measures the sustained rate at which the system executes physical layers, parallel slices of qubit-disjoint two-qubit gates separated by synchronization barriers. Because each such layer is one time slice of an N-qubit circuit, this rate maps directly to the execution rate of layered NNN-qubit circuits, connecting CLOPS_h to published device capability claims, and to the device-level throughput ceiling we formalize as Max Circuits Per Second (MCPS). CLOPS_h is obtained under layer-fidelity operating conditions, binding the speed measurement to an independently verified quality envelope, and it shares its layer decomposition with scalable layer-fidelity (LF) quality benchmarks, enabling coherent interpretation of speed and quality without conflating the two.
Quantum cloud platforms increasingly provide access to heterogeneous execution backends including real QPUs and quantum simulators. Effective backend selection is challenging because runtime and output quality vary with workload structure, backend characteristics, and noise conditions. This paper presents an empirical characterization study of how quantum workload properties shape execution across heterogeneous classical simulator backends, focusing on a CPU/GPU-based statevector simulation method. The workload characteristics examined in this study include qubit count, circuit depth, two-qubit gate density, workload class, and noise sensitivity. The experiments show qubit count and circuit depth are primary factors for simulation cost. Two-qubit gate density and workload class affect backend affinity. For example, CPU/GPU affinity in Grover varies with the depth of circuits. Shallow circuits have lower runtime on CPUs, whereas deep circuits have lower runtime on GPUs. Four backend-selection criteria (BS1-BS4) provide analytical bases to examine the effects of circuit structure, workload class, noise tiers, and measurement-derived profiles. The results show characterization-driven backend selection performs better than relying on coarse-grained workload information alone in heterogeneous quantum simulation environments.