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

IEEE International Conference on Cluster Computing (CLUSTER)

Empirical Characterization of Quantum Workloads on Heterogeneous Resources for Quantum Simulation

Jiwon Ha, 박숙영, Hyeonsang Eom, Yoonhee Kim

Published Sep 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/cluster68337.2026.00045

Related papers

GPU-Accelerated Quantum Simulation: Empirical Backend Selection, Gate Fusion, and Adaptive Precision

Poornima Kumaresan, Pavithra Muruganantham, Lakshmi Rajendran +1 more

Classical simulation of quantum circuits remains indispensable for algorithm development, hardware validation, and error analysis in the noisy intermediate-scale quantum (NISQ) era. However, state-vector simulation faces exponential memory scaling, with an n-qubit system requiring O(2^n) complex amplitudes, and existing simulators often lack the flexibility to exploit heterogeneous computing resources at runtime. This paper presents a GPU-accelerated quantum circuit simulation framework that introduces three contributions: (1) an empirical backend selection algorithm that benchmarks CuPy, PyTorch-CUDA, and NumPy-CPU backends at runtime and selects the optimal execution path based on measured throughput; (2) a directed acyclic graph (DAG) based gate fusion engine that reduces circuit depth through automated identification of fusible gate sequences, coupled with adaptive precision switching between complex64 and complex128 representations; and (3) a memory-aware fallback mechanism that monitors GPU memory consumption and gracefully degrades to CPU execution when resources are exhausted. The framework integrates with Qiskit, Cirq, PennyLane, and Amazon Braket through a unified adapter layer. Benchmarks on an NVIDIA A100-SXM4 (40 GiB) GPU demonstrate speedups of 64x to 146x over NumPy CPU execution for state-vector simulation of circuits with 20 to 28 qubits, with speedups exceeding 5x from 16 qubits onward. Hardware validation on an IBM quantum processing unit (QPU) confirms Bell state fidelity of 0.939, a five-qubit Greenberger-Horne-Zeilinger (GHZ) state fidelity of 0.853, and circuit depth reduction from 42 to 14 gates through the fusion pipeline. The system is designed for portability across NVIDIA consumer and data-center GPUs, requiring no vendor-specific compilation steps.

quant-pharXiv:2604.03816•Apr 7, 2026•3 citations

A Dependability Profile for Hybrid Quantum–Classical Systems

Piyush A. Sonawane, Andrew Kelly, Naveed Mahmud

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.

International Conference on Dependable Systems and Networks workshops•Jun 22, 2026•0 citations

Benchmark Study for Quantum Statevector Simulators for Scientific Computing

Timothy M. Yeo, Rodney W. Lessard

Quantum circuit simulators are essential for quantum algorithm development, yet systematic runtime benchmarks comparing major frameworks across CPU and GPU backends are limited. We benchmark three open-source frameworks - Cirq (qsim), CUDA-Q, and Qiskit (Aer) - on statevector simulation of the 2D quantum acoustic wave equation, evolved via Trotterized Hamiltonian dynamics, for problem sizes from 7 to 29 qubits on a single Azure virtual machine. The evaluation spans four categories: CPU runtime versus qubit count, strong scalability on multi-core CPUs at 27 qubits, GPU runtime versus qubit count, and GPU-over-CPU speedup. Relative rankings shift from one category to the next. On CPU, Cirq is fastest up to 23 qubits (2.4x faster than Qiskit at 21 qubits), but Qiskit overtakes it at larger sizes and higher thread counts, sustaining 80% parallel efficiency at 16 threads. On GPU, CUDA-Q leads between 13 and 21 qubits, while Cirq becomes the fastest GPU backend at large problem sizes, achieving 1.5x and 2.3x speedups over CUDA-Q and Qiskit at 29 qubits. GPU-over-CPU speedup ratios should be interpreted alongside absolute GPU runtimes; CUDA-Q's 1500x at 21 qubits is largely driven by the limited scaling of its CPU backend (qpp), and the absolute GPU runtimes show that the three frameworks' GPU backends differ by less than these ratios alone suggest. These results indicate that no single framework dominates across configurations, and that backend selection for statevector simulation should be guided by both target hardware and problem size.

