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 Symposium on Measurement in Networking and Communications (MNC)

Measurement-Driven Diagnostics and Uncertainty Evaluation of NISQ Hardware: A Metrological Framework for NMR Quantum Nodes

Marco Carratù, Giuseppe Di Leo, Vincenzo Gallo, Valter Laino, Consolatina Liguori, Vincenzo Paciello, Antonio Pietrosanto

Published Jul 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/mnc69143.2026.11680802

Related papers

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

Noise-Robust Hybrid Quantum Neural Networks

Jesus Rafael Gil

uantum computing offers the potential to solve selected computational problems more efficiently than classical systems by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum devices operate in the noisy intermediatescale quantum (NISQ) regime, where limited coherence times, gate errors, measurement instability, and hardware variability significantly constrain practical performance. As a result, many quantum machine learning architectures that appear promising under idealized simulation conditions experience substantial degradation when executed under realistic noisy environments. This thesis investigates the problem of robustness in hybrid quantum neural network (HQNN) systems operating under realistic NISQ conditions. Rather than focusing primarily on quantum expressivity or claims of quantum advantage, the work examines whether practical hybrid quantum learning can maintain stable optimization and reliable inference in the presence of stochastic perturbations. A robustness-engineering framework is developed that integrates learned-readout decoding, multi-observable quantum feature extraction, architecture-level optimization, stability-aware training, and noise-augmented learning within a unified hybrid quantum-classical pipeline. To evaluate the framework, a comprehensive benchmarking methodology is developed across multiple datasets, architectures, perturbation environments, software frameworks, and hardware platforms. The experiments compare classical machine learning models, quantum kernel methods, and several HQNN architectures, including quanvolutional neural networks, quantum convolutional neural networks, and quantum transfer learning systems. Performance is evaluated under both noiseless and noisy conditions using standardized metrics, cross-noise validation, architecture-level comparisons, and real IBM Quantum hardware execution. The results demonstrate that baseline HQNN systems are highly sensitive to optimization instability, parity-based information loss, measurement variability, and perturbation accumulation. The experiments further reveal that robustness, rather than representational expressivity alone, is the dominant factor limiting practical hybrid quantum learning under realistic NISQ conditions. Through successive robustness-engineering stages, noisy performance improves from approximately 0.37 to 0.50 in baseline architectures to approximately 0.97 under several benchmark environments while maintaining substantially improved stability and reduced degradation under perturbation. These findings establish robustness as a central design objective for practical quantum machine learning. The thesis demonstrates that reliable hybrid quantum learning emerges through coordinated interaction between quantum feature generation, adaptive classical inference, stability-aware optimization, and hardware-aware architecture design. More broadly, the results suggest that hybrid quantum-AI systems are most effective when viewed as integrated quantum-classical computational frameworks in which quantum circuits function as probabilistic feature generators operating within larger robustness-oriented learning pipelines.

•Jul 1, 2026•0 citations

CQ-Migrate: A Hardware-Aware Feasibility Framework for NISQ Workloads with Multi-Run Validation onTuna-17

Ravikumar Sreepada, Mahendar Gajula, Sarath Chandra Maturi

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.

•Nov 9, 2026•0 citations

From AI-Generated Circuits to Accountable Quantum Execution: A Hybrid Workflow Framework

Taylor Miss

Connecting AI-generated quantum programs to executable experiments requires more than syntactically valid code: the workflow must also control execution authority and preserve the basis for interpreting its results. This paper develops a conceptual architecture organized around three responsibilities: AI-assisted circuit proposal, deterministic classical validation, and quantum measurement execution. A quantum-job contract binds circuit artifacts, measurement settings, resource allocations, backend information, and provenance to explicit admission conditions. The design separates permission to run an experiment from evidence that its output answers the intended scientific question. An analytical single-qubit variational example demonstrates this distinction through exact energy calculations, finite-shot variance, and budget-constrained measurement allocation. Responsibility allocation, runtime interception, and staged transformation provide the architectural principles, while uncertainty reporting and reference calculations supply the scientific checks. A prospective evaluation protocol covers accuracy, policy violations, reproducibility, end-to-end cost, and researcher effort. The framework is presented as a design proposal supported by mathematical illustration, not as a tested implementation; its operational benefits and applicability to larger quantum workloads remain to be established.

•Sep 11, 2026•0 citations

Evaluation of Variational Quantum Regression Models on NISQ Hardware"

Gulfam Hussain

