Research on accelerated solution of SVM classification task based on quantum computing
Classification is a fundamental task in machine learning that aims to categorize input samples into predefined classes based on their features. It has widespread applications in areas such as spam detection and image classification. Support Vector Machines (SVM) are a widely-used supervised learning method that seeks to maximize the margin between decision boundaries, particularly excelling in non-linear classification tasks through kernel functions. In this study, the SVM classification problem is reformulated as an optimization problem and represented using Quadratic Unconstrained Binary Optimization (QUBO) to leverage quantum computing for solving. To enhance the solution process, the simulated annealing algorithm is employed, improving convergence speed and boosting both the efficiency and performance of the classification task.
Authors
- Teng Zhang (ORCID: https://orcid.org/0000-0002-5310-8766)
- Kai Li (ORCID: https://orcid.org/0000-0001-5436-4836)
- Fei Xue (ORCID: https://orcid.org/0000-0002-2305-9334)
- Y. Fu (ORCID: https://orcid.org/0000-0002-7370-7395)
Institutions
- Beijing Wuzi University (CN)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1117/12.3066924
- Primary Topic
- Computational Physics and Python Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00