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

Entropy

On the Applicability of Quantum Machine Learning

Sebastian Raubitzek, Kevin Mallinger

Published Jun 28, 2023• 45 citations
Publisher

Abstract

In this article, we investigate the applicability of quantum machine learning for classification tasks using two quantum classifiers from the Qiskit Python environment: the variational quantum circuit and the quantum kernel estimator (QKE). We provide a first evaluation on the performance of these classifiers when using a hyperparameter search on six widely known and publicly available benchmark datasets and analyze how their performance varies with the number of samples on two artificially generated test classification datasets. As quantum machine learning is based on unitary transformations, this paper explores data structures and application fields that could be particularly suitable for quantum advantages. Hereby, this paper introduces a novel dataset based on concepts from quantum mechanics using the exponential map of a Lie algebra. This dataset will be made publicly available and contributes a novel contribution to the empirical evaluation of quantum supremacy. We further compared the performance of VQC and QKE on six widely applicable datasets to contextualize our results. Our results demonstrate that the VQC and QKE perform better than basic machine learning algorithms, such as advanced linear regression models (Ridge and Lasso). They do not match the accuracy and runtime performance of sophisticated modern boosting classifiers such as XGBoost, LightGBM, or CatBoost. Therefore, we conclude that while quantum machine learning algorithms have the potential to surpass classical machine learning methods in the future, especially when physical quantum infrastructure becomes widely available, they currently lag behind classical approaches. Our investigations also show that classical machine learning approaches have superior performance classifying datasets based on group structures, compared to quantum approaches that particularly use unitary processes. Furthermore, our findings highlight the significant impact of different quantum simulators, feature maps, and quantum circuits on the performance of the employed quantum estimators. This observation emphasizes the need for researchers to provide detailed explanations of their hyperparameter choices for quantum machine learning algorithms, as this aspect is currently overlooked in many studies within the field. To facilitate further research in this area and ensure the transparency of our study, we have made the complete code available in a linked GitHub repository.

DOI
10.3390/e25070992

Related papers

Performance Evaluation of a Variational Quantum Classifier

Nisheeth Saxena, Akriti Nigam

Quantum Machine Learning (QML) is a newly emerging research area at the intersection of classical machine learning (CML) and quantum computing (QC). Data is becoming voluminous rapidly, so it is challenging for classical computers to train Machine Learning (ML) models over massive datasets. The hope is that quantum physics' intrinsic features, such as entanglement, superposition, and interference, could be exploited as resources for training ML models on big datasets that would otherwise be relatively impossible for classical computers. It is theoretically proven that quantum computers have an exponential-time advantage over their classical counterparts in solving several problems, e.g., complex large dimensional matrix multiplication, factorization problem, unstructured database search, etc. QML models attempt to find a quantum advantage over their classical counterparts. Variational Quantum Classifiers (VQC) are hybrid quantum neural networks to perform the task of classification using QML models. VQC models in the present NISQ (Noisy Intermediate Scale Quantum — 50 to 100 qubits) era can produce comparable and even better results than Classical models. In this article, we examined the performance of a VQC while performing a simple binary classification task. In this article, we use a VQC to evaluate this method's performance empirically. We constructed a VQC to predict the label of fresh input for the typical Iris dataset comprising pairings of target outputs and training inputs. Our quantum classifier can reasonably predict species labels using only four qubits. These levels are fairly good compared to the accuracy levels attained by classical classifiers.

IEEE Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON)•Dec 2, 2022•10 citations

Quantum Computing in Machine Learning: Performance Evaluation and Comparative Analysis

Simões, Jaime Marques

This thesis explores the integration of quantum computing into Machine Learning (ML), aiming to evaluate the effectiveness and limitations of quantum-enhanced models compared to classical approaches. As quantum technologies continue to develop, they offer the potential for solving complex computational problems more efficiently, particularly in fields requiring high-dimensional data processing. A literature review is conducted to contextualize current advancements in Quantum Machine Learning, highlighting theoretical benefits and existing practical limitations. This work investigates whether quantum methods, specifically the Quantum Support Vector Classifier (QSVC), can provide measurable improvements over its classical counterpart. The QSVC, implemented using IBM’s Qiskit ML library, replaces traditional kernel functions with quantum kernels computed via quantum circuits and feature maps, embedding classical data into a Hilbert space. The experimental portion of this thesis compares classical and quantum models on two distinct datasets: one from the healthcare domain and another from particle physics. Various parameters are tested in a constrained grid search due to the high computational demands of quantum circuits. Results indicate that while quantum models are significantly more resource-intensive, they can achieve comparable or even improved performance on data that has more complex relations between their variables. However, scalability remains a major challenge. This work concludes that although QSVC does not yet consistently outperform classical models, it offers advantages in specific contexts and lays the groundwork for identifying future use cases where quantum computing may offer a practical advantage in ML.

