This research presents a comparative evaluation of classical and quantum machine learning models applied to the Bridge dataset. Classical algorithms like Support Vector Machine, Random Forest, and Neural Networks are benchmarked against Quantum SVM, Quantum Random Forest, and Quantum Neural Networks using identical preprocessing and training conditions. Results indicate a consistent quantum advantage, with quantum models achieving higher accuracy, stronger nonlinear feature separation, and improved minority-class detection. QSVM and QNN exhibit the most significant performance gains. Although quantum models require greater computational resources, the findings underscore the emerging effectiveness of quantum-enhanced learning for structural classification tasks in the NISQ era.
This research presents a comparative evaluation of classical and quantum machine learning models applied to the Bridge dataset. Classical algorithms like Support Vector Machine, Random Forest, and Neural Networks are benchmarked against Quantum SVM, Quantum Random Forest, and Quantum Neural Networks using identical preprocessing and training conditions. Results indicate a consistent quantum advantage, with quantum models achieving higher accuracy, stronger nonlinear feature separation, and improved minority-class detection. QSVM and QNN exhibit the most significant performance gains. Although quantum models require greater computational resources, the findings underscore the emerging effectiveness of quantum-enhanced learning for structural classification tasks in the NISQ era.
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.
The rapid growth of computer vision and increasingly complex image recognition tasks has exposed fundamental computational limitations of classical machine learning models, motivating the exploration of quantum computing as an emerging new paradigm. This paper presents a comprehensive benchmarking study of classical and quantum machine learning models for image recognition on the MNIST handwritten digit dataset, evaluating both traditional models, a Classical Support Vector Machine (CSVM) and a Quantum Support Vector Machine (QSVM), and deep neural network models, a Classical Convolutional Neural Network (CCNN) and a Quantum Convolutional Neural Network (QCNN), across four performance dimensions: classification accuracy, computational runtime, parameter count, and memory requirements. Experiments are conducted as functions of both feature dimensionality and sample size, and across CPU and GPU execution environments, providing a controlled, multidimensional comparison to address gaps in prior work. For the SVM-based models, QSVM consistently outperforms CSVM in accuracy, reaching ∼ 0.90 versus ∼ 0.85 at 1,000 samples, with a higher computational cost. A feature count of 10 qubits and a sample size in the range of 200 -- 500 emerge as practical operating points that balance accuracy and runtime. For the neural network models, CCNN and QCNN achieve comparable classification accuracy, both exceeding 0.96 at 64 features and 60,000 samples, yet QCNN offers superior parameter and memory efficiency at higher feature counts, while incurring higher runtime. Across both model families, quantum models consistently outperform classical models by greater margins in accuracy as feature dimensionality or sample size increases.
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 study, the performance of classical and quantum machine learning models was compared using the Breast Cancer dataset, which consists of diagnostic data aimed at classifying breast tumor types. Breast cancer, being one of the most common and life-threatening cancers in women, requires accurate diagnostic tools for early detection and effective treatment. The primary objective of this study is to evaluate the accuracy of quantum-assisted models through quantum feature selection methods. Initially, classical machine learning algorithms such as Support Vector Machines (SVM), Decision Trees, Random Forests, and Logistic Regression were applied to the dataset for baseline analysis. Subsequently, a quantum feature map was constructed using the Cirq library, enabling feature transformation based on this map. The classification was performed using the SVM model with the quantum-transformed features. The Logistic Regression and SVM models demonstrated the highest performance among classical machine learning models, achieving an accuracy rate of 96.49%, followed by Random Forest at 94.74% and Decision Tree at 92.11%. In the context of quantum feature transformation, the model utilizing the top five selected features achieved an accuracy rate of 94.74%, in contrast to 98.25% for the model trained with all features. These findings underscore the potential of quantum feature maps in enhancing model performance compared to classical techniques. The results suggest that quantum computing may offer significant advantages when integrated into machine learning frameworks, particularly in domains such as medical diagnostics, where high accuracy is crucial.
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