Abstract Classical-to-quantum workload migration is not a direct code-translation task because theoretical speedup, reversible mapping, circuit resources, device noise, compilation, queueing, and classical--quantum orchestration must be considered together. This work presents CQ-Migrate, a structured decision framework for determining whether a workload should remain classical, be decomposed into a hybrid workflow, or be evaluated on a quantum processing unit. Grover search is used as an empirical case study. A true two-qubit Grover circuit was validated locally, executed on the Quantum Inspire QX emulator, and then evaluated on the 17-qubit Tuna-17 superconducting processor. Four marked states were tested with five independent hardware runs per state and 1024 shots per run, totaling 20,480 hardware shots. The emulator returned the marked state in 100% of 4096 shots. Tuna-17 produced 19,076 correct measurements, corresponding to an aggregate success probability of 93.14% (95% Wilson interval: 92.79--93.48%). State-wise mean success ranged from 91.82% to 94.30%; run-level differences across marked states were statistically detectable (one-way ANOVA \((F=5.99)\), \((p=0.0062)\); Kruskal--Wallis \((H=10.88)\), \((p=0.0124)\)). The study also reports complete provider job provenance and reinterprets earlier archived IBM executions as a backend-variability control rather than a Grover validation. The results support evidence-driven, hardware-aware migration decisions without claiming practical quantum speedup for the small instance studied.
Abstract Classical-to-quantum workload migration is not a direct code-translation task because theoretical speedup, reversible mapping, circuit resources, device noise, compilation, queueing, and classical--quantum orchestration must be considered together. This work presents CQ-Migrate, a structured decision framework for determining whether a workload should remain classical, be decomposed into a hybrid workflow, or be evaluated on a quantum processing unit. Grover search is used as an empirical case study. A true two-qubit Grover circuit was validated locally, executed on the Quantum Inspire QX emulator, and then evaluated on the 17-qubit Tuna-17 superconducting processor. Four marked states were tested with five independent hardware runs per state and 1024 shots per run, totaling 20,480 hardware shots. The emulator returned the marked state in 100% of 4096 shots. Tuna-17 produced 19,076 correct measurements, corresponding to an aggregate success probability of 93.14% (95% Wilson interval: 92.79--93.48%). State-wise mean success ranged from 91.82% to 94.30%; run-level differences across marked states were statistically detectable (one-way ANOVA ((F=5.99)), ((p=0.0062)); Kruskal--Wallis ((H=10.88)), ((p=0.0124))). The study also reports complete provider job provenance and reinterprets earlier archived IBM executions as a backend-variability control rather than a Grover validation. The results support evidence-driven, hardware-aware migration decisions without claiming practical quantum speedup for the small instance studied.
Grover's quantum search algorithm provides a proven quadratic speedup over classical linear search for unstructured databases. While its theoretical advantage is well established, experimental validation on real noisy intermediate-scale quantum (NISQ) hardware remains limited by noise, decoherence, and hardware constraints. In this work, we present an experimental comparison between classical linear search and Grover's quantum search algorithm executed on IBM Quantum real superconducting hardware using Qiskit Runtime. A four-qubit implementation corresponding to a 16-element search space is evaluated across multiple experimental runs. The results demonstrate consistent amplitude amplification, achieving an average success probability of 54.25% and an amplification factor of 8.68× over random guessing. Although classical execution remains faster in wall-clock time due to quantum hardware overhead, the experiment empirically validates the algorithmic advantage of Grover's search and quantifies the performance gap between ideal and real quantum processors in the NISQ era.
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 transition from isolated quantum demonstrations to deployable hybrid quantum-classical infrastructures requires quantum nodes that are not only functional, but also experimentally characterized, diagnostically understood, and metrologically validated. In this work, a desktop NMR quantum computer is investigated as a physical node of a hybrid architecture rather than as a mere abstract backend for algorithm execution. A variational quantum circuit is adopted as a representative workload to probe the practical execution limits of the platform, with particular attention to runtime feasibility, RF compilation overhead, and stability of the measured probabilistic outputs. The experimental analysis shows that the main bottleneck is not only circuit depth, but also the analog compilation burden associated with arbitrary continuous-angle rotations, which can drive the total execution time beyond the effective coherence-compatible operating regime of the node. To address this issue, a hardware-aware redesign is introduced by constraining both trainable parameters and encoded inputs to LUT-compatible discrete angular values and by remapping negative angles through 2π module equivalence. This strategy substantially reduces execution overhead and enables operation within a regime compatible with stable on-hardware execution. On top of this diagnostic analysis, the output of the node is interpreted as an experimentally estimated probability and is characterized through a metrological uncertainty framework combining finite-shot variability and repeatability contributions. The obtained results show that, under nominally stable operating conditions within the optimized regime, the repeatability contribution remains smaller than the intrinsic finite-shot uncertainty, indicating that the node can provide stable and traceable probabilistic outputs despite current NISQ limitations. The proposed approach provides a practical methodology for diagnosing, constraining, and validating compact quantum nodes intended for future hybrid quantum-classical infrastructures.
Hybrid quantum-high performance computing (Q-HPC) workflows are emerging as a key strategy for running quantum applications at scale in current noisy intermediate-scale quantum (NISQ) devices. These workflows must operate seamlessly across diverse simulators and hardware backends since no single simulator offers the best performance for every circuit type. Simulation efficiency depends strongly on circuit structure, entanglement, and depth, making a flexible and backend-agnostic execution model essential for fair benchmarking, informed platform selection, and ultimately the identification of quantum advantage opportunities. In this work, we extend the Quantum Framework (QFw), a modular and HPC-aware orchestration layer, to integrate multiple local backends (Qiskit Aer, NWQ-Sim, QTensor, and TN-QVM) and a cloud-based quantum backend (IonQ) under a unified interface. Using this integration, we execute a number of non-variational as well as variational workloads. The results highlight workload-specific backend advantages: while Qiskit Aer’s matrix product state excels for large Ising models, NWQ-Sim not only leads on large-scale entanglement and Hamiltonian but also shows the benefits of concurrent subproblem execution in a distributed manner for optimization problems. These findings demonstrate that simulator-agnostic, HPC-aware orchestration is a practical path toward scalable, reproducible, and portable Q-HPC ecosystems, thereby accelerating progress toward demonstrating quantum advantage.
Extreme heterogeneity in emerging HPC systems are starting to include quantum accelerators, motivating runtimes that can coordinate between classical and quantum workloads. We present a proof-of-concept hybrid execution framework integrating the IRIS asynchronous task-based runtime with the XACC quantum programming framework via the Quantum Intermediate Representation Execution Engine (QIR-EE). IRIS orchestrates multiple programs written in the quantum intermediate representation (QIR) across heterogeneous backends (including multiple quantum simulators), enabling concurrent execution of classical and quantum tasks. Although not a performance study, we report measurable outcomes through the successful asynchronous scheduling and execution of multiple quantum workloads. To illustrate practical runtime implications, we decompose a four-qubit circuit into smaller subcircuits through a process known as quantum circuit cutting, reducing per-task quantum simulation load and demonstrating how task granularity can improve simulator throughput and reduce queueing behavior -- effects directly relevant to early quantum hardware environments. We conclude by outlining key challenges for scaling hybrid runtimes, including coordinated scheduling, classical-quantum interaction management, and support for diverse backend resources in heterogeneous systems.
Schedulers for hybrid quantum-classical workloads usually admit a quantum processing unit (QPU) whenever it has enough qubits. We ask whether such placements return usable results, and what correct placement requires. We define feasibility as a quality predicate under which QPU and classical targets must certify the same bound on the total-variation distance of the output distribution; this yields a fidelity threshold for a bounded matrix-product-state (MPS) simulator and an estimated-success-probability (ESP) threshold for a QPU. Density-matrix simulation of 1,056 small routed instances shows that the conventional register-wide ESP is optimistic in 58% of them, whereas a per-qubit form is never optimistic under Pauli noise. In a simulation study with four modelled QPUs, two classical tiers and 400-sub-task workloads of 6 to 16 qubits over ten seeds, capacity-based placement attains a feasibility-correctness of 0.16 and a fidelity-aware baseline 0.48, against a coverage ceiling of 0.86. No sub-task is feasible on a QPU but infeasible on the bond-dimension-16 classical tier, and a quality-constrained policy that selects the cheapest predicted-feasible tier attains 0.85 at 1.2 s mean latency. The pattern persists under a SABRE-style router, other calibrations and topologies, and a shifted workload with unseen circuit families and 18- to 20-qubit circuits. Classical failure tracks entangling depth rather than width, and a seven-feature classifier reaches cross-validated ROC-AUC 0.979 in distribution but fails on one unseen family. Separately, controlled compilations show that cross-backend transpilation reuse saves a median of −0.4% in the configurations tested. All QPU results are model-based.