physics.geo-phCross-listedarXiv:2611.01176•Nov 3, 2026•0 citations

Investigation of Hardware Architecture Effects on Quantum Algorithm Performance: A Comparative Hardware Study

Askar Oralkhan, Temirlan Zhaxalykov

Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices due to architectural variations in qubit connectivity, gate fidelity, and coherence times. In this work, we systematically benchmark five representative quantum algorithms - Bell state preparation, GHZ state generation, Quantum Fourier Transform (QFT), Grover's Search, and the Quantum Approximate Optimization Algorithm (QAOA) - across trapped-ion, superconducting, and simulator backends using Amazon Braket. Performance metrics including fidelity, CHSH violation, success probability, circuit depth, and gate counts are evaluated. Our results demonstrate a strong dependence of algorithmic performance on hardware topology and noise characteristics. For example, 10-qubit GHZ states achieved fidelities above 0.8 on trapped-ion hardware, while superconducting platforms dropped below 0.15 due to routing overhead and accumulated two-qubit gate errors. These findings highlight the importance of hardware-aware algorithm selection and provide practical guidance for benchmarking in the NISQ era.

quant-pharXiv:2601.05286•Jan 8, 2026•1 citation

Hardware Agnostic Backend Adaptation through Quantum Circuit Evaluation

Abhishek Sharma, Kailash S, D Ethirajan

Quantum development platforms usually provide a choice of numerous simulators and quantum processing units (QPUs) for users to choose from and users are still forced to choose and configure a backend manually. As backend collections increase in size, the manual process consists of speculation or manual exploration with limitations in terms of performance and scalability. The approach specified in this paper, although applicable for major platforms, focuses on Qniverse,an unified quantum computing platform that has an integrated working environment for quantum circuit design and execution but still back ends are to be selected manually. The limitations of backend selection through manual conclusion are that novice users are affected and there are complexities in executing the operations. This paper introduces a hardware agnostic backend adaptation that automates the backend selection using circuit analyses and multi criteria backend ranking. The proposed model has three major modules. First is the Circuit Analysis Engine that identifies quantum circuit structure in terms of number of qubits, circuit depth and component gates. Second is a Backend Capability Mapping module that stores each backend capability details in structured forms. Third is an Intelligent Backend Recommendation Algorithm that specifically selects and weighs backend candidates according to latency time, accuracy level, cost constraints and resource allocation. All three unite to form an integrated quantum middleware adoption.

EPJ Web of Conferences•Jan 1, 2026•1 citation

Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management

Pradeep Mantha, Florian J. Kiwit, Nishant Saurabh +2 more

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.

