Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.
Machine Learning (ML) has been widely applied across numerous domains due to its ability to automatically identify informative patterns from data for various tasks. The availability of large-scale data and advanced computational power enables the development of sophisticated models and training strategies, leading to state-of-the-art performance, but it also introduces substantial challenges. Quantum Computing (QC), which exploits quantum mechanisms for computation, has attracted growing attention and significant global investment as it may address these challenges. Consequently, Quantum Machine Learning (QML), the integration of these two fields, has received increasing interest, with a notable rise in related studies in recent years. We are motivated to review these existing contributions regarding quantum circuit-based learning models for classical data analysis and highlight the identified potentials and challenges of this technique. Specifically, we focus not only on QML models, both kernel-based and neural network-based, but also on recent explorations of their integration with classical machine learning layers within hybrid frameworks. Moreover, we examine both theoretical analysis and empirical findings to better understand their capabilities, and we also discuss the efforts on noise-resilient and hardware-efficient QML that could enhance its practicality under current hardware limitations. In addition, we cover several emerging paradigms for advanced quantum circuit design and highlight the adaptability of QML across representative application domains. This study aims to provide an overview of the contributions made to bridge quantum computing and machine learning, offering insights and guidance to support its future development and pave the way for broader adoption in the coming years.
Quantum machine learning sits at the intersection of two paradigm-shifting technologies: quantum computing and deep learning. By exploiting quantum mechanical phenomena – superposition, entanglement, and interference – QML promises exponential or quadratic speedups over classical algorithms for certain learning tasks, as well as the ability to model quantum data natively. However, the path to practical quantum advantage remains contested, constrained by noisy intermediate-scale quantum (NISQ) hardware, limited qubit counts (50–1,000), coherence times (50–500 μs), and high gate error rates (10⁻³–10⁻⁴). This paper provides a rigorous, technically deep survey of QML: mathematical foundations (Hilbert spaces, unitary evolution, measurement, quantum circuits), canonical algorithms (quantum kernel methods, variational quantum circuits (VQCs), quantum neural networks (QNNs), QSVMs, quantum generative adversarial networks (QGANs), encoding strategies (angle, amplitude, basis, and Hamiltonian encoding), optimization landscapes (barren plateaus, parameter shift rules, ansatz design), hardware aware implementation on superconducting (IBM, Google), trapped ion (IonQ), and neutral atom (Pasqal) platforms, empirical benchmarks on near term devices for classification, generative modeling, and quantum chemistry, and pathways to fault tolerant quantum machine learning (FTQML) with error correction (surface codes, logical qubits). Researchers critically assess claims of quantum advantage, identify scenarios where QML may outperform classical ML (small data, high-dimensional feature spaces from quantum systems, kernel estimation), and propose concrete evaluation metrics (quantum-classical cross-validation, resource estimation).
Quantum machine learning (QML), an emerging discipline with applications in various domains, has the potential to dramatically improve deep learning while reducing model complexity. Quantum computers are well suited for machine learning (ML) tasks, especially because ML models are rapidly growing and require large amounts of data to learn. For example, classical computers that train large language and foundation models typically require supercomputers. If a need exists to double the number of model parameters, one will have to double the size of the supercomputer needed to train it. A quantum computer's parameter or state space grows exponentially with the number of qubits. This means doubling the number of model parameters only requires adding one quantum bit. Another advantage is that quantum computers can use entanglement and interference to potentially learn patterns with less data. Currently, no existing solutions compares the performance of classical and quantum machine learning algorithms for a workflow comprised of multiple ML tasks. This poster presents a QML workspace to explore and verify these QML algorithms with different available quantum frameworks such as Qisklt, CUDA Quantum, and PennyLane in a consistent, reproducible, and theoretically sound way and provide a comparison with similar classical machine learning algorithms.
ABSTRACT Background Quantum machine learning is an emerging field that may offer unique advantages over classical machine learning but has not been extensively studied with real-world healthcare data of practical size. This study evaluates the performance of a recently proposed quantum machine learning algorithm—quantum circuits with data re-uploading—compared to classical machine learning and other common quantum algorithms, using both benchmarking data and real-world laboratory medicine data. Methods Four datasets containing between 2 and 30 features were selected for evaluation. The quantum re-uploading algorithm was compared against variational quantum classifiers, quantum neural networks and four, commonly used classical machine learning algorithms. Initial, baseline comparisons of classification performance (F1 score) were conducted using all algorithms across the four datasets. Configuration parameters were then optimized for the quantum data re-uploading algorithm using a previously published dataset of plasma amino acid profiles to determine the impact of optimization on classification performance, followed by a final comparison against classical ML algorithms. Results Baseline comparisons of quantum re-uploading showed superior classification performance on lower-dimensional datasets compared to quantum and linear ML algorithms. However, performance declined significantly as the number of input features increased. While optimization improved classification performance, marked variability was observed. Following optimization, the quantum re- uploading algorithm again performed comparably to linear algorithms but had lower classification performance on the plasma amino acid dataset compared to non-linear classical algorithms. Conclusion This study suggests that quantum data-reuploading algorithms can achieve classification performance comparable to some classical methods on lower-dimensional datasets, presenting opportunities for early research applications in laboratory medicine. However, while optimizing configuration parameters can improve classification performance, further advancements in quantum hardware and algorithm design will likely be necessary for quantum machine learning to become practically viable in laboratory medicine, and biomedical research more broadly.
Quantum machine learning (QML) provides a transformative approach to data analysis by integrating the principles of quantum computing with classical machine learning methods. With the exponential growth of data and the increasing complexity of computational tasks, quantum algorithms offer tremendous advantages in terms of processing speed, memory efficiency, and the ability to resolve issues intractable for classical systems. In this work, the use of QML techniques for both supervised and unsupervised learning problems is explored. Quantum-enhanced models such Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs) show outstanding performance in classification and regression tasks by using quantum kernels and entanglement in supervised learning. Moreover, hybrid quantum-classical solutions offer useful implementations on noisy intermediate-scale quantum (NISQ) devices, hence bridging the gap between present quantum technology and practical uses. By means of comparative analysis, this paper emphasizes the possible benefits and drawbacks of QML, thereby providing understanding of its future importance in sectors including material science, finance, and healthcare. In the end, QML opens the path for a new era of intelligent data processing and solves until unthinkable difficult challenges.
Quantum Machine Learning (QML) is an exciting frontier applying the philosophy of quantum computation to classical machine learning for improved learning performance of complicated tasks. However, QML is greatly challenged by realistic issues like noisy quantum measurements and limited labeled quantum data caused by the high cost and technological limitations. This paper explores the novel transfer-learning mechanisms to tackle these issues, which allow the reuse of the knowledge from related quantum tasks for improving model performance and generalization in resource-limited scenarios. Transfer learning, one of the great and successful concepts of classical machine learning, is to transfer the learned parameters or features from the source domain (or task) to the target domain (or task). We further develop and investigate, in quantum, a methodology where parameterized quantum circuits (PQCs) learnt on a source quantum data set have certain parts partially re-used or fine-tuned for a target task, given limited amount of target data. This strategy also avoids large quantum training runs that are not scalable on state-of-the-art noisy intermediate-scale quantum (NISQ) processors. The suggested methods are layerwise quantum adaptation, quantum kernel reuse and hybrid quantum-classical feature transfer. We investigate the robustness of these mechanisms in presence of noise by simulating quantum circuits using depolarizing and readout noise models. Moreover, we show that pretraining of quantum models on synthetic (or simulated) data sets (which are generated using larger, less noisy systems) can be instrumental in learning on real, small-sized quantum devices. Experiment results in quantum classification tasks demonstrate the effectiveness of transfer learning in boosting the accuracy, accelerating the convergence, and lowering the quantum circuit depth of successfully trained model. It is interesting to mention that transfer using layer-wise models became very resistant to quantum noise, as its performance did not degrade significantly for noisy inputs. These results demonstrate that transfer learning can overcome the scarce quantum data and suppress the harmful impact of measurement noise. This work presents a potential venue for enhancing the applicability of QML in the NISQ era. By transferring knowledge from theoretical quantum learning models to actual quantum hardware constraints, transfer learning allows quantum algorithms to learn faster and generalize better across tasks.