•Nov 6, 2025•0 citations

Benchmarking Quantum Machine Learning Kernel Training for Classification Tasks

Diego Álvarez-Estévez

Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.

arXiv:2408.10274•IEEE Transactions on Quantum Engineering•Jan 1, 2025•52 citations

Experimental Benchmarking of Quantum Machine Learning Classifiers

Mohamed Aly, Salma Fadaaq, Omnia Abu Waraga +2 more

Quantum Machine Learning (QML) has emerged as an interdisciplinary field that harnesses the potential of quantum computing to revolutionize classical machine learning paradigms. This paper presents a benchmarking study focused on four quantum classifier algorithms: Quantum Support Vector Classifier (QSVC), Variational Quantum Circuit (VQC), Quantum Neural Network Classifier (QNNC) and Pegasos Quantum Support Vector Classifier (PegasosQSVC). These quantum classifiers hold promise for unlocking quantum advantages in classification tasks. However, a systematic assessment of their performance across diverse datasets is yet to be fully explored. In this research study, we evaluate and compare the classification performance of quantum machine learning classifiers on various datasets (Breast Cancer, Diabetes, and Titanic) and compare them to a classical model. Our findings revealed that PegasosQSVC consistently maintained high performance across all datasets with the highest average accuracy, recall, and F1-score values of 0.81, 0.72, and 0.71, respectively, followed by VQC, followed by VQC, while QSVC and QNNC perform variably. Nevertheless, QSVC was found to balance performance and training time, achieving an average accuracy of 0.81 and a training time of 177 seconds. Overall, the classical model surpassed QML models as it was up to 10% higher in average accuracy.

International Conference on Signal Processing and Information Security (ICSPIS)•Nov 8, 2023•10 citations

Performance Analysis of Quantum Support Vector Classifiers and Quantum Neural Networks

Tomás Villalba-Ferreiro, Eduardo Mosqueira-Rey, Diego Alvarez-Estevez

This study explores the performance of Quantum Support Vector Classifiers (QSVCs) and Quantum Neural Networks (QNNs) in comparison to classical models for machine learning tasks. By evaluating these models on the Iris and MNIST-PCA datasets, we find that quantum models tend to outperform classical approaches as the problem complexity increases. While QSVCs generally provide more consistent results, QNNs exhibit superior performance in higher-complexity tasks due to their increased quantum load. Additionally, we analyze the impact of hyperparameter tuning, showing that feature maps and ansatz configurations significantly influence model accuracy. We also compare the PennyLane and Qiskit frameworks, concluding that Qiskit provides better optimization and efficiency for our implementation. These findings highlight the potential of Quantum Machine Learning (QML) for complex classification problems and provide insights into model selection and optimization strategies

quant-pharXiv:2512.03094•Dec 2, 2025•0 citations

Why Classical-Quantum Machine Learning Works Better Than Classical Machine Learning

