Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

SPARSITY AND WEAK SUPERVISION IN QUANTUM MACHINE LEARNING

Seyran Saeedi

Published Jan 1, 2020• 0 citations
Publisher

Abstract

Quantum computing is an interdisciplinary field at the intersection of computer science, mathematics, and physics that studies information processing tasks on a quantum computer. A quantum computer is a device whose operations are governed by the laws of quantum mechanics. As building quantum computers is nearing the era of commercialization and quantum supremacy, it is essential to think of potential applications that we might benefit from. Among many applications of quantum computation, one of the emerging fields is quantum machine learning. We focus on predictive models for binary classification and variants of Support Vector Machines that we expect to be especially important when training data becomes so large that a quantum algorithm with a guaranteed speedup becomes useful. We present a quantum machine learning algorithm for training Sparse Support Vector Machine for problems with large datasets that require a sparse solution. We also present the first quantum semi-supervised algorithm, where we still have a large dataset, but only a small fraction is provided with labels. While the availability of data for training machine learning models is steadily increasing, oftentimes it is much easier to collect feature vectors to obtain the corresponding labels. Here, we present a quantum machine learning algorithm for training Semi-Supervised Kernel Support Vector Machines. The algorithm uses recent advances in quantum sample-based Hamiltonian simulation to extend the existing Quantum LS-SVM algorithm to handle the semi-supervised term in the loss while maintaining the same quantum speedup as the Quantum LS-SVM.

DOI
10.25772/037r-wn88

Related papers

Quantum support vector machine for big feature and big data classification.

Patrick Rebentrost, Masoud Mohseni, Seth Lloyd

Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized linear and non-linear binary classifier, can be implemented on a quantum computer, with exponential speedups in the size of the vectors and the number of training data examples. At the core of the algorithm is a non-sparse matrix simulation technique to efficiently perform a principal component analysis and matrix inversion of the training data kernel matrix. We thus provide an example of a quantum big feature and big data algorithm and pave the way for future developments at the intersection of quantum computing and machine learning.

•Jul 1, 2013•38 citations

Quantum-Inspired Support Vector Machine

Chen Ding, Tian-Yi Bao, He-Liang Huang

Support vector machine (SVM) is a particularly powerful and flexible supervised learning model that analyzes data for both classification and regression, whose usual algorithm complexity scales polynomially with the dimension of data space and the number of data points. To tackle the big data challenge, a quantum SVM algorithm was proposed, which is claimed to achieve exponential speedup for least squares SVM (LS-SVM). Here, inspired by the quantum SVM algorithm, we present a quantum-inspired classical algorithm for LS-SVM. In our approach, an improved fast sampling technique, namely indirect sampling, is proposed for sampling the kernel matrix and classifying. We first consider the LS-SVM with a linear kernel, and then discuss the generalization of our method to nonlinear kernels. Theoretical analysis shows our algorithm can make classification with arbitrary success probability in logarithmic runtime of both the dimension of data space and the number of data points for low rank, low condition number, and high dimensional data matrix, matching the runtime of the quantum SVM.

arXiv:1906.08902•IEEE Transactions on Neural Networks and Learning Systems•Jun 10, 2021•212 citations

Quantum Machine Learning: Harnessing Quantum Algorithms for Supervised and Unsupervised Learning

Mohit Mittal

Quantum machine learning (QML) provides a transformative approach to data analysis by integrating the principles of quantum computing with classical machine learning methods. With the exponential growth of data and the increasing complexity of computational tasks, quantum algorithms offer tremendous advantages in terms of processing speed, memory efficiency, and the ability to resolve issues intractable for classical systems. In this work, the use of QML techniques for both supervised and unsupervised learning problems is explored. Quantum-enhanced models such Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs) show outstanding performance in classification and regression tasks by using quantum kernels and entanglement in supervised learning. Moreover, hybrid quantum-classical solutions offer useful implementations on noisy intermediate-scale quantum (NISQ) devices, hence bridging the gap between present quantum technology and practical uses. By means of comparative analysis, this paper emphasizes the possible benefits and drawbacks of QML, thereby providing understanding of its future importance in sectors including material science, finance, and healthcare. In the end, QML opens the path for a new era of intelligent data processing and solves until unthinkable difficult challenges.

International Journal of Innovative Research in Science Engineering and Technology•Sep 30, 2022•3 citations

Probabilistic Quantum SVM Training on Ising Machine

Haoqi He, Xiao Yan