This paper presents an empirical evaluation of the Qube Engine, a hybrid quantum-classical Variational Quantum Regressor (VQR) implemented on Noisy Intermediate-Scale Quantum (NISQ) systems. The framework integrates classical data encoding via single-qubit rotations, parameterized $RY+RZ$ variational layers, and linear entangling circuits evaluated on 4-qubit quantum registers. Optimization is conducted using classical algorithms (COBYLA) targeting Pauli-$Z$ expectation values and Mean Squared Error (MSE) loss on continuous feature spaces. We evaluate model performance across ideal statevector simulation (AerSimulator) and physical IBM Quantum superconducting processors (ibm_marrakesh, ibm_fez, ibm_kingston). Experimental results demonstrate consistent optimization dynamics and low simulation-to-hardware expectation drift ($\Delta = 0.0188$), corresponding to a 98.23% cross-backend output stability score under shallow circuit depths. This work provides a realistic analysis of variational regression dynamics, hardware execution variance, and structural trade-offs for near-term quantum machine learning models on NISQ hardware.

•Apr 4, 2026•0 citations

An HPCQC-tailored Approach for Scalable Measurement of Physical Observables

Salvatore Zammuto, Martin Schulz

As we make strides toward the era of quantum utility with improved hardware and defined practical use cases, a primary challenge resides in the definition of robust implementation architectures that enable efficient utilization of quantum accelerators. To truly unlock the capabilities of Quantum Processing Units (QPUs), basic classical support must be upgraded to a high-performance, efficient infrastructure. On the application level, integration translates to defining coherent workflows that enable optimized implementations, while abstracting complexity for larger tasks. Accordingly, a common primitive in hybrid applications is the evaluation of a physical system's observable quantities. Leveraging quantum hardware for this task requires decomposing observable-derived operators into vast arrays of Pauli terms, necessitating a high volume of distinct circuit executions that currently suffer from suboptimal management. This work proposes a novel, scalable procedural architecture that establishes observable measurement as a first-class citizen of the High-Performance Computing - Quantum Computing (HPCQC) stack. We introduce a hierarchical runtime environment featuring a workload manager for resource-aware scheduling and local quantum and classical workers for low-latency, device-specific interactions. Such infrastructure enables a pipeline of advanced optimizations, including, but not restricted to, commutativity-based operator grouping, adaptive shot allocation for variance-aware load balancing, and stateful circuit caching to minimize compilation overhead. By automating the orchestration of measuring non-commuting terms across heterogeneous backends, we demonstrate a pathway to significantly reduce time-to-solution and improve accuracy. This procedure bridges the gap between theoretical quantum algorithms and practical, scalable HPC deployment.