quant-pharXiv:2604.03445•Apr 7, 2026•2 citations
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.
Classical simulation of quantum circuits remains indispensable for algorithm development, hardware validation, and error analysis in the noisy intermediate-scale quantum (NISQ) era. However, state-vector simulation faces exponential memory scaling, with an n-qubit system requiring O(2^n) complex amplitudes, and existing simulators often lack the flexibility to exploit heterogeneous computing resources at runtime. This paper presents a GPU-accelerated quantum circuit simulation framework that introduces three contributions: (1) an empirical backend selection algorithm that benchmarks CuPy, PyTorch-CUDA, and NumPy-CPU backends at runtime and selects the optimal execution path based on measured throughput; (2) a directed acyclic graph (DAG) based gate fusion engine that reduces circuit depth through automated identification of fusible gate sequences, coupled with adaptive precision switching between complex64 and complex128 representations; and (3) a memory-aware fallback mechanism that monitors GPU memory consumption and gracefully degrades to CPU execution when resources are exhausted. The framework integrates with Qiskit, Cirq, PennyLane, and Amazon Braket through a unified adapter layer. Benchmarks on an NVIDIA A100-SXM4 (40 GiB) GPU demonstrate speedups of 64x to 146x over NumPy CPU execution for state-vector simulation of circuits with 20 to 28 qubits, with speedups exceeding 5x from 16 qubits onward. Hardware validation on an IBM quantum processing unit (QPU) confirms Bell state fidelity of 0.939, a five-qubit Greenberger-Horne-Zeilinger (GHZ) state fidelity of 0.853, and circuit depth reduction from 42 to 14 gates through the fusion pipeline. The system is designed for portability across NVIDIA consumer and data-center GPUs, requiring no vendor-specific compilation steps.
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.
Quantum circuit simulators are essential for quantum algorithm development, yet systematic runtime benchmarks comparing major frameworks across CPU and GPU backends are limited. We benchmark three open-source frameworks - Cirq (qsim), CUDA-Q, and Qiskit (Aer) - on statevector simulation of the 2D quantum acoustic wave equation, evolved via Trotterized Hamiltonian dynamics, for problem sizes from 7 to 29 qubits on a single Azure virtual machine. The evaluation spans four categories: CPU runtime versus qubit count, strong scalability on multi-core CPUs at 27 qubits, GPU runtime versus qubit count, and GPU-over-CPU speedup. Relative rankings shift from one category to the next. On CPU, Cirq is fastest up to 23 qubits (2.4x faster than Qiskit at 21 qubits), but Qiskit overtakes it at larger sizes and higher thread counts, sustaining 80% parallel efficiency at 16 threads. On GPU, CUDA-Q leads between 13 and 21 qubits, while Cirq becomes the fastest GPU backend at large problem sizes, achieving 1.5x and 2.3x speedups over CUDA-Q and Qiskit at 29 qubits. GPU-over-CPU speedup ratios should be interpreted alongside absolute GPU runtimes; CUDA-Q's 1500x at 21 qubits is largely driven by the limited scaling of its CPU backend (qpp), and the absolute GPU runtimes show that the three frameworks' GPU backends differ by less than these ratios alone suggest. These results indicate that no single framework dominates across configurations, and that backend selection for statevector simulation should be guided by both target hardware and problem size.
Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices due to architectural variations in qubit connectivity, gate fidelity, and coherence times. In this work, we systematically benchmark five representative quantum algorithms - Bell state preparation, GHZ state generation, Quantum Fourier Transform (QFT), Grover's Search, and the Quantum Approximate Optimization Algorithm (QAOA) - across trapped-ion, superconducting, and simulator backends using Amazon Braket. Performance metrics including fidelity, CHSH violation, success probability, circuit depth, and gate counts are evaluated. Our results demonstrate a strong dependence of algorithmic performance on hardware topology and noise characteristics. For example, 10-qubit GHZ states achieved fidelities above 0.8 on trapped-ion hardware, while superconducting platforms dropped below 0.15 due to routing overhead and accumulated two-qubit gate errors. These findings highlight the importance of hardware-aware algorithm selection and provide practical guidance for benchmarking in the NISQ era.
Quantum development platforms usually provide a choice of numerous simulators and quantum processing units (QPUs) for users to choose from and users are still forced to choose and configure a backend manually. As backend collections increase in size, the manual process consists of speculation or manual exploration with limitations in terms of performance and scalability. The approach specified in this paper, although applicable for major platforms, focuses on Qniverse,an unified quantum computing platform that has an integrated working environment for quantum circuit design and execution but still back ends are to be selected manually. The limitations of backend selection through manual conclusion are that novice users are affected and there are complexities in executing the operations. This paper introduces a hardware agnostic backend adaptation that automates the backend selection using circuit analyses and multi criteria backend ranking. The proposed model has three major modules. First is the Circuit Analysis Engine that identifies quantum circuit structure in terms of number of qubits, circuit depth and component gates. Second is a Backend Capability Mapping module that stores each backend capability details in structured forms. Third is an Intelligent Backend Recommendation Algorithm that specifically selects and weighs backend candidates according to latency time, accuracy level, cost constraints and resource allocation. All three unite to form an integrated quantum middleware adoption.
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.