Classical machine learning, extensively utilized across diverse domains, faces limitations in speed, efficiency, parallelism, and processing of complex datasets. In contrast, quantum machine learning algorithms offer significant advantages, including exponentially faster computations, enhanced data handling capabilities, inherent parallelism, and improved optimization for complex problems. In this study, we used the entanglement-enhanced quantum kernel in quantum support vector machine to train complex respiratory data sets. Compared to classical algorithms, our findings reveal that QSVM performs better with 45% higher accuracy for complex respiratory data sets while maintaining comparable performance with linear datasets in contrast to their classical counterparts executed on a 2-qubit system. Through our study, we investigate the efficacy of the QSVM-Kernel algorithm in harnessing the enhanced dimensionality of the quantum Hilbert space for effectively training complex datasets.Classical machine learning, extensively utilized across diverse domains, faces limitations in speed, efficiency, parallelism, and processing of complex datasets. In contrast, quantum machine learning algorithms offer significant advantages, including exponentially faster computations, enhanced data handling capabilities, inherent parallelism, and improved optimization for complex problems. In this study, we used the entanglement-enhanced quantum kernel in quantum support vector machine to train complex respiratory data sets. Compared to classical algorithms, our findings reveal that QSVM performs better with 45% higher accuracy for complex respiratory data sets while maintaining comparable performance with linear datasets in contrast to their classical counterparts executed on a 2-qubit system. Through our study, we investigate the efficacy of the QSVM-Kernel algorithm in harnessing the enhanced dimensionality of the quantum Hilbert space for effectively training complex datasets.

arXiv:2406.01948Jun 4, 20243 citations

Quantum support vector machines for robust anomaly detection in noisy ICU physiological data

Soha Rawas

Early and accurate anomaly detection in Intensive Care Unit (ICU) monitoring is vital for improving patient outcomes and reducing mortality. Traditional machine learning techniques often face challenges in handling the noisy, high-dimensional, and limited datasets characteristic of ICU physiological signals. In this study, we present an early investigation of a quantum-enhanced framework employing a classically simulated Quantum Support Vector Machine (QSVM) to improve the detection of critical anomalies in real-world ICU time-series data. Utilizing the publicly available PhysioNet 2012 Challenge dataset, we extract comprehensive statistical and temporal features from vital signs including heart rate, blood pressure, respiratory rate, and oxygen saturation. Our QSVM model leverages a quantum kernel mapped via Qiskit’s ZZFeatureMap and is rigorously benchmarked against classical machine learning classifiers such as Support Vector Machines with radial basis function kernels, Random Forest, and XGBoost. Experimental results demonstrate that the QSVM shows competitive and robust classification performance, particularly excelling in scenarios with limited and noisy data, with an AUC of 0.92, particularly excelling in scenarios with limited and noisy data. Furthermore, the quantum kernel’s ability to implicitly project data into a high-dimensional Hilbert space provides enhanced separability of complex physiological patterns. This work constitutes one of the first simulation-based applications of quantum machine learning to critical care anomaly detection, underscoring the promise of hybrid quantum-classical approaches for advancing real-time clinical decision support systems.Early and accurate anomaly detection in Intensive Care Unit (ICU) monitoring is vital for improving patient outcomes and reducing mortality. Traditional machine learning techniques often face challenges in handling the noisy, high-dimensional, and limited datasets characteristic of ICU physiological signals. In this study, we present an early investigation of a quantum-enhanced framework employing a classically simulated Quantum Support Vector Machine (QSVM) to improve the detection of critical anomalies in real-world ICU time-series data. Utilizing the publicly available PhysioNet 2012 Challenge dataset, we extract comprehensive statistical and temporal features from vital signs including heart rate, blood pressure, respiratory rate, and oxygen saturation. Our QSVM model leverages a quantum kernel mapped via Qiskit’s ZZFeatureMap and is rigorously benchmarked against classical machine learning classifiers such as Support Vector Machines with radial basis function kernels, Random Forest, and XGBoost. Experimental results demonstrate that the QSVM shows competitive and robust classification performance, particularly excelling in scenarios with limited and noisy data, with an AUC of 0.92, particularly excelling in scenarios with limited and noisy data. Furthermore, the quantum kernel’s ability to implicitly project data into a high-dimensional Hilbert space provides enhanced separability of complex physiological patterns. This work constitutes one of the first simulation-based applications of quantum machine learning to critical care anomaly detection, underscoring the promise of hybrid quantum-classical approaches for advancing real-time clinical decision support systems.