Quantum computing holds significant potential to accelerate machine learning algorithms, especially in solving optimization problems like those encountered in Support Vector Machine (SVM) training. However, current QUBO-based Quantum SVM (QSVM) methods rely solely on binary optimal solutions, limiting their ability to identify fuzzy boundaries in data. Additionally, the limited qubit count in contemporary quantum devices constrains training on larger datasets. In this paper, we propose a probabilistic quantum SVM training framework suitable for Coherent Ising Machines (CIMs). By formulating the SVM training problem as a QUBO model, we leverage CIMs' energy minimization capabilities and introduce a Boltzmann distribution-based probabilistic approach to better approximate optimal SVM solutions, enhancing robustness. To address qubit limitations, we employ batch processing and multi-batch ensemble strategies, enabling small-scale quantum devices to train SVMs on larger datasets and support multi-class classification tasks via a one-vs-one approach. Our method is validated through simulations and real-machine experiments on binary and multi-class datasets. On the banknote binary classification dataset, our CIM-based QSVM, utilizing an energy-based probabilistic approach, achieved up to 20% higher accuracy compared to the original QSVM, while training up to $10^4$ times faster than simulated annealing methods. Compared with classical SVM, our approach either matched or reduced training time. On the IRIS three-class dataset, our improved QSVM outperformed existing QSVM models in all key metrics. As quantum technology advances, increased qubit counts are expected to further enhance QSVM performance relative to classical SVM.

arXiv:2503.16363•Mar 20, 2025•3 citations

Semisupervised Anomaly Detection using Support Vector Regression with Quantum Kernel

Kilian Tscharke, Sebastian Issel, Pascal Debus

Anomaly detection, an important task in data analysis, involves identifying observations or events that deviate in some way from the rest of the data. Machine learning techniques have shown success in automating this process by detecting hidden patterns and deviations in large-scale data. The potential of quantum computing for machine learning has been widely recognized, leading to extensive research efforts to develop suitable quantum machine learning (QML) algorithms. In particular, the search for QML algorithms for near-term NISQ devices is in full swing. However, NISQ devices pose additional challenges due to their limited qubit coherence times, low number of qubits, and high error rates. Kernel methods based on quantum kernel estimation have emerged as a promising approach to QML on NISQ devices, offering theoretical guarantees, versatility, and compatibility with NISQ constraints. Especially support vector machines (SVM) utilizing quantum kernel estimation have shown success in various supervised learning tasks. However, in the context of anomaly detection, semisupervised learning is of great relevance, and yet there is limited research published in this area. This paper introduces an approach to semisupervised anomaly detection based on the reconstruction loss of a support vector regression (SVR) with quantum kernel. This novel model is an alternative to the variational quantum and quantum kernel one-class classifiers, and is compared to a quantum autoencoder as quantum baseline and a SVR with radial-basis-function (RBF) kernel as well as a classical autoencoder as classical baselines. The models are benchmarked extensively on 10 real-world anomaly detection data sets and one toy data set and it is shown that our SVR model with quantum kernel performs better than the SVR with RBF kernel as well as all other models, achieving highest mean AUC over all data sets. In addition, our QSVR outperforms the Quantum autoencoder on 9 out of 11 data sets.

arXiv:2308.00583•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•24 citations

A review of quantum support vector machine for data classification

Tran, Tien

Quantum Machine Learning is an active research field where the power of quantum mechanics is integrated into machine learning algorithms to solve problems that are intractable for classical computers. Quantum support vector machine (QSVM) was one of the first quantum algorithms that got implemented on real quantum hardware. It demonstrated promising outcomes as compared to classical Support vector machine (SVM) through many implementations. However, it encounters challenges in scaling with large datasets and in resource effectiveness when compare to the usage of innovative classical algorithms in the Noisy Intermediate Scale Quantum era. Here is a review of some latest developments of QSVM and discussion on prospects of QSVM application in the future.

