A typical problem that is solved by supervised machine learning techniques is classification. There are many types of this problem, such as binary classification, multi-classification, and multi-labels. The development of techniques that perform well in different types of classification problems, and for datasets with many or few variables, or many or few data, remains a challenge. On the other hand, recent work indicates that machine learning can benefit from quantum computing in terms of reducing computational complexity and improving its performance. The purpose of this research is to analyze the use of Quantum Support Vector Machines (QSVM) for different types of classification problems. For this, several kernels (linear and Gaussian) are considered. In turn, a comparison is made with Random Forest. Also, a detailed analysis is carried out for the binary classification of coffee beans, obtaining a precision of 95% and an accuracy of 79%.
A typical problem that is solved by supervised machine learning techniques is classification. There are many types of this problem, such as binary classification, multi-classification, and multi-labels. The development of techniques that perform well in different types of classification problems, and for datasets with many or few variables, or many or few data, remains a challenge. On the other hand, recent work indicates that machine learning can benefit from quantum computing in terms of reducing computational complexity and improving its performance. The purpose of this research is to analyze the use of Quantum Support Vector Machines (QSVM) for different types of classification problems. For this, several kernels (linear and Gaussian) are considered. In turn, a comparison is made with Random Forest. Also, a detailed analysis is carried out for the binary classification of coffee beans, obtaining a precision of 95% and an accuracy of 79%.
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 combines the power of quantum computing with machine learning to address complex computational challenges. In this work, we propose an integrated approach that leverages Quantum Non-Negative Matrix Factorization (QNMF) for feature selection and dimensionality reduction, coupled with Quantum Support Vector Machines (QSVM) for accurate classification. By combining the strengths of these two quantum techniques, our approach reduces data complexity while maintaining classification accuracy. We evaluate the performance of our method across multiple datasets from finance, healthcare, and e-commerce. Experimental results demonstrate that the proposed QNMF+QSVM approach achieves superior accuracy compared to classical machine learning methods such as SVM, Random Forests, and Decision Trees, highlighting its potential for solving real-world classification problems.
With the increasing complexity of projects and the volume of data in Software Engineering (SE), the need for efficient and accurate data analysis techniques has become crucial. Classification algorithms play a vital role in various SE tasks, such as bug detection, software quality prediction, and requirements classification. Quantum computing offers a new paradigm with the potential to overcome classical computational limitations for certain types of problems. This research proposes the design and implementation of a kernel-based quantum classification algorithm (also known as Quantum Support Vector Machine - QSVM) tailored for data analysis in the SE domain. We will discuss the fundamental principles behind quantum feature mapping and quantum kernel matrices, and demonstrate its implementation using quantum computing libraries. As a case study, the designed algorithm will be tested on a software bug detection dataset, comparing its performance with classical kernel-based classification algorithms like Support Vector Machine (SVM). The result of the comparison show that QSVM is superior in terms of accuracy, precision, recall, and F1-score compared to SVM.
The application of machine learning in the era of digital agriculture has rapidly transformed the Indian agricultural landscape. Simultaneously, quantum technology has begun to play a crucial role in modern computational paradigms, leading to the research of Quantum Machine Learning (QML). In recent years, QML has been applied to solve complex challenges in modern sectors, including smart agriculture. The Quantum Support Vector Machine (QSVM) is a quantum-enhanced variant of the classical Support Vector Machine (SVM). This research investigates the performance of QSVM in binary classification of coffee diseases, specifically coffee leaf rust and phoma. Six Gray-Level Co-occurrence Matrix (GLCM) features: contrast, correlation, dissimilarity, energy, entropy, and homogeneity were extracted. PCA was applied to the combined 18 features, and varying numbers of components were extracted. Then classification was performed with both SVM and QSVM on the reduced feature vector. In the experiment, three SVM kernels, three QSVM feature maps, and five classification evaluation metrics were used to conduct a comprehensive study. The experimental results show that the SVM with a polynomial kernel achieved 89.83% accuracy, while the QSVM with a full feature map achieved 95.83% accuracy in classifying healthy leaves from those affected by coffee leaf rust. Additionally, the SVM with a polynomial kernel achieved an accuracy of 83.17% in classifying healthy leaves from those affected by phoma, whereas the QSVM achieved 96.17%. Finally, the research discussed the performance of the QSVM under different evaluation parameters and its limitations.
Quantum machine learning (QML) is an evolving field which is capable of surpassing the classical machine learning in solving classification and clustering problems. The enormous growth in data size started creating barrier for classical machine learning techniques. QML stand out as a best solution to handle big and complex data. In this paper quantum support vector machine (QSVM) based models for the classification of three benchmarking datasets namely, Iris species, Pumpkin seed and Raisin has been constructed. These QSVM based classification models are implemented on real-time superconducting quantum computers/simulators. The performance of these classification models is evaluated in the context of execution time and accuracy and compared with the classical support vector machine (SVM) based models. The kernel based QSVM models for the classification of datasets when run on IBMQ_QASM_simulator appeared to be 232, 207 and 186 times faster than the SVM based classification model. The results indicate that quantum computers/algorithms deliver quantum speed-up.
The support vector machine algorithm with a quantum kernel estimator (QSVM-Kernel), as a leading example of a quantum machine learning technique, has undergone significant advancements. Nevertheless, its integration with classical data presents unique challenges. While quantum computers primarily interact with data in quantum states, embedding classical data into quantum states using feature mapping techniques is essential for leveraging quantum algorithms Despite the recognized importance of feature mapping, its specific impact on data classification outcomes remains largely unexplored. This study addresses this gap by comprehensively assessing the effects of various feature mapping methods on classification results, taking medical data analysis as a case study. In this study, the QSVM-Kernel method was applied to classification problems in two different and publicly available medical datasets, namely, the Wisconsin Breast Cancer (original) and The Cancer Genome Atlas (TCGA) Glioma datasets. In the QSVM-Kernel algorithm, quantum kernel matrices obtained from 9 different quantum feature maps were used. Thus, the effects of these quantum feature maps on the classification results of the QSVM-Kernel algorithm were examined in terms of both classifier performance and total execution time. As a result, in the Wisconsin Breast Cancer (original) and TCGA Glioma datasets, when Rx and Ry rotational gates were used, respectively, as feature maps in the QSVM-Kernel algorithm, the best classification performances were achieved both in terms of classification performance and total execution time. The contributions of this study are that (1) it highlights the significant impact of feature mapping techniques on medical data classification outcomes using the QSVM-Kernel algorithm, and (2) it also guides undertaking research for improved QSVM classification performance.