Discover Quantum ScienceMay 11, 20261 citation

Quantum Machine Learning: Enhancing Algorithms through Quantum Neural Networks and Data Analysis

Rakesh Sengupta, Usha Desai, Anand Singh Rajawat +3 more

This paper evaluates the performance of two quantum machine learning algorithms: Quantum Support Vector Machine (QSVM) and Quantum Principal Component Analysis (Q-PCA). The scalability of QSVM is analyzed across increasing dataset sizes and feature dimensions, revealing faster-than-linear growth in kernel evaluation and SVM training times. However, this computational overhead is accompanied by a notable decline in classification accuracy, highlighting challenges in applying QSVM to larger or more complex datasets. In contrast, Q-PCA demonstrates near-linear scalability with dataset size and qubit count, leveraging the independence of quantum circuit execution and structured operations to maintain efficiency. A QNN-based implementation of Q-PCA further validates its ability to align data with principal components, maximize variance, and enable effective dimensionality reduction. These findings emphasize the potential of Q-PCA for efficient quantum-enhanced data analysis while underscoring the need for optimization in QSVM and further exploration of Q-PCA’s capabilities for real-world quantum computing applications.This paper evaluates the performance of two quantum machine learning algorithms: Quantum Support Vector Machine (QSVM) and Quantum Principal Component Analysis (Q-PCA). The scalability of QSVM is analyzed across increasing dataset sizes and feature dimensions, revealing faster-than-linear growth in kernel evaluation and SVM training times. However, this computational overhead is accompanied by a notable decline in classification accuracy, highlighting challenges in applying QSVM to larger or more complex datasets. In contrast, Q-PCA demonstrates near-linear scalability with dataset size and qubit count, leveraging the independence of quantum circuit execution and structured operations to maintain efficiency. A QNN-based implementation of Q-PCA further validates its ability to align data with principal components, maximize variance, and enable effective dimensionality reduction. These findings emphasize the potential of Q-PCA for efficient quantum-enhanced data analysis while underscoring the need for optimization in QSVM and further exploration of Q-PCA’s capabilities for real-world quantum computing applications.

International Conference on Augmented Reality, Intelligent Systems, and Industrial Automation (ARIIA)Dec 20, 20243 citations

Pancreatic Cancer Data Classification with Quantum Machine Learning

Amit Kumar Saxena, Smita Saxena

Quantum computing is a promising new approach to tackle the complex real-world computational problems by harnessing the power of quantum mechanics principles. The inherent parallelism and exponential computational power of quantum systems hold the potential to outpace classical counterparts in solving complex optimization problems, which are pervasive in machine learning. Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm inspired by classical Support Vector Machine (SVM) that exploits quantum parallelism to efficiently classify data points in high-dimensional feature spaces. We provide a comprehensive overview of the underlying principles of QSVM, elucidating how different quantum feature maps and quantum kernels enable the manipulation of quantum states to perform classification tasks. Through a comparative analysis, we reveal the quantum advantage achieved by these algorithms in terms of speedup and solution quality. As a case study, we explored the potential of quantum paradigms in the context of a real-world problem: classifying pancreatic cancer biomarker data. The Support Vector Classifier (SVC) algorithm was employed for the classical approach while the QSVM algorithm was executed on a quantum simulator provided by the Qiskit quantum computing framework. The classical approach as well as the quantum-based techniques reported similar accuracy. This uniformity suggests that these methods effectively captured similar underlying patterns in the dataset. Remarkably, quantum implementations exhibited substantially reduced execution times demonstrating the potential of quantum approaches in enhancing classification efficiency. This affirms the growing significance of quantum computing as a transformative tool for augmenting machine learning paradigms and also underscores the potency of quantum execution for computational acceleration.Quantum computing is a promising new approach to tackle the complex real-world computational problems by harnessing the power of quantum mechanics principles. The inherent parallelism and exponential computational power of quantum systems hold the potential to outpace classical counterparts in solving complex optimization problems, which are pervasive in machine learning. Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm inspired by classical Support Vector Machine (SVM) that exploits quantum parallelism to efficiently classify data points in high-dimensional feature spaces. We provide a comprehensive overview of the underlying principles of QSVM, elucidating how different quantum feature maps and quantum kernels enable the manipulation of quantum states to perform classification tasks. Through a comparative analysis, we reveal the quantum advantage achieved by these algorithms in terms of speedup and solution quality. As a case study, we explored the potential of quantum paradigms in the context of a real-world problem: classifying pancreatic cancer biomarker data. The Support Vector Classifier (SVC) algorithm was employed for the classical approach while the QSVM algorithm was executed on a quantum simulator provided by the Qiskit quantum computing framework. The classical approach as well as the quantum-based techniques reported similar accuracy. This uniformity suggests that these methods effectively captured similar underlying patterns in the dataset. Remarkably, quantum implementations exhibited substantially reduced execution times demonstrating the potential of quantum approaches in enhancing classification efficiency. This affirms the growing significance of quantum computing as a transformative tool for augmenting machine learning paradigms and also underscores the potency of quantum execution for computational acceleration.

