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

arXiv:2609.05814

Towards Continuous Profiling and Optimization of Quantum-Classical Pipelines

Ayush Bansal, Owen Cochell, Santiago Núñez-Corrales, Marcos Frenkel, Seetharami Seelam, Apoorve Mohan, Tianyin Xu

quant-phcs.ETcs.OSSubmitted Sep 5, 2026• Announced Sep 8, 2026• 0 citations• Revised Sep 10, 2026 (v2)
v1 · Sep 5, 2026v2 · Sep 10, 2026
arXivHTMLPDF

Abstract

Quantum applications increasingly execute as multi-stage quantum-classical pipelines, interleaving QPU computation with classical stages like circuit generation, transpilation, layout mapping, quantum error mitigation (QEM), and post-processing. These stages have diverse resource requirements and exhibit stochastic behavior under drifting hardware noises, yet existing workflow frameworks treat them as static, isolated components. We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines. LLQM decomposes pipelines into fine-grained tasks and continuously profiles their CPU/GPU, memory, QPU, and queue dependencies alongside real-time hardware states. This unified runtime abstraction captures cross-stage resource dependencies and reveals how classical and quantum decisions interact, enabling characterization of their impact on fidelity and resource consumption. We evaluate LLQM using QEM as a representative pipeline stage, on IBM 156-qubit Heron r2 processors with circuits up to 100 qubits and 1e7 transpiled gates. Our results show that continuous profiling exposes runtime bottlenecks and enables hardware-, fidelity-, and workload-aware optimizations.

Related papers

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

TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency

Mohammad Abrarul Hasanat, Jason Ludmir, Tirthak Patel +1 more

Quantum processors are being integrated into HPC ecosystems as co-processors, where compilation of quantum circuits into hardware-executable form determines both output fidelity and runtime. Current compilers use a fixed pass sequence and ignore the fact that optimal pass selection varies with circuit, hardware, and noise conditions. We present TuniQ, a reinforcement learning-based system that selects compilation passes at each pipeline stage, adapting to circuit, backend, and current noise profile. TuniQ introduces several novel design components like a dual-encoder for stage-aware representation, shaped rewards for cross-stage credit assignment, and dynamic action masking for valid compilation. Evaluated across diverse quantum workloads on multiple IBM Quantum Cloud processors, TuniQ improves fidelity and reduces compilation time over the state-of-the-art IBM Qiskit transpiler, generalizes across backends without retraining, and scales strongly to utility-scale circuits with growing advantage.

quant-pharXiv:2605.11375•International Conference on Supercomputing•May 13, 2026•2 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

System-Level Optimization of Quantum-Classical Computing Pipelines

Erik Bianchi, Marco Jensen

Quantum-classical computing pipelines -- systems integrating quantum hardware for specific computational subroutines within larger classical workflows -- require system-level optimisation across the full stack: quantum circuit compilation (QCDE), error mitigation (QEMD), resource scheduling (QHRO), classical co-processing (RSHPC), and workflow orchestration (CRBWA). Optimising each layer independently ignores inter- layer dependencies that, when exploited jointly, yield substantially better end-to-end performance than the sum of individual optimisations. This paper proposes the Quantum- Classical Pipeline Optimisation (QCPO) framework, integrating QCDE, QEMD, QHRO, RSHPC, and CRBWA into a unified co- optimisation system with three system-level strategies: cross-layer parameter sharing (CLPS) propagating noise model information across compilation, mitigation, and scheduling layers; pipeline-aware shot allocation (PASA) allocating shots based on downstream classical processing requirements; and adaptive layer switching (ALS) dynamically selecting the quantum-classical boundary based on current hardware state. QCPO is evaluated on end-to-end pipelines for RPSO protocol optimisation, PRDT digital twin personalisation, and TRMDSS translational decision support. QCPO reduces total pipeline cost by 58.4% and end-to-end latency by 48.4% vs. independently-optimised layers on identical hardware.

Quantum Frontiers Journal•Jun 28, 2025•0 citations

Parallelizing Quantum-Classical Workloads: Profiling the Impact of Splitting Techniques

Tuhin Khare, Ritajit Majumdar, Rajiv Sangle +3 more

