Global Positioning System (GPS) plays a critical role in navigation by utilizing satellite signals, but its accuracy in urban environments is often compromised by signal obstructions. Previous research has categorized GPS reception conditions into line-of-sight (LOS), non-line-of-sight (NLOS), and LOS+NLOS scenarios to enhance accuracy. This paper introduces a novel approach using quantum support vector machines (QSVM) with a ZZ feature map and fidelity quantum kernel to classify urban GPS signal reception conditions, comparing its performance against classical SVM methods. While classical SVM has been previously explored for this purpose, our study is the first to apply QSVM to this classification task. We conducted experiments using datasets from two distinct urban locations to train and evaluate SVM and QSVM models. Our results demonstrate that QSVM achieves superior classification accuracy compared to classical SVM for urban GPS signal datasets. Additionally, we emphasize the importance of appropriately scaling raw data when utilizing QSVM.
Global Positioning System (GPS) plays a critical role in navigation by utilizing satellite signals, but its accuracy in urban environments is often compromised by signal obstructions. Previous research has categorized GPS reception conditions into line-of-sight (LOS), non-line-of-sight (NLOS), and LOS+NLOS scenarios to enhance accuracy. This paper introduces a novel approach using quantum support vector machines (QSVM) with a ZZ feature map and fidelity quantum kernel to classify urban GPS signal reception conditions, comparing its performance against classical SVM methods. While classical SVM has been previously explored for this purpose, our study is the first to apply QSVM to this classification task. We conducted experiments using datasets from two distinct urban locations to train and evaluate SVM and QSVM models. Our results demonstrate that QSVM achieves superior classification accuracy compared to classical SVM for urban GPS signal datasets. Additionally, we emphasize the importance of appropriately scaling raw data when utilizing QSVM.
Abstract This work investigates the feasibility of using quantum machine learning for reforestation-suitability classification in the Mumbai region by integrating Quantum Support Vector Machines (QSVMs) with a GIS-based preprocessing pipeline. Satellite-derived indicators---NDVI, rainfall, slope, soil pH, and soil organic carbon---are extracted from Google Earth Engine and labeled using rule-based ecological thresholds. The resulting dataset is standardized, scaled to [−1,1], balanced with SMOTE, and compressed using Principal Component Analysis (PCA) to align the feature dimension with the number of qubits. Two quantum kernel models, based on Pauli and ZZ feature maps, are implemented in Qiskit and evaluated against classical SVM baselines under identical preprocessing conditions. On the balanced dataset, the classical SVM achieves an accuracy of approximately 98\%, while Pauli- and ZZ-based QSVMs obtain 89\% and 77\% accuracy, respectively. These results indicate that, although quantum models do not surpass classical SVMs in this setting, well-designed quantum kernels can achieve competitive performance on small, structured geospatial datasets. The study positions QSVMs as complementary tools rather than replacements for classical models and highlights the importance of scaling, class balancing, and PCA--qubit alignment for stable quantum behavior in environmental analytics.
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 essence of quantum machine learning is to optimize problem-solving by executing machine learning algorithms on quantum computers and exploiting potent laws such as superposition and entanglement. Support vector machine (SVM) is widely recognized as one of the most effective classification machine learning techniques currently available. Since, in conventional systems, the SVM kernel technique tends to sluggish down and even fail as datasets become increasingly complex or jumbled. To compare the execution time and accuracy of conventional SVM classification to that of quantum SVM classification, the appropriate quantum features for mapping need to be selected. As the dataset grows complex, the importance of selecting an appropriate feature map that outperforms or performs as well as the classification grows. This paper utilizes conventional SVM to select an optimal feature map and benchmark dataset for predicting air quality. Experimental evidence demonstrates that the precision of quantum SVM surpasses that of classical SVM for air quality assessment. Using quantum labs from IBM's quantum computer cloud, conventional and quantum computing have been compared. When applied to the same dataset, the conventional SVM achieved an accuracy of 91% and 87% respectively, whereas the quantum SVM demonstrated an accuracy of 97% and 94% respectively for air quality prediction. The study introduces the use of quantum Support Vector Machines (SVM) for predicting air quality. It emphasizes the novel method of choosing the best quantum feature maps. Through the utilization of quantum-enhanced feature mapping, our objective is to exceed the constraints of classical SVM and achieve unparalleled levels of precision and effectiveness. We conduct precise experiments utilizing IBM's state-of-the-art quantum computer cloud to compare the performance of conventional and quantum SVM algorithms on a shared dataset.
Quantum-assisted machine learning approaches have become a significant area of research in the healthcare domain by offering alternative solutions to classical methods, particularly when dealing with high-dimensional and complex datasets. This study presents a comparative evaluation of the classification performance of classical Support Vector Machines (SVM) and quantum-based algorithms Quantum Support Vector Machine (QSVM) and Pegasos-QSVM on healthcare data. Experimental analyses were conducted using three distinct medical datasets related to liver disease, breast cancer, and heart failure. The results demonstrate that the QSVM model consistently achieved the highest and most stable classification accuracy. Although the Pegasos-QSVM model achieved comparable accuracy rates in certain configurations, its performance was generally more variable. Nevertheless, thanks to its lower computational cost and faster processing time, Pegasos-QSVM emerges as a promising alternative, particularly in resource-constrained environments. The findings suggest that quantum-assisted models can deliver performance levels competitive with classical approaches, particularly highlighting the effectiveness of QSVM on small- to medium-sized datasets.
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.
As a degenerative disease that seriously affects the central nervous system, early diagnosis of Parkinson's disease is important for slowing down the course of the disease and improving patients' quality of life.In recent years, machine learning has shown great potential in medical data analysis, and support vector machines (SVMs) are widely used in classification and prediction tasks.However, traditional SVMs have some limitations in high dimensionality and complex data processing.With the rapid development of quantum computing, quantum support vector machines (QSVMs) have become an emerging technology that has attracted much attention due to its ability to process largescale data and its potential for modeling high-dimensional features.In this paper, we compare traditional SVMs and QSVMs in the analysis of Parkinson's disease data, and evaluate their performance in terms of classification accuracy.The experiments are conducted on a publicly available dataset and analyzed in detail through the steps of model construction, data preprocessing, algorithm implementation, and performance evaluation.The results show that QSVM outperforms traditional SVM in complex feature space, which demonstrates its potential advantages and application prospects in medical data analysis.