With the emergence of the research field of Quantum Machine Learning, interest in finding advantageous real-world applications is growing as well. However, challenges concerning the number of available qubits on Noisy Intermediate Scale Quantum (NISQ) devices and accuracy losses due to hardware imperfections still remain and limit the applicability of such approaches in real-world scenarios. Therefore, for simplification, most studies assume nearly noise-free conditions as they are expected with logical, i.e. error-corrected, qubits instead of real qubits provided by hardware. However, the number of logical qubits is expected to scale slowly as they require a high number of real qubits for error correction. This is our motivation to deal with noise as an unavoidable, non-negligible problem on NISQ devices. As an application, we use the example of particle decay tree reconstruction as a highly complex combinatoric problem in High Energy Physics. We investigate methods to reduce the noise impact of such devices and propose a hybrid architecture that extends a classical graph neural network by a parameterized quantum circuit. While we have shown that such a hybrid architecture enables a reduction of the amount of trainable parameters compared to the fully classical case, we are now specifically interested in the actual performance in more realistic, i.e. noise prone scenarios. Using simple synthetic Decay Trees, we train the network in classical simulations to allow for efficient optimization of the parameters. The trained parameters are validated in noisy simulations based on devices by "IBM Quantum" and are used in interpretability and significance studies, enabling improvements in the accuracy on real devices.
With the emergence of the research field of Quantum Machine Learning, interest in finding advantageous real-world applications is growing as well. However, challenges concerning the number of available qubits on Noisy Intermediate Scale Quantum (NISQ) devices and accuracy losses due to hardware imperfections still remain and limit the applicability of such approaches in real-world scenarios. Therefore, for simplification, most studies assume nearly noise-free conditions as they are expected with logical, i.e. error-corrected, qubits instead of real qubits provided by hardware. However, the number of logical qubits is expected to scale slowly as they require a high number of real qubits for error correction. This is our motivation to deal with noise as an unavoidable, non-negligible problem on NISQ devices. As an application, we use the example of particle decay tree reconstruction as a highly complex combinatoric problem in High Energy Physics. We investigate methods to reduce the noise impact of such devices and propose a hybrid architecture that extends a classical graph neural network by a parameterized quantum circuit. While we have shown that such a hybrid architecture enables a reduction of the amount of trainable parameters compared to the fully classical case, we are now specifically interested in the actual performance in more realistic, i.e. noise prone scenarios. Using simple synthetic Decay Trees, we train the network in classical simulations to allow for efficient optimization of the parameters. The trained parameters are validated in noisy simulations based on devices by "IBM Quantum" and are used in interpretability and significance studies, enabling improvements in the accuracy on real devices.
Abstract Quantum Computing and Machine Learning are both significant and appealing research fields. In particular, the combination of both has led to the emergence of the research field quantum machine learning which has recently taken enormous popularity. We investigate in the potential advantages of this synergy for the application in high energy physics, more precisely in reconstructing particle decay trees in particle collision experiments. Due to the larger computational space of quantum computers, this highly complex combinatorical problem is well suited for investigating in a potential quantum advantage compared to the classical scenario. However, current quantum devices are subject to noise and provide only a limited number of qubits. We therefore propose the utilization of a variational quantum circuit within a classical graph neural network which has been shown to be feasible for reconstruction of particle decay trees. We evaluate our approach on a quantum simulator and a real quantum computer by IBM Quantum for artificially generated decay trees and compare our results to the purely classical approach. Our proposed approach does not only enable hardware efficient utilization of nowadays quantum devices, but also shows competitive results even in the presence of noise.
In the noisy intermediate-scale quantum (NISQ) era, one of the key questions is how to deal with the high noise level existing in physical quantum bits (qubits). Quantum error correction is promising but requires an extensive number (e.g., over 1,000) of physical qubits to create one "perfect" qubit, exceeding the capacity of the existing quantum computers. This paper aims to tackle the noise issue from another angle: instead of creating perfect qubits for general quantum algorithms, we investigate the potential to mitigate the noise issue for dedicate algorithms. Specifically, this paper targets quantum neural network (QNN), and proposes to learn the errors in the training phase, so that the identified QNN model can be resilient to noise. As a result, the implementation of QNN needs no or a small number of additional physical qubits, which is more realistic for the near-term quantum computers. To achieve this goal, an application-specific compiler is essential: on the one hand, the error cannot be learned if the mapping from logical qubits to physical qubits exists randomness; on the other hand, the compiler needs to be efficient so that the lengthy training procedure can be completed in a reasonable time. In this paper, we utilize the recent QNN framework, QuantumFlow, as a case study. Experimental results show that the proposed approach can optimize QNN models for different errors in qubits, achieving up to 28% accuracy improvement compared with the model obtained by the error-agnostic training.
Deep learning is one of the most successful and far-reaching strategies used in machine learning today. However, the scale and utility of neural networks is still greatly limited by the current hardware used to train them. These concerns have become increasingly pressing as conventional computers are soon expected to approach the physical limitations that will slow their performance improvements in the near future. For these reasons, scientists have begun to explore alternative computing platforms, like quantum computers, for training neural networks. In recent years, variational quantum circuits have emerged as one of the most successful approaches to quantum deep learning on noisy intermediate scale quantum devices. We propose a hybrid quantum-classical neural network architecture where each neuron is a variational quantum circuit. We empirically analyze the performance of this hybrid neural network on a series of binary classification data sets using a simulated IBM universal quantum computer and a state-of-the-art IBM universal quantum computer. On the simulated hardware, we observe that the hybrid neural network achieves around 10% higher classification accuracy and 20% better minimization of the cost function than an individual variational quantum circuit. On the quantum hardware, we observe that each model only performs well when the qubit and gate count is sufficiently small.
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.
We implement a post-variational quantum neural network on a real HPC-QC system and show the feasibility of fully training this class of algorithms on current Noisy Intermediate-Scale Quantum (NISQ) devices, which are limited by noise, low number of qubits, and scarcity. Post-variational methods are hybrid classical-quantum Machine Learning algorithms that remove the need for quantum circuits evaluations during training, thus making them more suited to the availability constraints of physical quantum devices. We investigate the scalability of the algorithm to a higher number of qubits, larger datasets, and more elaborate models, giving insight for more efficient implementation. Experiments for an image classification task on a cutting-edge HPC-QC system show that post-variational quantum neural networks are fully trainable in reasonable times on a superconducting device. The models trained also show performance at least comparable to a variational approach, with one configuration showing a significant improvement in classification accuracy.
In the noisy intermediate-scale quantum (NISQ) era, one of the key questions is how to deal with the high noise level existing in physical quantum bits (qubits). Quantum error correction is promising but requires an extensive number (e.g., over 1,000) of physical qubits to create one ”perfect” qubit, exceeding the capacity of the existing quantum computers. This paper aims to tackle the noise issue from another angle: instead of creating perfect qubits for general quantum algorithms, we investigate the potential to mitigate the noise issue for dedicate algorithms. Specifically, this paper targets quantum neural network (QNN), and proposes to learn the errors in the training phase, so that the identified QNN model can be resilient to noise. As a result, the implementation of QNN needs no or a small number of additional physical qubits, which is more realistic for the near-term quantum computers. To achieve this goal, an application-specific compiler is essential: on the one hand, the error cannot be learned if the mapping from logical qubits to physical qubits exists randomness; on the other hand, the compiler needs to be efficient so that the lengthy training procedure can be completed in a reasonable time. In this paper, we utilize the recent QNN framework, QuantumFlow, as a case study. Experimental results show that the proposed approach can optimize QNN models for different errors in qubits, achieving up to 28% accuracy improvement compared with the model obtained by the error-agnostic training.