•Aug 30, 2024•0 citations
Quantum computing is an interdisciplinary field at the intersection of computer science, mathematics, and physics that studies information processing tasks on a quantum computer. A quantum computer is a device whose operations are governed by the laws of quantum mechanics. As building quantum computers is nearing the era of commercialization and quantum supremacy, it is essential to think of potential applications that we might benefit from. Among many applications of quantum computation, one of the emerging fields is quantum machine learning. We focus on predictive models for binary classification and variants of Support Vector Machines that we expect to be especially important when training data becomes so large that a quantum algorithm with a guaranteed speedup becomes useful. We present a quantum machine learning algorithm for training Sparse Support Vector Machine for problems with large datasets that require a sparse solution. We also present the first quantum semi-supervised algorithm, where we still have a large dataset, but only a small fraction is provided with labels. While the availability of data for training machine learning models is steadily increasing, oftentimes it is much easier to collect feature vectors to obtain the corresponding labels. Here, we present a quantum machine learning algorithm for training Semi-Supervised Kernel Support Vector Machines. The algorithm uses recent advances in quantum sample-based Hamiltonian simulation to extend the existing Quantum LS-SVM algorithm to handle the semi-supervised term in the loss while maintaining the same quantum speedup as the Quantum LS-SVM.
Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized linear and non-linear binary classifier, can be implemented on a quantum computer, with exponential speedups in the size of the vectors and the number of training data examples. At the core of the algorithm is a non-sparse matrix simulation technique to efficiently perform a principal component analysis and matrix inversion of the training data kernel matrix. We thus provide an example of a quantum big feature and big data algorithm and pave the way for future developments at the intersection of quantum computing and machine learning.
Support vector machine (SVM) is a particularly powerful and flexible supervised learning model that analyzes data for both classification and regression, whose usual algorithm complexity scales polynomially with the dimension of data space and the number of data points. To tackle the big data challenge, a quantum SVM algorithm was proposed, which is claimed to achieve exponential speedup for least squares SVM (LS-SVM). Here, inspired by the quantum SVM algorithm, we present a quantum-inspired classical algorithm for LS-SVM. In our approach, an improved fast sampling technique, namely indirect sampling, is proposed for sampling the kernel matrix and classifying. We first consider the LS-SVM with a linear kernel, and then discuss the generalization of our method to nonlinear kernels. Theoretical analysis shows our algorithm can make classification with arbitrary success probability in logarithmic runtime of both the dimension of data space and the number of data points for low rank, low condition number, and high dimensional data matrix, matching the runtime of the quantum SVM.
Quantum machine learning (QML) provides a transformative approach to data analysis by integrating the principles of quantum computing with classical machine learning methods. With the exponential growth of data and the increasing complexity of computational tasks, quantum algorithms offer tremendous advantages in terms of processing speed, memory efficiency, and the ability to resolve issues intractable for classical systems. In this work, the use of QML techniques for both supervised and unsupervised learning problems is explored. Quantum-enhanced models such Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs) show outstanding performance in classification and regression tasks by using quantum kernels and entanglement in supervised learning. Moreover, hybrid quantum-classical solutions offer useful implementations on noisy intermediate-scale quantum (NISQ) devices, hence bridging the gap between present quantum technology and practical uses. By means of comparative analysis, this paper emphasizes the possible benefits and drawbacks of QML, thereby providing understanding of its future importance in sectors including material science, finance, and healthcare. In the end, QML opens the path for a new era of intelligent data processing and solves until unthinkable difficult challenges.
Quantum computing holds significant potential to accelerate machine learning algorithms, especially in solving optimization problems like those encountered in Support Vector Machine (SVM) training. However, current QUBO-based Quantum SVM (QSVM) methods rely solely on binary optimal solutions, limiting their ability to identify fuzzy boundaries in data. Additionally, the limited qubit count in contemporary quantum devices constrains training on larger datasets. In this paper, we propose a probabilistic quantum SVM training framework suitable for Coherent Ising Machines (CIMs). By formulating the SVM training problem as a QUBO model, we leverage CIMs' energy minimization capabilities and introduce a Boltzmann distribution-based probabilistic approach to better approximate optimal SVM solutions, enhancing robustness. To address qubit limitations, we employ batch processing and multi-batch ensemble strategies, enabling small-scale quantum devices to train SVMs on larger datasets and support multi-class classification tasks via a one-vs-one approach. Our method is validated through simulations and real-machine experiments on binary and multi-class datasets. On the banknote binary classification dataset, our CIM-based QSVM, utilizing an energy-based probabilistic approach, achieved up to 20% higher accuracy compared to the original QSVM, while training up to 10410^4104 times faster than simulated annealing methods. Compared with classical SVM, our approach either matched or reduced training time. On the IRIS three-class dataset, our improved QSVM outperformed existing QSVM models in all key metrics. As quantum technology advances, increased qubit counts are expected to further enhance QSVM performance relative to classical SVM.
Anomaly detection, an important task in data analysis, involves identifying observations or events that deviate in some way from the rest of the data. Machine learning techniques have shown success in automating this process by detecting hidden patterns and deviations in large-scale data. The potential of quantum computing for machine learning has been widely recognized, leading to extensive research efforts to develop suitable quantum machine learning (QML) algorithms. In particular, the search for QML algorithms for near-term NISQ devices is in full swing. However, NISQ devices pose additional challenges due to their limited qubit coherence times, low number of qubits, and high error rates. Kernel methods based on quantum kernel estimation have emerged as a promising approach to QML on NISQ devices, offering theoretical guarantees, versatility, and compatibility with NISQ constraints. Especially support vector machines (SVM) utilizing quantum kernel estimation have shown success in various supervised learning tasks. However, in the context of anomaly detection, semisupervised learning is of great relevance, and yet there is limited research published in this area. This paper introduces an approach to semisupervised anomaly detection based on the reconstruction loss of a support vector regression (SVR) with quantum kernel. This novel model is an alternative to the variational quantum and quantum kernel one-class classifiers, and is compared to a quantum autoencoder as quantum baseline and a SVR with radial-basis-function (RBF) kernel as well as a classical autoencoder as classical baselines. The models are benchmarked extensively on 10 real-world anomaly detection data sets and one toy data set and it is shown that our SVR model with quantum kernel performs better than the SVR with RBF kernel as well as all other models, achieving highest mean AUC over all data sets. In addition, our QSVR outperforms the Quantum autoencoder on 9 out of 11 data sets.
Quantum Machine Learning is an active research field where the power of quantum mechanics is integrated into machine learning algorithms to solve problems that are intractable for classical computers. Quantum support vector machine (QSVM) was one of the first quantum algorithms that got implemented on real quantum hardware. It demonstrated promising outcomes as compared to classical Support vector machine (SVM) through many implementations. However, it encounters challenges in scaling with large datasets and in resource effectiveness when compare to the usage of innovative classical algorithms in the Noisy Intermediate Scale Quantum era. Here is a review of some latest developments of QSVM and discussion on prospects of QSVM application in the future.