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

Acta Physica Sinica

A support vector machine training scheme based on quantum circuits

Yijun Zhang, Xiao-Dong Mu, Le-Meng Guo, Peng Zhang, Dao Zhao, Wen-Hua Bai

Published Jan 1, 2023• 0 citations
Publisher

Abstract

In order to improve the training efficiency of the support vector machine, a quantum circuit training scheme based on the inner product of the quantum state for the support vector machine is proposed in this work. Firstly, on the basis of the full analysis of the computational complexity of the classical support vector machine, the kernel function which is the main factor affecting the computational complexity of the algorithm is primarily analyzed. Based on quantum mechanics and quantum computing theory, the training sample elements in the kernel function are quantized to generate the corresponding quantum states. Secondly, according to the quantum states of the training sample elements, the types and quantities of the required quantum logic gates are derived and calculated, and the quantum circuit that can generate the corresponding quantum states of the training sample elements through the evolution of the quantum initial ground states and the quantum logic gates is designed. Then, in the light of the relationship between the inner product of the quantum state and the quantum logic gate SWAP, the quantum circuit is designed to complete the exchange operation of the corresponding quantum state amplitude. The inner product of the quantum state is realized by exchanging and evolving the amplitude of the quantum state in the quantum circuit. Finally, by measuring the quantum state of the controlling qubit, the inner product solution of the kernel function is obtained, and the acceleration effect of training support vector machine is realized. The verification results show that the scheme enables the support vector machine not only to complete the correct classification, but also to operate the quantum part of the scheme on the real quantum computer . Compared with the classical algorithm, the scheme reduces the time complexity of the algorithm for the polynomial degree, greatly shortens the training time of the model, and improves the efficiency of the algorithm. The scheme has certain feasibility, effectiveness and innovation, and expands the training idea of the support vector machine.

DOI
10.7498/aps.72.20222003

Related papers

Research on Quantum Computing Acceleration of Support Vector Machines in Multi-dimensional Nonlinear Feature Spaces

Haozhe Liu

The current development of Support Vector Machines (SVM) has reached a bottleneck, with issues such as long training times and weak interpretability when dealing with large-scale, multi-dimensional data. This paper introduces the concept of Quantum Support Vector Machines (QSVM) and achieves efficient solutions through quantum algorithms such as the HHL algorithm. The research designs a computational architecture that combines classical and quantum computing, utilizing the Pauli decomposition of Hermitian matrices to simulate the quantum simulation of Hamiltonian quantities and implementing the quantum simulation of unitary operators. Based on the conclusions, a complete quantum linear solver circuit is designed, achieving exponential growth in computational complexity. Experiments using the Iris dataset demonstrate the excellent classification performance of QSVM, which outperform classical SVM in classification accuracy, computational time complexity, and memory requirements. More efficient quantum mapping algorithms and quantum circuit optimization methods are implemented, providing new ideas and methods for the application of SVM to large-scale datasets.

Applied and Computational Engineering•Nov 25, 2024•5 citations

Quantum Support Vector Machine for 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 binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.

arXiv:1307.0471•Physical Review Letters•Sep 25, 2014•1,951 citations

The complexity of quantum support vector machines

Gian Gentinetta, Arne Thomsen, David Sutter +1 more

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models corresponds to solving a convex optimization problem either via its primal or dual formulation. Due to the probabilistic nature of quantum mechanics, the training algorithms are affected by statistical uncertainty, which has a major impact on their complexity. We show that the dual problem can be solved in O ( M 4.67 / ε 2 ) quantum circuit evaluations, where M denotes the size of the data set and ε the solution accuracy compared to the ideal result from exact expectation values, which is only obtainable in theory. We prove under an empirically motivated assumption that the kernelized primal problem can alternatively be solved in O ( min { M 2 / ε 6 , 1 / ε 10 } ) evaluations by employing a generalization of a known classical algorithm called Pegasos. Accompanying empirical results demonstrate these analytical complexities to be essentially tight. In addition, we investigate a variational approximation to quantum support vector machines and show that their heuristic training achieves considerably better scaling in our experiments.

arXiv:2203.00031•Quantum•Jan 11, 2024•65 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.

•Aug 6, 2024•0 citations

Variational quantum approximate support vector machine with inference transfer

Siheon Park, Daniel K. Park, June‐Koo Kevin Rhee

Abstract A kernel-based quantum classifier is the most interesting and powerful quantum machine learning technique for hyperlinear classification of complex data, which can be easily realized in shallow-depth quantum circuits such as a SWAP test classifier. A variational quantum approximate support vector machine (VQASVM) can be realized inherently and explicitly on these circuits by introduction of a variational scheme to map the quadratic optimization problem of the support vector machine theory to a quantum-classical variational optimization problem. Probability weight modulation in index qubits of a classifier can designate support vectors among training vectors, which can be achieved with a parameterized quantum circuit (PQC). The classical parameters of PQC is then transferred to many copies of other decision inference circuits. Our VQASVM algorithm is experimented with toy example data sets on cloud-based quantum machines for feasibility evaluation, and numerically investigated to evaluate its performance on a standard iris flower and MNIST data set. The empirical run-time complexity of VQASVM is estimated to be sub-quadratic on the training data set size, while that of the classical solver is quadratic.

arXiv:2206.14507•Scientific Reports•Feb 25, 2023•36 citations

Quantum Machine Learning in Feature Hilbert Spaces

Maria Schuld, Nathan Killoran

A basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely, to efficiently perform computations in an intractably large Hilbert space. In this Letter we explore some theoretical foundations of this link and show how it opens up a new avenue for the design of quantum machine learning algorithms. We interpret the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space. A quantum computer can now analyze the input data in this feature space. Based on this link, we discuss two approaches for building a quantum model for classification. In the first approach, the quantum device estimates inner products of quantum states to compute a classically intractable kernel. The kernel can be fed into any classical kernel method such as a support vector machine. In the second approach, we use a variational quantum circuit as a linear model that classifies data explicitly in Hilbert space. We illustrate these ideas with a feature map based on squeezing in a continuous-variable system, and visualize the working principle with two-dimensional minibenchmark datasets.

arXiv:1803.07128•Physical Review Letters•Feb 1, 2019•1,856 citations
In order to improve the training efficiency of the support vector machine, a quantum circuit training scheme based on the inner product of the quantum state for the support vector machine is proposed in this work. Firstly, on the basis of the full analysis of the computational complexity of the classical support vector machine, the kernel function which is the main factor affecting the computational complexity of the algorithm is primarily analyzed. Based on quantum mechanics and quantum computing theory, the training sample elements in the kernel function are quantized to generate the corresponding quantum states. Secondly, according to the quantum states of the training sample elements, the types and quantities of the required quantum logic gates are derived and calculated, and the quantum circuit that can generate the corresponding quantum states of the training sample elements through the evolution of the quantum initial ground states and the quantum logic gates is designed. Then, in the light of the relationship between the inner product of the quantum state and the quantum logic gate SWAP, the quantum circuit is designed to complete the exchange operation of the corresponding quantum state amplitude. The inner product of the quantum state is realized by exchanging and evolving the amplitude of the quantum state in the quantum circuit. Finally, by measuring the quantum state of the controlling qubit, the inner product solution of the kernel function is obtained, and the acceleration effect of training support vector machine is realized. The verification results show that the scheme enables the support vector machine not only to complete the correct classification, but also to operate the quantum part of the scheme on the real quantum computer . Compared with the classical algorithm, the scheme reduces the time complexity of the algorithm for the polynomial degree, greatly shortens the training time of the model, and improves the efficiency of the algorithm. The scheme has certain feasibility, effectiveness and innovation, and expands the training idea of the support vector machine.
The current development of Support Vector Machines (SVM) has reached a bottleneck, with issues such as long training times and weak interpretability when dealing with large-scale, multi-dimensional data. This paper introduces the concept of Quantum Support Vector Machines (QSVM) and achieves efficient solutions through quantum algorithms such as the HHL algorithm. The research designs a computational architecture that combines classical and quantum computing, utilizing the Pauli decomposition of Hermitian matrices to simulate the quantum simulation of Hamiltonian quantities and implementing the quantum simulation of unitary operators. Based on the conclusions, a complete quantum linear solver circuit is designed, achieving exponential growth in computational complexity. Experiments using the Iris dataset demonstrate the excellent classification performance of QSVM, which outperform classical SVM in classification accuracy, computational time complexity, and memory requirements. More efficient quantum mapping algorithms and quantum circuit optimization methods are implemented, providing new ideas and methods for the application of SVM to large-scale datasets.
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 binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.
Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models corresponds to solving a convex optimization problem either via its primal or dual formulation. Due to the probabilistic nature of quantum mechanics, the training algorithms are affected by statistical uncertainty, which has a major impact on their complexity. We show that the dual problem can be solved in O ( M 4.67 / ε 2 ) quantum circuit evaluations, where M denotes the size of the data set and ε the solution accuracy compared to the ideal result from exact expectation values, which is only obtainable in theory. We prove under an empirically motivated assumption that the kernelized primal problem can alternatively be solved in O ( min { M 2 / ε 6 , 1 / ε 10 } ) evaluations by employing a generalization of a known classical algorithm called Pegasos. Accompanying empirical results demonstrate these analytical complexities to be essentially tight. In addition, we investigate a variational approximation to quantum support vector machines and show that their heuristic training achieves considerably better scaling in our experiments.
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 A kernel-based quantum classifier is the most interesting and powerful quantum machine learning technique for hyperlinear classification of complex data, which can be easily realized in shallow-depth quantum circuits such as a SWAP test classifier. A variational quantum approximate support vector machine (VQASVM) can be realized inherently and explicitly on these circuits by introduction of a variational scheme to map the quadratic optimization problem of the support vector machine theory to a quantum-classical variational optimization problem. Probability weight modulation in index qubits of a classifier can designate support vectors among training vectors, which can be achieved with a parameterized quantum circuit (PQC). The classical parameters of PQC is then transferred to many copies of other decision inference circuits. Our VQASVM algorithm is experimented with toy example data sets on cloud-based quantum machines for feasibility evaluation, and numerically investigated to evaluate its performance on a standard iris flower and MNIST data set. The empirical run-time complexity of VQASVM is estimated to be sub-quadratic on the training data set size, while that of the classical solver is quadratic.
A basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely, to efficiently perform computations in an intractably large Hilbert space. In this Letter we explore some theoretical foundations of this link and show how it opens up a new avenue for the design of quantum machine learning algorithms. We interpret the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space. A quantum computer can now analyze the input data in this feature space. Based on this link, we discuss two approaches for building a quantum model for classification. In the first approach, the quantum device estimates inner products of quantum states to compute a classically intractable kernel. The kernel can be fed into any classical kernel method such as a support vector machine. In the second approach, we use a variational quantum circuit as a linear model that classifies data explicitly in Hilbert space. We illustrate these ideas with a feature map based on squeezing in a continuous-variable system, and visualize the working principle with two-dimensional minibenchmark datasets.