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 Conference on Computing (ICOCO)

A Comparative Effectiveness Study of Quantum Machine Learning Algorithms

Caleb Dow, Daniel Tebor, Gayathri Priya Kolavennu, Yong Shi

Published Oct 6, 2025• 0 citations
Publisher

Abstract

This research provides a rigorous empirical benchmark comparing classical and quantum machine learning algorithms across PCA, Random Forest, Neural Networks, and CNNs. We evaluate performance on four datasets, revealing quantum advantages only in specific scenarios: quantum neural networks achieved 34-46% better precision/recall on imbalanced classification, while classical methods dominated in efficiency and scalability. Critical findings include quantum algorithms requiring 57,500x more training time and becoming intractable beyond 8-10 qubits. Our implementation methodology and performance baselines provide practitioners with concrete guidance for algorithm selection in the current NISQ era.

DOI
10.1109/icoco67189.2025.11334075

Related papers

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

Quantum Machine Learning: Enhancing Algorithms through Quantum Neural Networks and Data Analysis

Rakesh Sengupta, Usha Desai, Anand Singh Rajawat +3 more

This paper evaluates the performance of two quantum machine learning algorithms: Quantum Support Vector Machine (QSVM) and Quantum Principal Component Analysis (Q-PCA). The scalability of QSVM is analyzed across increasing dataset sizes and feature dimensions, revealing faster-than-linear growth in kernel evaluation and SVM training times. However, this computational overhead is accompanied by a notable decline in classification accuracy, highlighting challenges in applying QSVM to larger or more complex datasets. In contrast, Q-PCA demonstrates near-linear scalability with dataset size and qubit count, leveraging the independence of quantum circuit execution and structured operations to maintain efficiency. A QNN-based implementation of Q-PCA further validates its ability to align data with principal components, maximize variance, and enable effective dimensionality reduction. These findings emphasize the potential of Q-PCA for efficient quantum-enhanced data analysis while underscoring the need for optimization in QSVM and further exploration of Q-PCA’s capabilities for real-world quantum computing applications.

International Conference on Augmented Reality, Intelligent Systems, and Industrial Automation (ARIIA)•Dec 20, 2024•3 citations

Implementation and Performance Evaluation of Quantum Machine Learning Algorithms for Binary Classification

Surajudeen Shina Ajibosin, Deniz Çetinkaya

In this work, we studied the use of Quantum Machine Learning (QML) algorithms for binary classification and compared their performance with classical Machine Learning (ML) methods. QML merges principles of Quantum Computing (QC) and ML, offering improved efficiency and potential quantum advantage in data-driven tasks and when solving complex problems. In binary classification, where the goal is to assign data to one of two categories, QML uses quantum algorithms to process large datasets efficiently. Quantum algorithms like Quantum Support Vector Machines (QSVM) and Quantum Neural Networks (QNN) exploit quantum parallelism and entanglement to enhance performance over classical methods. This study focuses on two common QML algorithms, Quantum Support Vector Classifier (QSVC) and QNN. We used the Qiskit software and conducted the experiments with three different datasets. Data preprocessing included dimensionality reduction using Principal Component Analysis (PCA) and standardization using scalers. The results showed that quantum algorithms demonstrated competitive performance against their classical counterparts in terms of accuracy, while QSVC performed better than QNN. These findings suggest that QML holds potential for improving computational efficiency in binary classification tasks. This opens the way for more efficient and scalable solutions in complex classification challenges and shows the complementary role of quantum computing.

Software•Nov 28, 2024•25 citations

A systematic review of quantum machine learning: algorithms, application domains, and emerging trends

Raed Abu Zitar, Murad M. Al-Rajab, Samia Loucif +1 more

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.

Artificial Intelligence Review•Nov 12, 2026•0 citations

Empirical Study of Quantum Machine Learning Algorithms for Accelerating Functional Materials Discovery