Abdullah Md Raihan Chy, Md. Farhan Shahriyar

Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris$(100 \%)$and Wine$(92 \%)$. All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)•Apr 16, 2026•1 citation
In this article, we investigate the applicability of quantum machine learning for classification tasks using two quantum classifiers from the Qiskit Python environment: the variational quantum circuit and the quantum kernel estimator (QKE). We provide a first evaluation on the performance of these classifiers when using a hyperparameter search on six widely known and publicly available benchmark datasets and analyze how their performance varies with the number of samples on two artificially generated test classification datasets. As quantum machine learning is based on unitary transformations, this paper explores data structures and application fields that could be particularly suitable for quantum advantages. Hereby, this paper introduces a novel dataset based on concepts from quantum mechanics using the exponential map of a Lie algebra. This dataset will be made publicly available and contributes a novel contribution to the empirical evaluation of quantum supremacy. We further compared the performance of VQC and QKE on six widely applicable datasets to contextualize our results. Our results demonstrate that the VQC and QKE perform better than basic machine learning algorithms, such as advanced linear regression models (Ridge and Lasso). They do not match the accuracy and runtime performance of sophisticated modern boosting classifiers such as XGBoost, LightGBM, or CatBoost. Therefore, we conclude that while quantum machine learning algorithms have the potential to surpass classical machine learning methods in the future, especially when physical quantum infrastructure becomes widely available, they currently lag behind classical approaches. Our investigations also show that classical machine learning approaches have superior performance classifying datasets based on group structures, compared to quantum approaches that particularly use unitary processes. Furthermore, our findings highlight the significant impact of different quantum simulators, feature maps, and quantum circuits on the performance of the employed quantum estimators. This observation emphasizes the need for researchers to provide detailed explanations of their hyperparameter choices for quantum machine learning algorithms, as this aspect is currently overlooked in many studies within the field. To facilitate further research in this area and ensure the transparency of our study, we have made the complete code available in a linked GitHub repository.
Quantum Machine Learning (QML) is a newly emerging research area at the intersection of classical machine learning (CML) and quantum computing (QC). Data is becoming voluminous rapidly, so it is challenging for classical computers to train Machine Learning (ML) models over massive datasets. The hope is that quantum physics' intrinsic features, such as entanglement, superposition, and interference, could be exploited as resources for training ML models on big datasets that would otherwise be relatively impossible for classical computers. It is theoretically proven that quantum computers have an exponential-time advantage over their classical counterparts in solving several problems, e.g., complex large dimensional matrix multiplication, factorization problem, unstructured database search, etc. QML models attempt to find a quantum advantage over their classical counterparts. Variational Quantum Classifiers (VQC) are hybrid quantum neural networks to perform the task of classification using QML models. VQC models in the present NISQ (Noisy Intermediate Scale Quantum — 50 to 100 qubits) era can produce comparable and even better results than Classical models. In this article, we examined the performance of a VQC while performing a simple binary classification task. In this article, we use a VQC to evaluate this method's performance empirically. We constructed a VQC to predict the label of fresh input for the typical Iris dataset comprising pairings of target outputs and training inputs. Our quantum classifier can reasonably predict species labels using only four qubits. These levels are fairly good compared to the accuracy levels attained by classical classifiers.
This thesis explores the integration of quantum computing into Machine Learning (ML), aiming to evaluate the effectiveness and limitations of quantum-enhanced models compared to classical approaches. As quantum technologies continue to develop, they offer the potential for solving complex computational problems more efficiently, particularly in fields requiring high-dimensional data processing. A literature review is conducted to contextualize current advancements in Quantum Machine Learning, highlighting theoretical benefits and existing practical limitations. This work investigates whether quantum methods, specifically the Quantum Support Vector Classifier (QSVC), can provide measurable improvements over its classical counterpart. The QSVC, implemented using IBM’s Qiskit ML library, replaces traditional kernel functions with quantum kernels computed via quantum circuits and feature maps, embedding classical data into a Hilbert space. The experimental portion of this thesis compares classical and quantum models on two distinct datasets: one from the healthcare domain and another from particle physics. Various parameters are tested in a constrained grid search due to the high computational demands of quantum circuits. Results indicate that while quantum models are significantly more resource-intensive, they can achieve comparable or even improved performance on data that has more complex relations between their variables. However, scalability remains a major challenge. This work concludes that although QSVC does not yet consistently outperform classical models, it offers advantages in specific contexts and lays the groundwork for identifying future use cases where quantum computing may offer a practical advantage in ML.
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.
Quantum Machine Learning (QML) has emerged as an interdisciplinary field that harnesses the potential of quantum computing to revolutionize classical machine learning paradigms. This paper presents a benchmarking study focused on four quantum classifier algorithms: Quantum Support Vector Classifier (QSVC), Variational Quantum Circuit (VQC), Quantum Neural Network Classifier (QNNC) and Pegasos Quantum Support Vector Classifier (PegasosQSVC). These quantum classifiers hold promise for unlocking quantum advantages in classification tasks. However, a systematic assessment of their performance across diverse datasets is yet to be fully explored. In this research study, we evaluate and compare the classification performance of quantum machine learning classifiers on various datasets (Breast Cancer, Diabetes, and Titanic) and compare them to a classical model. Our findings revealed that PegasosQSVC consistently maintained high performance across all datasets with the highest average accuracy, recall, and F1-score values of 0.81, 0.72, and 0.71, respectively, followed by VQC, followed by VQC, while QSVC and QNNC perform variably. Nevertheless, QSVC was found to balance performance and training time, achieving an average accuracy of 0.81 and a training time of 177 seconds. Overall, the classical model surpassed QML models as it was up to 10% higher in average accuracy.
This study explores the performance of Quantum Support Vector Classifiers (QSVCs) and Quantum Neural Networks (QNNs) in comparison to classical models for machine learning tasks. By evaluating these models on the Iris and MNIST-PCA datasets, we find that quantum models tend to outperform classical approaches as the problem complexity increases. While QSVCs generally provide more consistent results, QNNs exhibit superior performance in higher-complexity tasks due to their increased quantum load. Additionally, we analyze the impact of hyperparameter tuning, showing that feature maps and ansatz configurations significantly influence model accuracy. We also compare the PennyLane and Qiskit frameworks, concluding that Qiskit provides better optimization and efficiency for our implementation. These findings highlight the potential of Quantum Machine Learning (QML) for complex classification problems and provide insights into model selection and optimization strategies
Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris(100%)(100 \%)(100%)and Wine(92%)(92 \%)(92%). All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.