Abstract The rapid pace of development over the last few decades in the domain of machine learning mirrors the advances made in the field of quantum computing. It is natural to ask whether the conventional machine learning algorithms could be optimized using the present-day noisy intermediate-scale quantum technology. There are certain computational limitations while training a machine learning model on a classical computer. Using quantum computation, it is possible to surpass these limitations and carry out such calculations in an optimized manner. This study illustrates the working of the quantum support vector machine classification model which guarantees an exponential speed-up over its typical alternatives. This research uses the quantum SVM model to solve the classification task of a malignant breast cancer diagnosis. This study also demonstrates a comparative analysis of distinct forms of SVM algorithms concerning their time complexity and performances on standard evaluation metrics, namely accuracy, precision, recall, and F 1-score, to exemplify the supremacy of quantum SVM over its conventional variants.
Abstract The rapid pace of development over the last few decades in the domain of machine learning mirrors the advances made in the field of quantum computing. It is natural to ask whether the conventional machine learning algorithms could be optimized using the present-day noisy intermediate-scale quantum technology. There are certain computational limitations while training a machine learning model on a classical computer. Using quantum computation, it is possible to surpass these limitations and carry out such calculations in an optimized manner. This study illustrates the working of the quantum support vector machine classification model which guarantees an exponential speed-up over its typical alternatives. This research uses the quantum SVM model to solve the classification task of a malignant breast cancer diagnosis. This study also demonstrates a comparative analysis of distinct forms of SVM algorithms concerning their time complexity and performances on standard evaluation metrics, namely accuracy, precision, recall, and F 1-score, to exemplify the supremacy of quantum SVM over its conventional variants.
The application of machine learning has shown significant progress in various fields, including clinical data classification. This study presents a comparative analysis between the classical Support Vector Machine (SVM) and Quantum Support Vector Machine (QSVM) for breast cancer classification using the Wisconsin Diagnostic Breast Cancer (WDBC) dataset. Principal Component Analysis (PCA) was applied as dimension reduction strategy across three configurations (PCA = 2, PCA = 4, and PCA = 6) to evaluate the sensitivity of both models to the feature space dimension. Preprocessing included log1p transformation on 22 skewed features, Manual SMOTE balancing, and MinMaxScaler normalization. SVM was optimized via GridSearchCV (80 parameter combinations, cv = 5), while QSVM employed a ZZFeatureMap quantum kernel (reps = 2, entanglement = full) on qasm_simulator. Experimental results demonstrate that SVM achieved superior accuracy across all configurations, with peak performance at PCA = 6 (Accuracy= 98.83%, AUC = 0.9985, Specificity = 1.0000, Sensitivity = 0.9688, Precision = 1.0000, NPV = 0.9817, and F1-score for malignant = 0.98). QSVM achieved its highest accuracy at PCA = 4 (92.98%), AUC = 0.9622, Sensitivity = 0.9219, Precision = 0.8939, NPV = 0.9524, and F1-score for malignant = 0.91. Across the three PCA configurations, QSVM exhibited a non-monotonic relationship between PCA dimensions and quantum kernel performance . These findings provide a quantitative benchmark for comparing quantum and classical machine learning in breast cancer diagnosis.
Quantum support vector machines (QSVMs) are a novel approach for solving classification problems, combining the principles of quantum computing with the support vector machine algorithm. In this study, we applied a QSVM to the Breast Cancer Wisconsin (Original) data set to classify tumors as benign or malignant. Our results showed that the QSVM outperformed classical support vector machines in terms of classification accuracy, achieving a success rate of 100% while classical SVM shows almost perfect result with its accuracy 95%. Additionally, the QSVM required significantly less training time compared to the classical SVM. These results demonstrate the potential of QSVMs for solving complex classification problems in the field of medical diagnosis.
Current research paper presents a comparative analysis of classical and quantum machine learning algorithms for breast cancer diagnosis. The study focuses on two classical machine learning algorithms, XGBoost and SVM, along with two quantum models, Variational Quantum Classifier (VQC) and Quantum Support Vector Classifier (QSVC). The performance of the models is evaluated based on F1 score and recall. Results indicated that classic SVM and QSVC showed competitive results considering the other two algorithms regarding F1 score. This work contributes to the growing research on the application of classical and quantum ML algorithms in breast cancer classification.
Breast cancer is a major health concern, and early detection can make a great difference in treatment and survival rates for breast cancer patients. Machine learning methods have noticeably improved prediction accuracy on high-dimensional medical datasets and have become widely used tools in medical diagnostics. The transition to a quantum computational framework has opened new directions in machine learning research. By using qubits instead of classical bits, quantum models may provide new ways to represent and process complex medical data. In medical diagnostics, this has led to a growing interest in whether quantum approaches can improve classification performance more effectively than classical methods. The purpose of this paper is to compare classical and quantum machine learning models on the task of breast cancer classification and to determine whether quantum models can achieve higher accuracy and faster prediction on a selected dataset. Alongside the main simulator-based experiment, a smaller experiment was performed on a real IBM quantum computer to demonstrate the practical execution of the same task under current hardware constraints. In the practical part of the study, the Wisconsin Diagnostic Breast Cancer (WDBC) dataset was used. This dataset consists of 569 samples with 30 numerical features extracted from digitized fine needle aspirate images and provides a reliable basis for evaluating model performance. A comparative analysis was conducted between classical and quantum machine learning models, including a support vector machine (SVM), an artificial neural network (ANN), a quantum support vector machine (QSVM), and a hybrid quantum-classical neural network (QNN). In the simulator-based experiment, both SVM and ANN achieved an accuracy of 0.956 with an F1-score of 0.965 on the test set, while QSVM reached an accuracy of 0.807 with an F1-score of 0.866 and the Hybrid QNN achieved 0.623 accuracy with an F1-score of 0.677. These quantum and hybrid models also required substantially longer training times than the classical baselines. A small hardware experiment on an IBM quantum device further illustrates both the practical feasibility and the current limitations of executing this classification task on noisy intermediate-scale quantum hardware.
Breast cancer is rated as one of the top leading diagnosed and deadliest cancers affecting women worldwide and causing high mortality rate among cancers. With the data-driven applications, hybrid quantum-classical machine learning models have evolved as significant alternatives for handling complex feature spaces with the growing interest in quantum computing. This paper presents a systematic comparative study of classical and quantum machine learning approaches for breast cancer classification using the Wisconsin Breast Cancer Dataset. In this architecture we have preprocessed classical feature vectors using standard normalized techniques and parallelly quantum states are mapped through data embedding techniques which relies on parameterized rotational gates. In this work we have implemented all quantum models using the Pennylane library, resulting in hybrid quantum–classical optimization on near-term quantum simulators. The comparison results in multiple classical and quantum models. In classical we have Support Vector Machine (SVM), K-Nearest Neighbors (KNN) and Convolutional Neural Networks (CNN), which are compared with the quantum-based models such as the Variational Quantum Classifier (VQC), Quantum Support Vector Machine (QSVM) and Quantum Convolutional Neural Network (QCNN). In QSVM, we have performed dimensionality reduction using Principal Component Analysis (PCA) before to quantum embedding, and quantum-generated features are used to train a classical linear SVM. The evaluation metrics results in accuracy, precision, recall, F1-score, ROC curves and confusion matrices. The classical models achieves the accuracy in the range of 94%-96%, whereas competitive performance of quantum models demonstrate depending on the embedding strategy and circuit configuration. In the implemented quantum models, the variational quantum classifier achieved the highest classification accuracy of 96.06%, surpassing other evaluated models. These results demonstrate quantum embedding combined with variational quantum circuits can effectively capture discriminative patterns in medical datasets, indicating the implementation of quantum machine learning models for breast cancer diagnosis with the present quantum simulating platforms.
Abstract This study presents a comparison between classical machine learning (ML) algorithms and their quantum-enhanced counterparts in classifying scikit’s breast cancer dataset. Specifically, the research focused on evaluating the accuracy and time computational efficiency of quantum-enhanced machine learning (QEML) algorithms against traditional or classical machine learning algorithms. The quantum algorithms employed include the quantum support vector machine (qSVM), variational quantum classifier (VQC) and quantum k-nearest neighbor (qkNN). The qSVM and qkNN algorithms discussed here are really kernel-based hybrid classical-quantum algorithms as opposed to fully quantum algorithms and the VQC is a hybrid classical-quantum algorithm. These algorithms were tested against their classical equivalents: support vector machine (SVM), k-nearest neighbor (kNN), and artificial neural network (ANN). The qSVM algorithm demonstrated an 90% accuracy in distinguishing malignant from benign cancer cases (the classical support vector machine algorithm had a 99% accuracy), while qkNN achieved 90% accuracy (the classical kNN algorithm had an accuracy of 97%), and VQC reported 88.77± 0.26% (averaged over 5 runs) (this was compared with an ANN which had an accuracy of 96%). The accuracies of the classical SVM, kNN, and ANN algorithms were recorded, to provide a basis for comparison. The results indicated that while QEML algorithms perform reasonably well in classification tasks, however they do not consistently outperform classical algorithms. Additionally, the study measured the time efficiency of each algorithm. The ANN required 33.8 seconds, kNN required 0.21 seconds, and SVM required 1.98 seconds to perform the classification tasks. In contrast, the quantum algorithms were significantly slower, with the VQC taking 632.53 seconds, qkNN requiring 495.34 seconds, and qSVM requiring 538.05 seconds (This is not fixed per run but give an impression of the time scales to run the algorithms). We emphasize that this simulation runtime does not reflect actual quantum hardware performance, where gate execution and circuit depth constraints differ significantly. To mitigate this ambiguity, we distinguish between simulation runtime and estimated quantum runtime where relevant. This work potentially highlights the cases where it may not offer any advantage to use quantum machine learning algorithms. The Receiver Operating Characteristic (ROC) curve and the Area Under the Curve (AUC) analysis are also considered in this work where the values measured for the SVM, kNN and ANN were 99%, 99% and 99% respectively and for the qSVM, qkNN and VQC were 87%, 86% and 86± 0.2% (averaged over 5 runs) respectively. Overall, this research contributes valuable insights into the comparative performance of classical and quantum ML algorithms in a specific application, underscoring the potential and current limitations of quantum approaches in machine learning tasks. Hyperparameter optimization was done for all the algorithms, both quantum and classical, with Optuna. This was primarily because the QEML algorithms had more parameters and required considerable computational resources to optimize. This could have influenced the performance outcomes and is the basis for future work. The development of key comparison criteria is critical in the development of quantum machine learning, and this work offers some building blocks for this.