Doris Ngozi Nwachuku, Ericdavid E. Ugochukwu

Quantum machine learning (QML) represents a convergence of quantum computing and statistical learning theory with transformative potential for high-throughput computational materials discovery. This empirical study systematically benchmarks six QML architectures — quantum kernel support vector machines, variational quantum eigensolvers augmented by graph neural networks, quantum approximate optimization algorithm hybrids, quantum random forests, quantum Boltzmann machines, and parameterized quantum circuit-based neural networks — against their classical analogues across five material classes comprising perovskite oxides, battery cathode materials, two-dimensional semiconductor alloys, metal-organic frameworks, and high-entropy alloys. Using 14,720 DFT-computed property records drawn from the Materials Project and AFLOW databases as the common evaluation corpus, the QML methods achieved mean absolute error reductions of 38–61% and training time compressions of 29–61% relative to equivalent classical estimators at equivalent dataset sizes. The quantum random forest architecture exhibited the strongest overall performance (MAE = 0.026 eV; R² = 0.978), while hardware-native implementations on IBM Quantum Eagle and IonQ Forte achieved practical speed-ups of 28x–41x over CPU-based baselines. Barren plateau pathology and noise-induced gradient suppression remained the principal barriers to scaling beyond 50 qubits on current NISQ hardware. The empirical results of this study established principal conclusions that advance the theoretical and practical understanding of QML in materials discovery contexts. These findings provide grounding for deploying QML in production materials informatics pipelines.

Nigerian Journal of Physics•Jun 19, 2026•0 citations

Quantum Machine Learning: A Review and Case Studies

Amine Zeguendry, Zahi Jarir, Mohamed Quafafou

Despite its undeniable success, classical machine learning remains a resource-intensive process. Practical computational efforts for training state-of-the-art models can now only be handled by high speed computer hardware. As this trend is expected to continue, it should come as no surprise that an increasing number of machine learning researchers are investigating the possible advantages of quantum computing. The scientific literature on Quantum Machine Learning is now enormous, and a review of its current state that can be comprehended without a physics background is necessary. The objective of this study is to present a review of Quantum Machine Learning from the perspective of conventional techniques. Departing from giving a research path from fundamental quantum theory through Quantum Machine Learning algorithms from a computer scientist's perspective, we discuss a set of basic algorithms for Quantum Machine Learning, which are the fundamental components for Quantum Machine Learning algorithms. We implement the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance to that of its classical counterpart, the Convolutional Neural Networks (CNNs). Additionally, we implement the QSVM on the breast cancer dataset and compare it to the classical SVM. Finally, we implement the Variational Quantum Classifier (VQC) and many classical classifiers on the Iris dataset to compare their accuracies.

