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

International Journal of Theoretical Physics

Quantum Support Vector Machine Based on Gradient Descent

Hong Li, Nan Jiang, Rui Zhang, Zichen Wang, Hailiang Wang

Published Mar 1, 2022• 11 citations
Publisher
DOI
10.1007/s10773-022-05040-x

Related papers

Quantum support vector machine based on regularized Newton method

Rui Zhang, Jian Wang, Nan Jiang +2 more

Neural Networks•Apr 11, 2022•38 citations

Optimizing Quantum Support Vector Machine (QSVM) Circuits Using Hybrid Quantum Natural Gradient Descent (QNGD) and Whale Optimization Algorithm (WOA)

Tamilselvan Arjunan, Gopalakrishnan Arjunan, N. Jagadish Kumar +1 more

This research endeavor centers on augmenting the quantum circuitry of the Quantum Support Vector Machine (QSVM), a pivotal algorithm in the realm of quantum machine learning, via a hybrid optimization methodology that amalgamates Quantum Natural Gradient Descent (QNGD) with the Whale Optimization Algorithm (WOA). QSVM harnesses the power of quantum computing to facilitate proficient classification within high-dimensional spaces; however, its efficacy is frequently compromised by suboptimal circuit parameters and quantum noise prevalent in near-term quantum devices. The proposed hybrid optimization paradigm integrates the global search proficiency of WOA with the effective parameter refinement capabilities of QNGD, culminating in expedited convergence (38 iterations), enhanced classification accuracy (96.8%), optimized circuit complexity (44 quantum gates), and increased resilience against noise (fidelity: 0.985). In comparison to conventional optimization techniques such as Differential Evolution (DE), Grey Wolf Optimizer (GWO), and Firefly Algorithm (FA), our methodology demonstrates superior efficacy by refining quantum kernel computation, entanglement configurations, and circuit depth, while concurrently alleviating the impacts of quantum noise.

International Conference for Emerging Technology (INCET)•May 23, 2025•2 citations

Quantum Kernel Alignment with Stochastic Gradient Descent

Gian Gentinetta, David Sutter, Christa Zoufal +2 more

Quantum support vector machines have the potential to achieve a quantum speedup for solving certain machine learning problems. The key challenge for doing so is finding good quantum kernels for a given data set - a task called kernel alignment. In this paper we study this problem using the Pegasos algorithm, which is an algorithm that uses stochastic gradient descent to solve the support vector machine optimization problem. We extend Pegasos to the quantum case and and demonstrate its effectiveness for kernel alignment. Unlike previous work which performs kernel alignment by training a QSVM within an outer optimization loop, we show that using Pegasos it is possible to simultaneously train the support vector machine and align the kernel. Our experiments show that this approach is capable of aligning quantum feature maps with high accuracy, and outperforms existing quantum kernel alignment techniques. Specifically, we demonstrate that Pegasos is particularly effective for non-stationary data, which is an important challenge in real-world applications.

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

Quantum machine learning for support vector machine classification

S. S. Kavitha, Narasimha Kaulgud

Evolutionary Intelligence•Jul 11, 2022•93 citations

Quantum support vector machines: theory and applications

Tianzhu Yin

Quantum Support Vector Machines (QSVMs) combine the fundamental principles of quantum computing and classical Support Vector Machines (SVMs) to improve machine learning performance. In this paper, the author will further explore QSVM. Firstly, introduce the basics of classical SVM, including hyperplane, margin, support vector, and kernel methods. Then, introduce the basic theories of quantum computing, including quantum bits, entanglement, quantum states, superposition, and some related quantum algorithms. Focuses on the concept of QSVM, quantum kernel methods, and how SVM runs on a quantum computer. Key topics include quantum state preparation, measurement, and output interpretation. Theoretical advantages of QSVMs, such as faster computation speed, stronger performance to process high-dimensional data, and kernal computation. In addition, the author discussed the implementation of QSVM, quantum algorithms, quantum gradient descent, and optimization techniques for SVM training. The article also discusses practical issues such as error mitigation and quantum hardware requirements. The purpose of this paper is to show the advantages of QSVM by comparing SVM and QSVM.

Theoretical and Natural Science•Nov 1, 2024•8 citations

Quantum support vector machine without iteration

Rui Zhang, Jian Wang, Nan Jiang +1 more

arXiv:2206.00909•Information Sciences•Mar 27, 2023•43 citations
This research endeavor centers on augmenting the quantum circuitry of the Quantum Support Vector Machine (QSVM), a pivotal algorithm in the realm of quantum machine learning, via a hybrid optimization methodology that amalgamates Quantum Natural Gradient Descent (QNGD) with the Whale Optimization Algorithm (WOA). QSVM harnesses the power of quantum computing to facilitate proficient classification within high-dimensional spaces; however, its efficacy is frequently compromised by suboptimal circuit parameters and quantum noise prevalent in near-term quantum devices. The proposed hybrid optimization paradigm integrates the global search proficiency of WOA with the effective parameter refinement capabilities of QNGD, culminating in expedited convergence (38 iterations), enhanced classification accuracy (96.8%), optimized circuit complexity (44 quantum gates), and increased resilience against noise (fidelity: 0.985). In comparison to conventional optimization techniques such as Differential Evolution (DE), Grey Wolf Optimizer (GWO), and Firefly Algorithm (FA), our methodology demonstrates superior efficacy by refining quantum kernel computation, entanglement configurations, and circuit depth, while concurrently alleviating the impacts of quantum noise.
Quantum support vector machines have the potential to achieve a quantum speedup for solving certain machine learning problems. The key challenge for doing so is finding good quantum kernels for a given data set - a task called kernel alignment. In this paper we study this problem using the Pegasos algorithm, which is an algorithm that uses stochastic gradient descent to solve the support vector machine optimization problem. We extend Pegasos to the quantum case and and demonstrate its effectiveness for kernel alignment. Unlike previous work which performs kernel alignment by training a QSVM within an outer optimization loop, we show that using Pegasos it is possible to simultaneously train the support vector machine and align the kernel. Our experiments show that this approach is capable of aligning quantum feature maps with high accuracy, and outperforms existing quantum kernel alignment techniques. Specifically, we demonstrate that Pegasos is particularly effective for non-stationary data, which is an important challenge in real-world applications.
Quantum Support Vector Machines (QSVMs) combine the fundamental principles of quantum computing and classical Support Vector Machines (SVMs) to improve machine learning performance. In this paper, the author will further explore QSVM. Firstly, introduce the basics of classical SVM, including hyperplane, margin, support vector, and kernel methods. Then, introduce the basic theories of quantum computing, including quantum bits, entanglement, quantum states, superposition, and some related quantum algorithms. Focuses on the concept of QSVM, quantum kernel methods, and how SVM runs on a quantum computer. Key topics include quantum state preparation, measurement, and output interpretation. Theoretical advantages of QSVMs, such as faster computation speed, stronger performance to process high-dimensional data, and kernal computation. In addition, the author discussed the implementation of QSVM, quantum algorithms, quantum gradient descent, and optimization techniques for SVM training. The article also discusses practical issues such as error mitigation and quantum hardware requirements. The purpose of this paper is to show the advantages of QSVM by comparing SVM and QSVM.