Quantum computers are the next evolution of computing hardware. Quantum devices are being exposed through the same familiar cloud platforms used for classical computers, and enabling seamless execution of hybrid applications that combine quantum and classical components. Quantum devices vary in features, e.g., number of qubits, quantum volume, CLOPS, noise profile, queuing delays and resource cost. So, it may be useful to split hybrid workloads with either large quantum circuits or a large number of quantum circuits, into smaller units. In this paper, we profile two workload splitting techniques on IBM's Quantum Cloud: (1) Circuit parallelization, to split one large circuit into multiple smaller ones, and (2) Data parallelization to split a large number of circuits that run on one device to smaller batches of circuits that run on concurrently on multiple devices. These can improve the utilization of heterogeneous quantum hardware, but involve trade-offs. We evaluate these techniques on two key algorithmic classes: Variational Quantum Eigensolver (VQE) and Quantum Support Vector Machine (QSVM), and measure the impact on quality of the result, circuit execution times, quantum resource usage, and processing overheads, relative to a baseline without such parallelization. The results are obtained on real hardware and complemented by simulations. We see that (1) VQE with circuit cutting is ~ 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with a reduced feature set yields upto 3 ×improvement in quantum workload execution time and reduces quantum resource use by 3 ×, while providing comparable accuracy. Error mitigation can improve the accuracy by ≈ 7% and reduce resource footprint by ≈4% compared to the best case among the considered scenarios.

arXiv:2305.06585•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•16 citations

HybridQC: Hardware-Grounded Simulation of Tightly Integrated Hybrid Quantum-Classical Systems

Panayiotis Christou, Shuwen Kan, Ying Mao

Hybrid quantum-classical performance depends on how quantum processors share classical compute, controllers, memory, and communication links. Circuit simulators and provider measurements expose kernel and job behavior, but leave topology-level questions about controller bottlenecks, quantum capacity, and mixed-workload contention unanswered. We present HybridQC, a discrete-event simulator for configurable hybrid compute units (HCUs). Users specify resource graphs containing classical compute, memory, controllers, quantum annealing (QA) and digital quantum computing (DQC) devices, and links. Jobs become dependent stages for preparation, quantum execution, transfers, reconstruction, and postprocessing. Finite capacities and selectable scheduling policies determine where stages wait and overlap. Service profiles use measurements from D-Wave Advantage 1 and Advantage 2 and IBM Kingston, Marrakesh, and Fez, separating physical quantum-processor occupancy from cloud wall time. Mean absolute percentage errors are 3.92%-8.04% for D-Wave access time and 5.26%-19.01% for IBM quantum seconds. Balanced 10x HCU scaling improves makespan by 2.19x-3.42x, while policy choice changes makespan by 1.80x for a mixed workload with 20 jobs per workload family. Scaling depends on which inputs grow: 100x data growth yields median runtime near 306 s, while 100x joint growth in circuits, shots, and depth reaches 4.806 x 10^7 s on the fixed HCU. HybridQC enables designers to study topology, scheduling, and workload growth before tightly integrated quantum-classical machines exist physically.