Entropy•Feb 3, 2023•252 citations
This research provides a rigorous empirical benchmark comparing classical and quantum machine learning algorithms across PCA, Random Forest, Neural Networks, and CNNs. We evaluate performance on four datasets, revealing quantum advantages only in specific scenarios: quantum neural networks achieved 34-46% better precision/recall on imbalanced classification, while classical methods dominated in efficiency and scalability. Critical findings include quantum algorithms requiring 57,500x more training time and becoming intractable beyond 8-10 qubits. Our implementation methodology and performance baselines provide practitioners with concrete guidance for algorithm selection in the current NISQ era.
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 paper evaluates the performance of two quantum machine learning algorithms: Quantum Support Vector Machine (QSVM) and Quantum Principal Component Analysis (Q-PCA). The scalability of QSVM is analyzed across increasing dataset sizes and feature dimensions, revealing faster-than-linear growth in kernel evaluation and SVM training times. However, this computational overhead is accompanied by a notable decline in classification accuracy, highlighting challenges in applying QSVM to larger or more complex datasets. In contrast, Q-PCA demonstrates near-linear scalability with dataset size and qubit count, leveraging the independence of quantum circuit execution and structured operations to maintain efficiency. A QNN-based implementation of Q-PCA further validates its ability to align data with principal components, maximize variance, and enable effective dimensionality reduction. These findings emphasize the potential of Q-PCA for efficient quantum-enhanced data analysis while underscoring the need for optimization in QSVM and further exploration of Q-PCA’s capabilities for real-world quantum computing applications.
In this work, we studied the use of Quantum Machine Learning (QML) algorithms for binary classification and compared their performance with classical Machine Learning (ML) methods. QML merges principles of Quantum Computing (QC) and ML, offering improved efficiency and potential quantum advantage in data-driven tasks and when solving complex problems. In binary classification, where the goal is to assign data to one of two categories, QML uses quantum algorithms to process large datasets efficiently. Quantum algorithms like Quantum Support Vector Machines (QSVM) and Quantum Neural Networks (QNN) exploit quantum parallelism and entanglement to enhance performance over classical methods. This study focuses on two common QML algorithms, Quantum Support Vector Classifier (QSVC) and QNN. We used the Qiskit software and conducted the experiments with three different datasets. Data preprocessing included dimensionality reduction using Principal Component Analysis (PCA) and standardization using scalers. The results showed that quantum algorithms demonstrated competitive performance against their classical counterparts in terms of accuracy, while QSVC performed better than QNN. These findings suggest that QML holds potential for improving computational efficiency in binary classification tasks. This opens the way for more efficient and scalable solutions in complex classification challenges and shows the complementary role of quantum computing.
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.
Quantum machine learning (QML) represents a convergence of quantum computing and statistical learning theory with transformative potential for high-throughput computational materials discovery. This empirical study systematically benchmarks six QML architectures — quantum kernel support vector machines, variational quantum eigensolvers augmented by graph neural networks, quantum approximate optimization algorithm hybrids, quantum random forests, quantum Boltzmann machines, and parameterized quantum circuit-based neural networks — against their classical analogues across five material classes comprising perovskite oxides, battery cathode materials, two-dimensional semiconductor alloys, metal-organic frameworks, and high-entropy alloys. Using 14,720 DFT-computed property records drawn from the Materials Project and AFLOW databases as the common evaluation corpus, the QML methods achieved mean absolute error reductions of 38–61% and training time compressions of 29–61% relative to equivalent classical estimators at equivalent dataset sizes. The quantum random forest architecture exhibited the strongest overall performance (MAE = 0.026 eV; R² = 0.978), while hardware-native implementations on IBM Quantum Eagle and IonQ Forte achieved practical speed-ups of 28x–41x over CPU-based baselines. Barren plateau pathology and noise-induced gradient suppression remained the principal barriers to scaling beyond 50 qubits on current NISQ hardware. The empirical results of this study established principal conclusions that advance the theoretical and practical understanding of QML in materials discovery contexts. These findings provide grounding for deploying QML in production materials informatics pipelines.
Despite its undeniable success, classical machine learning remains a resource-intensive process. Practical computational efforts for training state-of-the-art models can now only be handled by high speed computer hardware. As this trend is expected to continue, it should come as no surprise that an increasing number of machine learning researchers are investigating the possible advantages of quantum computing. The scientific literature on Quantum Machine Learning is now enormous, and a review of its current state that can be comprehended without a physics background is necessary. The objective of this study is to present a review of Quantum Machine Learning from the perspective of conventional techniques. Departing from giving a research path from fundamental quantum theory through Quantum Machine Learning algorithms from a computer scientist's perspective, we discuss a set of basic algorithms for Quantum Machine Learning, which are the fundamental components for Quantum Machine Learning algorithms. We implement the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance to that of its classical counterpart, the Convolutional Neural Networks (CNNs). Additionally, we implement the QSVM on the breast cancer dataset and compare it to the classical SVM. Finally, we implement the Variational Quantum Classifier (VQC) and many classical classifiers on the Iris dataset to compare their accuracies.