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.
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.
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.
Abstract Support vector machine(SVM) is one of the most popular machine learning(ML) methods which are widely used as the methodology of choice in Breast Cancer detection because of its unique advantages in critical features detection from complex breast cancer datasets. Quantum support vector machine(QSVM) uses the power of quantum mechanics to improve the performance of classical support vector machine(SVM) algorithms with theoretical acceleration advantage. However, it still suffers from the wide error problem and hardware limits in Noisy Intermediate-Scale Quantum computing(NISQ). Consequently, we propose a quantum kernel estimation method with measurement error mitigation and test it using the Wisconsin Breast Cancer database first on the IBM quantum processors. The experimental results show that we can achieve remarkable performance improvement in accuracy for solving such binary classification problems compared to state-of-the-art models, which shows the great potential for the design and implementation of machine learning algorithms with quantum advantages in the future.
Quantum computing is an emerging field that can effectively solve several machine learning problems. The immensely growing data size has begun to create barriers for classical machine learning algorithms. Quantum computers proficiently handle and process big data composed of metrics and vectors. This paper presents the quantum machine learning model based on quantum support vector machines (QSVM) to classify brain tumours into malignant and benign. The dataset used in this experiment is Brats 2015, available on Kaggle. The QSVM-based model was run on real-time quantum machines and simulators to extract the performance metrics in terms of accuracy and execution time. The QSVM classification model is compared with its classical SVM equivalent. The kernel-based QSVM model implementation on a 32-qubit quantum simulator was 188 times faster with 95% accuracy which is 1.60% better than the classical equivalent. Similarly, the model takes 24.19% less time than the classical SVM model when realized on a 5-qubit real-time superconducting processor with the same accuracy. Hence, the results reveal that quantum machine learning models implemented on quantum computers outperformed their classical equivalents.
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
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.
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.