cs.PFCross-listedarXiv:2607.13352•Jul 16, 2026•2 citations
Quantum applications increasingly execute as multi-stage quantum-classical pipelines, interleaving QPU computation with classical stages like circuit generation, transpilation, layout mapping, quantum error mitigation (QEM), and post-processing. These stages have diverse resource requirements and exhibit stochastic behavior under drifting hardware noises, yet existing workflow frameworks treat them as static, isolated components. We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines. LLQM decomposes pipelines into fine-grained tasks and continuously profiles their CPU/GPU, memory, QPU, and queue dependencies alongside real-time hardware states. This unified runtime abstraction captures cross-stage resource dependencies and reveals how classical and quantum decisions interact, enabling characterization of their impact on fidelity and resource consumption. We evaluate LLQM using QEM as a representative pipeline stage, on IBM 156-qubit Heron r2 processors with circuits up to 100 qubits and 1e7 transpiled gates. Our results show that continuous profiling exposes runtime bottlenecks and enables hardware-, fidelity-, and workload-aware optimizations.
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 processors are being integrated into HPC ecosystems as co-processors, where compilation of quantum circuits into hardware-executable form determines both output fidelity and runtime. Current compilers use a fixed pass sequence and ignore the fact that optimal pass selection varies with circuit, hardware, and noise conditions. We present TuniQ, a reinforcement learning-based system that selects compilation passes at each pipeline stage, adapting to circuit, backend, and current noise profile. TuniQ introduces several novel design components like a dual-encoder for stage-aware representation, shaped rewards for cross-stage credit assignment, and dynamic action masking for valid compilation. Evaluated across diverse quantum workloads on multiple IBM Quantum Cloud processors, TuniQ improves fidelity and reduces compilation time over the state-of-the-art IBM Qiskit transpiler, generalizes across backends without retraining, and scales strongly to utility-scale circuits with growing advantage.
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.
Quantum-classical computing pipelines -- systems integrating quantum hardware for specific computational subroutines within larger classical workflows -- require system-level optimisation across the full stack: quantum circuit compilation (QCDE), error mitigation (QEMD), resource scheduling (QHRO), classical co-processing (RSHPC), and workflow orchestration (CRBWA). Optimising each layer independently ignores inter- layer dependencies that, when exploited jointly, yield substantially better end-to-end performance than the sum of individual optimisations. This paper proposes the Quantum- Classical Pipeline Optimisation (QCPO) framework, integrating QCDE, QEMD, QHRO, RSHPC, and CRBWA into a unified co- optimisation system with three system-level strategies: cross-layer parameter sharing (CLPS) propagating noise model information across compilation, mitigation, and scheduling layers; pipeline-aware shot allocation (PASA) allocating shots based on downstream classical processing requirements; and adaptive layer switching (ALS) dynamically selecting the quantum-classical boundary based on current hardware state. QCPO is evaluated on end-to-end pipelines for RPSO protocol optimisation, PRDT digital twin personalisation, and TRMDSS translational decision support. QCPO reduces total pipeline cost by 58.4% and end-to-end latency by 48.4% vs. independently-optimised layers on identical hardware.
Quantum computers are the next evolution of computing hardware. Quantum devices are being exposed through the same familiar cloud platforms used for classical computers, and enabling seamless execution of hybrid applications that combine quantum and classical components. Quantum devices vary in features, e.g., number of qubits, quantum volume, CLOPS, noise profile, queuing delays and resource cost. So, it may be useful to split hybrid workloads with either large quantum circuits or a large number of quantum circuits, into smaller units. In this paper, we profile two workload splitting techniques on IBM's Quantum Cloud: (1) Circuit parallelization, to split one large circuit into multiple smaller ones, and (2) Data parallelization to split a large number of circuits that run on one device to smaller batches of circuits that run on concurrently on multiple devices. These can improve the utilization of heterogeneous quantum hardware, but involve trade-offs. We evaluate these techniques on two key algorithmic classes: Variational Quantum Eigensolver (VQE) and Quantum Support Vector Machine (QSVM), and measure the impact on quality of the result, circuit execution times, quantum resource usage, and processing overheads, relative to a baseline without such parallelization. The results are obtained on real hardware and complemented by simulations. We see that (1) VQE with circuit cutting is ~ 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with a reduced feature set yields upto 3 ×improvement in quantum workload execution time and reduces quantum resource use by 3 ×, while providing comparable accuracy. Error mitigation can improve the accuracy by ≈ 7% and reduce resource footprint by ≈4% compared to the best case among the considered scenarios.
Hybrid quantum-classical performance depends on how quantum processors share classical compute, controllers, memory, and communication links. Circuit simulators and provider measurements expose kernel and job behavior, but leave topology-level questions about controller bottlenecks, quantum capacity, and mixed-workload contention unanswered. We present HybridQC, a discrete-event simulator for configurable hybrid compute units (HCUs). Users specify resource graphs containing classical compute, memory, controllers, quantum annealing (QA) and digital quantum computing (DQC) devices, and links. Jobs become dependent stages for preparation, quantum execution, transfers, reconstruction, and postprocessing. Finite capacities and selectable scheduling policies determine where stages wait and overlap. Service profiles use measurements from D-Wave Advantage 1 and Advantage 2 and IBM Kingston, Marrakesh, and Fez, separating physical quantum-processor occupancy from cloud wall time. Mean absolute percentage errors are 3.92%-8.04% for D-Wave access time and 5.26%-19.01% for IBM quantum seconds. Balanced 10x HCU scaling improves makespan by 2.19x-3.42x, while policy choice changes makespan by 1.80x for a mixed workload with 20 jobs per workload family. Scaling depends on which inputs grow: 100x data growth yields median runtime near 306 s, while 100x joint growth in circuits, shots, and depth reaches 4.806 x 10^7 s on the fixed HCU. HybridQC enables designers to study topology, scheduling, and workload growth before tightly integrated quantum-classical machines exist physically.