Quantum Machine Learning (QML) is an accelerating field of study that leverages the principles of quantum mechanics to enhance and innovate within machine learning methodologies. However, Noisy Intermediate-Scale Quantum (NISQ) computers suffer from noise that corrupts the quantum states of the qubits and affects the training and inferencing accuracy. Furthermore, quantum computers have long access queues. A single execution with a pre-defined number of shots can take hours just to reach the top of the wait queue, which is especially disadvantageous to QML algorithms that are iterative in nature. Many vendors provide access to a suite of quantum hardware with varied qubit technologies, number of qubits, cou-pling architectures, and noise characteristics. However, present QML algorithms do not use them for the training procedure and often rely on local noiseless/noisy simulators due to cost and training timing overhead on real hardware. Taking these constraints into account, we perform a study to maximize the inferencing performance of QML workloads based on the choice of hardware selection. Specifically, we perform a detailed analysis of quantum classifiers (both training and inference through the lens of hardware queue wait times) on Iris and reduced Digits datasets under noise and varied conditions such as different hardware and coupling maps. We show that using multiple readily available hardware for training rather than relying on a single hardware, especially if it has a long queue depth of pending jobs, can lead to a performance impact of only 3–4 % while providing up to 45X reduction in training wait time.
Quantum Machine Learning (QML) is an accelerating field of study that leverages the principles of quantum mechanics to enhance and innovate within machine learning methodologies. However, Noisy Intermediate-Scale Quantum (NISQ) computers suffer from noise that corrupts the quantum states of the qubits and affects the training and inferencing accuracy. Furthermore, quantum computers have long access queues. A single execution with a pre-defined number of shots can take hours just to reach the top of the wait queue, which is especially disadvantageous to QML algorithms that are iterative in nature. Many vendors provide access to a suite of quantum hardware with varied qubit technologies, number of qubits, cou-pling architectures, and noise characteristics. However, present QML algorithms do not use them for the training procedure and often rely on local noiseless/noisy simulators due to cost and training timing overhead on real hardware. Taking these constraints into account, we perform a study to maximize the inferencing performance of QML workloads based on the choice of hardware selection. Specifically, we perform a detailed analysis of quantum classifiers (both training and inference through the lens of hardware queue wait times) on Iris and reduced Digits datasets under noise and varied conditions such as different hardware and coupling maps. We show that using multiple readily available hardware for training rather than relying on a single hardware, especially if it has a long queue depth of pending jobs, can lead to a performance impact of only 3–4 % while providing up to 45X reduction in training wait time.
Often portrayed as a promising application domain for noisy intermediate-scale quantum (NISQ) computing, quantum machine learning (QML) suffers from limited scalability due to circuit depth and qubit quality, measurement overhead, optimization instability, and noise accumulation. The purpose of the current research paper is to conduct a simulation-based scalability analysis of five representative QML models, namely, the Variational Quantum Classifier, Quantum Support Vector Machine, Quantum Neural Network, Quantum Convolutional Neural Network, and Hybrid Quantum Classical Neural Network. The Breast Cancer Wisconsin benchmark dataset is utilized in this study, and dimensionality reduction is performed to enable qubit-efficient encoding. Furthermore, the effect of increased qubit count, circuit depth, parameter count, and depolarizing noise is examined on model behaviour. The parameters for assessing performance are accuracy, precision, recall, F1 measure, training time, inference time, simulation success probability, noise robustness, and a unified scalability measure. Statistical treatment includes descriptive statistics, one-way ANOVA, Kruskal-Wallis test, correlation analysis and multiple linear regression. The outcomes suggest that the Hybrid Quantum-Classical Neural Network boasted the best overall scalability profile, with the highest mean accuracy and the strongest resistance to noise, while deeper QNN circuits showed heavier degradation at higher levels of noise. According to the results, performance of QML is a near-term one. Similarly, this performance is not determined only by representation, expressivity but other factors as well. The study states that the experimental advantage of QML on NISQ devices is still problem dependent and constrained to simple problems. Shallow hybrid architecture, trivial quantum kernel, error mitigation and hardware adaptive ansatz construction are the realistic pathways for future quantum artificial intelligence systems.
Quantum machine learning has emerged as a promising approach to enhance computational efficiency by leveraging the principles of quantum computing. However, the limitations of current Noisy Intermediate-Scale Quantum (NISQ) devices, such as noise, limited qubit availability, and circuit depth constraints, restrict the implementation of fully quantum models. To address these challenges, this study focuses on the design, implementation, and performance evaluation of hybrid quantum-classical machine learning (HQML) models. The proposed approach integrates parameterized quantum circuits with classical optimization techniques to enable efficient learning within NISQ environments. The study employs standard benchmark datasets, including Iris, Breast Cancer, and MNIST, to evaluate the performance of the hybrid model. The results indicate that the HQML model achieves competitive accuracy on small and medium-sized datasets while maintaining balanced precision, recall, and F1-score. However, performance declines for complex datasets due to hardware limitations and noise effects. Additionally, the hybrid model demonstrates a lower number of parameters compared to classical deep learning models but requires higher training time due to iterative quantum-classical optimization. The findings highlight that hybrid quantum-classical models provide a practical and scalable approach for utilizing quantum computing in the current technological landscape. Although challenges related to noise, scalability, and computational overhead persist, advancements in quantum hardware and algorithm design are expected to improve performance. This study contributes to the growing field of quantum machine learning by providing a systematic framework for evaluating hybrid models on NISQ devices and identifying key areas for future research.
The development of near-term quantum computers, referred to as Noisy Intermediate-Scale Quantum (NISQ) computers, has progressed rapidly in the past few years resulting in several quantum computers which vary in their underlying technology and physical constraints. The performance of these computers also varies from one quantum algorithm to another. To enable efficient selection of the quantum computer that provides the highest output fidelity for a given application, an accurate noise modeling of each quantum hardware is required. However, noise modeling for a given application is a complex problem because of the unknown interaction between the quantum circuit parameters and the noise parameters of NISQ devices. We propose the use of Machine Learning (ML) to model the performance of different quantum computers at the application level. The ML models predict the output fidelity of the quantum application executed on different quantum computers given their publicly available physical constraints. We use a diverse training dataset to cover the key features for application-level benchmarking of the quantum hardware. Our results obtained from different superconducting quantum devices show that our proposed ML models enable cost-effective quantum computer selection for different quantum applications with different fidelity metrics.
Quantum Machine Learning (QML) is emerging as a promising technology for tackling complex computational challenges, although its practical implementation faces significant obstacles owed to the inherent noise in current quantum devices. This paper presents a hybrid architecture that combines classical and quantum elements for the development and training of QML models under noisy conditions. This research evaluates the impact of noise on superconducting systems through emulation. The study shows that, compared to noise-free configurations, certain noise levels tend to allow for a reduction in the number of qubits, thus simplifying the architecture of the quantum neural network, which has a direct impact on the computational cost and execution times. Experimental validation was performed by applying three biomedical datasets related to breast cancer detection. The experimental findings revealed that the variations in accuracy between noiseless configurations and those subjected to noisy conditions were minimal, with deviations ranging from 0.11% to 1.68%. Additionally, it was observed that the incorporation of noise during training contributed positively to the efficiency of the process for the datasets under test, achieving improvements in training execution times ranging from a factor of 1.61 to 4.39, when the proposed architecture was emulated on Qaptiva 802.
Quantum Machine Learning (QML) integrates the principles of quantum mechanics superposition, entanglement, and interference into mathematical and logical operations that classical computers cannot emulate. Despite the limitations of today’s noisy intermediate-scale quantum (NISQ-ERA) devices, these platforms already sustain small- to medium-scale machine-learning workloads, catalyzing rapid expansion in QML research. Guided by PRISMA methodology, we systematically screened 5,463 publications published between January 2015 and June 2025 and identified 160 high-quality studies that implemented or evaluated QML algorithms on real or simulated quantum processors. The selected literature converges into four thematic categories: (i) quantum adaptations of classical algorithms, (ii) variational and hybrid quantum–classical models, (iii) quantum linear-algebra accelerators, and (iv) quantum-inspired generative and reinforcement techniques. Application domains span image and signal classification, cybersecurity, finance, chemistry, and healthcare, with benchmarks such as MNIST, CIC-IDS2019 and credit-risk corpora featuring prominently in the reviewed corpus. Separately from the reviewed literature, Sect. 6 reports our own five-seed benchmark of five quantum and two classical classifiers on five public tabular datasets (Breast Cancer, Diabetes, Iris, Sonar and Bank Marketing). Comparative analyses reveal that hybrid QML systems typically match or marginally exceed the performance of state-of-the-art classical baselines while employing fewer parameters. Nevertheless, a clear, reproducible quantum advantage remains elusive, hindered by data-encoding overheads, circuit-depth constraints, environmental noise, and barren-plateau training phenomena. By integrating algorithmic trends, empirical outcomes, and hardware considerations, this review delineates QML’s present capabilities and identifies critical technological milestones error mitigation, scalable qubit architectures, and efficient data-loading schemes needed to unlock its full potential.
The rapid advancement of quantum computing hardware and software has ushered in a new era for computational science, promising to tackle problems that are intractable for classical computers. Parallelly, machine learning (ML) has revolutionized data analysis and artificial intelligence. The confluence of these two fields, known as Quantum Machine Learning (QML), aims to harness the principles of quantum mechanics-such as superposition, entanglement, and interference-to enhance and redefine classical machine learning algorithms. This survey provides a comprehensive overview of the burgeoning field of QML. We begin by elucidating the fundamental quantum concepts that underpin QML approaches. We then present a detailed taxonomy and analysis of prominent QML algorithms, categorizing them into quantum-enhanced classical models and fully quantum models. Key families of algorithms discussed include Quantum Support Vector Machines (QSVM), Quantum Neural Networks (QNNs), and Quantum Generative Adversarial Networks (QGANs). For each, we explain the theoretical quantum advantage, the circuit implementation, and the current limitations. Furthermore, we delve into the critical challenges facing the practical realization of QML, including the pervasive issue of noise in Noisy Intermediate-Scale Quantum (NISQ) devices, the problem of barren plateaus in training quantum circuits, and the complexities of efficient data encoding (quantum feature maps). We also present a small-scale experimental simulation of a variational quantum classifier on a standardized dataset, demonstrating its principle and comparing its performance with a classical counterpart. Finally, the paper discusses the future trajectory of QML, highlighting the importance of error mitigation, hybrid quantum-classical architectures, and the development of quantum-specific learning inductive biases. We conclude that while fault-tolerant quantum computers remain on the horizon, QML represents a paradigm shift with the potential to deliver profound computational advantages in the coming decades.