ISC High Performance (ISC)•Jun 1, 2026•0 citations
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.
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.
uantum computing offers the potential to solve selected computational problems more efficiently than classical systems by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum devices operate in the noisy intermediatescale quantum (NISQ) regime, where limited coherence times, gate errors, measurement instability, and hardware variability significantly constrain practical performance. As a result, many quantum machine learning architectures that appear promising under idealized simulation conditions experience substantial degradation when executed under realistic noisy environments. This thesis investigates the problem of robustness in hybrid quantum neural network (HQNN) systems operating under realistic NISQ conditions. Rather than focusing primarily on quantum expressivity or claims of quantum advantage, the work examines whether practical hybrid quantum learning can maintain stable optimization and reliable inference in the presence of stochastic perturbations. A robustness-engineering framework is developed that integrates learned-readout decoding, multi-observable quantum feature extraction, architecture-level optimization, stability-aware training, and noise-augmented learning within a unified hybrid quantum-classical pipeline. To evaluate the framework, a comprehensive benchmarking methodology is developed across multiple datasets, architectures, perturbation environments, software frameworks, and hardware platforms. The experiments compare classical machine learning models, quantum kernel methods, and several HQNN architectures, including quanvolutional neural networks, quantum convolutional neural networks, and quantum transfer learning systems. Performance is evaluated under both noiseless and noisy conditions using standardized metrics, cross-noise validation, architecture-level comparisons, and real IBM Quantum hardware execution. The results demonstrate that baseline HQNN systems are highly sensitive to optimization instability, parity-based information loss, measurement variability, and perturbation accumulation. The experiments further reveal that robustness, rather than representational expressivity alone, is the dominant factor limiting practical hybrid quantum learning under realistic NISQ conditions. Through successive robustness-engineering stages, noisy performance improves from approximately 0.37 to 0.50 in baseline architectures to approximately 0.97 under several benchmark environments while maintaining substantially improved stability and reduced degradation under perturbation. These findings establish robustness as a central design objective for practical quantum machine learning. The thesis demonstrates that reliable hybrid quantum learning emerges through coordinated interaction between quantum feature generation, adaptive classical inference, stability-aware optimization, and hardware-aware architecture design. More broadly, the results suggest that hybrid quantum-AI systems are most effective when viewed as integrated quantum-classical computational frameworks in which quantum circuits function as probabilistic feature generators operating within larger robustness-oriented learning pipelines.
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)(F=5.99)(F=5.99), (p=0.0062)(p=0.0062)(p=0.0062); Kruskal--Wallis (H=10.88)(H=10.88)(H=10.88), (p=0.0124)(p=0.0124)(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.
Connecting AI-generated quantum programs to executable experiments requires more than syntactically valid code: the workflow must also control execution authority and preserve the basis for interpreting its results. This paper develops a conceptual architecture organized around three responsibilities: AI-assisted circuit proposal, deterministic classical validation, and quantum measurement execution. A quantum-job contract binds circuit artifacts, measurement settings, resource allocations, backend information, and provenance to explicit admission conditions. The design separates permission to run an experiment from evidence that its output answers the intended scientific question. An analytical single-qubit variational example demonstrates this distinction through exact energy calculations, finite-shot variance, and budget-constrained measurement allocation. Responsibility allocation, runtime interception, and staged transformation provide the architectural principles, while uncertainty reporting and reference calculations supply the scientific checks. A prospective evaluation protocol covers accuracy, policy violations, reproducibility, end-to-end cost, and researcher effort. The framework is presented as a design proposal supported by mathematical illustration, not as a tested implementation; its operational benefits and applicability to larger quantum workloads remain to be established.
This paper presents an empirical evaluation of the Qube Engine, a hybrid quantum-classical Variational Quantum Regressor (VQR) implemented on Noisy Intermediate-Scale Quantum (NISQ) systems. The framework integrates classical data encoding via single-qubit rotations, parameterized RY+RZRY+RZRY+RZ variational layers, and linear entangling circuits evaluated on 4-qubit quantum registers. Optimization is conducted using classical algorithms (COBYLA) targeting Pauli-ZZZ expectation values and Mean Squared Error (MSE) loss on continuous feature spaces. We evaluate model performance across ideal statevector simulation (AerSimulator) and physical IBM Quantum superconducting processors (ibm_marrakesh, ibm_fez, ibm_kingston). Experimental results demonstrate consistent optimization dynamics and low simulation-to-hardware expectation drift (Δ=0.0188\Delta = 0.0188Δ=0.0188), corresponding to a 98.23% cross-backend output stability score under shallow circuit depths. This work provides a realistic analysis of variational regression dynamics, hardware execution variance, and structural trade-offs for near-term quantum machine learning models on NISQ hardware.
As we make strides toward the era of quantum utility with improved hardware and defined practical use cases, a primary challenge resides in the definition of robust implementation architectures that enable efficient utilization of quantum accelerators. To truly unlock the capabilities of Quantum Processing Units (QPUs), basic classical support must be upgraded to a high-performance, efficient infrastructure. On the application level, integration translates to defining coherent workflows that enable optimized implementations, while abstracting complexity for larger tasks. Accordingly, a common primitive in hybrid applications is the evaluation of a physical system's observable quantities. Leveraging quantum hardware for this task requires decomposing observable-derived operators into vast arrays of Pauli terms, necessitating a high volume of distinct circuit executions that currently suffer from suboptimal management. This work proposes a novel, scalable procedural architecture that establishes observable measurement as a first-class citizen of the High-Performance Computing - Quantum Computing (HPCQC) stack. We introduce a hierarchical runtime environment featuring a workload manager for resource-aware scheduling and local quantum and classical workers for low-latency, device-specific interactions. Such infrastructure enables a pipeline of advanced optimizations, including, but not restricted to, commutativity-based operator grouping, adaptive shot allocation for variance-aware load balancing, and stateful circuit caching to minimize compilation overhead. By automating the orchestration of measuring non-commuting terms across heterogeneous backends, we demonstrate a pathway to significantly reduce time-to-solution and improve accuracy. This procedure bridges the gap between theoretical quantum algorithms and practical, scalable HPC deployment.