Journal of quantum computingJan 1, 202310 citations

Why Classical-Quantum Machine Learning Works Better Than Classical Machine Learning

Abdullah Md Raihan Chy, Md. Farhan Shahriyar

Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris $(100 \%)$ and Wine $(92 \%)$ . All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris$(100 \%)$and Wine$(92 \%)$. All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)Apr 16, 20260 citations

Optimization of the Quantum Backpropagation Algorithm for Improving the Quantum Support Vector Machine

Yiwen Ye, Shuiying Cai, Yunguo Lin

Abstract The high-dimensional linear separability of the classic support vector machine is achieved through the kernel method, which maps data to a high-dimensional space. However, the kernel method involves estimating multiple parameters, which reduces the model's computational efficiency. To address this, some related works use quantum kernel estimation to replace the classic kernel method, thus reducing the computational load associated with parameter estimation in quantum support vector machines. Despite these improvements, quantum support vector machines face the challenge of establishing correlations between different data points through quantum entanglement to effectively capture the distribution characteristics of the data. Consequently, the model's accuracy is low when performing regression analysis on large datasets with complex distributions. To address this issue, an improved quantum backpropagation algorithm is introduced, utilizing controlled-Z gates to entangle qubits representing different data points. Additionally, to enhance the entanglement between qubits, the absolutely maximally entangled state is employed to further optimize the quantum backpropagation algorithm. This enhancement enables the algorithm to better capture the distribution characteristics of the data. Building on this, the quantum support vector machine model is improved to overcome the shortcomings of the existing model. A new algorithm is proposed, and the parameter count of the new algorithm's circuit is analyzed. Experimental results demonstrate that optimizing the quantum backpropagation algorithm to improve the quantum support vector machine leads to higher accuracy in regression analysis on real-world problems. Specifically, strengthening the degree of quantum entanglement makes the model more capable of capturing the distribution characteristics of complex datasets, resulting in more accurate fitting outcomes.Abstract The high-dimensional linear separability of the classic support vector machine is achieved through the kernel method, which maps data to a high-dimensional space. However, the kernel method involves estimating multiple parameters, which reduces the model's computational efficiency. To address this, some related works use quantum kernel estimation to replace the classic kernel method, thus reducing the computational load associated with parameter estimation in quantum support vector machines. Despite these improvements, quantum support vector machines face the challenge of establishing correlations between different data points through quantum entanglement to effectively capture the distribution characteristics of the data. Consequently, the model's accuracy is low when performing regression analysis on large datasets with complex distributions. To address this issue, an improved quantum backpropagation algorithm is introduced, utilizing controlled-Z gates to entangle qubits representing different data points. Additionally, to enhance the entanglement between qubits, the absolutely maximally entangled state is employed to further optimize the quantum backpropagation algorithm. This enhancement enables the algorithm to better capture the distribution characteristics of the data. Building on this, the quantum support vector machine model is improved to overcome the shortcomings of the existing model. A new algorithm is proposed, and the parameter count of the new algorithm's circuit is analyzed. Experimental results demonstrate that optimizing the quantum backpropagation algorithm to improve the quantum support vector machine leads to higher accuracy in regression analysis on real-world problems. Specifically, strengthening the degree of quantum entanglement makes the model more capable of capturing the distribution characteristics of complex datasets, resulting in more accurate fitting outcomes.

Aug 6, 20240 citations

(100 \%)

and Wine

(92 \%)

. All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.