Abstract Machine learning has emerged as a promising method for predicting breast cancer using quantum computation techniques. Quantum machine learning algorithms, such as quantum support vector machines (QSVMs), are demonstrating superior efficiency and economy in tackling complex problems compared to traditional machine learning methods. When compared with classical support vector machine, the quantum machine produces remarkably accurate results. The suggested quantum SVM model in this study effectively resolved the binary classification problem for diagnosing malignant breast cancer. This work introduces an enhanced approach to breast cancer diagnosis by integrating QSVM with elitist non‐dominated sorting genetic optimization (ENSGA), leveraging the strengths of both techniques to achieve more accurate and efficient classification results. ENSGA plays a crucial role in optimising QSVM parameters, ensuring that the model attains the best possible classification accuracy while considering multiple objectives simultaneously. Moreover, the quantum kernel estimation method demonstrated exceptional performance by achieving high accuracy within an impressive execution time of 0.14 in the IBM QSVM simulator. The seamless integration of quantum computation techniques with optimisation strategies such as ENSGA highlights the potential of quantum machine learning in revolutionising the field of healthcare, particularly in the domain of breast cancer diagnosis.
Abstract Machine learning has emerged as a promising method for predicting breast cancer using quantum computation techniques. Quantum machine learning algorithms, such as quantum support vector machines (QSVMs), are demonstrating superior efficiency and economy in tackling complex problems compared to traditional machine learning methods. When compared with classical support vector machine, the quantum machine produces remarkably accurate results. The suggested quantum SVM model in this study effectively resolved the binary classification problem for diagnosing malignant breast cancer. This work introduces an enhanced approach to breast cancer diagnosis by integrating QSVM with elitist non‐dominated sorting genetic optimization (ENSGA), leveraging the strengths of both techniques to achieve more accurate and efficient classification results. ENSGA plays a crucial role in optimising QSVM parameters, ensuring that the model attains the best possible classification accuracy while considering multiple objectives simultaneously. Moreover, the quantum kernel estimation method demonstrated exceptional performance by achieving high accuracy within an impressive execution time of 0.14 in the IBM QSVM simulator. The seamless integration of quantum computation techniques with optimisation strategies such as ENSGA highlights the potential of quantum machine learning in revolutionising the field of healthcare, particularly in the domain of 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.
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.
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.
The impacts of breast cancer remain a severe cause of death, significantly affecting the quality of life, especially among women. Traditional diagnostic approaches, particularly in the early stages, lack sophistication, reliability, and accuracy. Early and accurate diagnosis is crucial for improving survival rates and reducing the need for aggressive treatments. To address this, QSVM-GSA, an innovative quantum algorithm, is proposed. This novel integrated quantum framework simultaneously addresses the dual challenge of high diagnostic accuracy (via QSVM's quantum kernel trick) and computational efficiency/speed (via GSA integration). QSVM-GSA combines the Quantum Support Vector Machine and Grover's Search Algorithm, leveraging quantum mechanics for superior diagnostic accuracy and efficiency. It encodes complex medical data, such as the Wisconsin Breast Cancer Dataset, into quantum states. QSVM operates in the exponentially larger Hilbert space, identifying subtle patterns missed by classical classifiers. Quantum kernels establish nuanced relationships within the data, enabling precise tumour classification. Grover's search accelerates this process, offering a quadratic speed gain in scanning vast datasets and optimising feature selection. This allows for rapid identification of malignant patterns without compromising accuracy. Robustness is enhanced through advanced error-correcting techniques, ensuring fault tolerance and preserving computational integrity even in noisy environments. The model achieved 84.4% accuracy, 83.3% precision, 88.2% recall, and 85.7% F1-score on the Wisconsin Breast Cancer Dataset. Ultimately, QSVM-GSA represents a significant breakthrough in medical diagnostics, setting new standards in accuracy, speed, and reliability for breast cancer detection.
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.