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.
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.
Abstract Support vector machine (SVM) is a powerful supervised machine learning model that is often used in binary classification algorithms. As Moore’s Law approaches its theoretical limits and the demand for machine learning to handle large-scale, high-dimensional data analysis intensifies, the necessity of adopting non-traditional computational approaches becomes evident. Quantum computing, in particular, emerges as a vital solution for the effective training of SVM models, providing capabilities beyond those of classical computing systems. To solve the above problems, a QUBO (quadratic unconstrained binary optimization) model is proposed to transform the SVM machine learning model into a quadratic unconstrained binary optimization problem so that they can be effectively trained on the D-Wave platform using adiabatic quantum computer. The results show that the QUBO model can transform the SVM model into a simple quadratic programming problem, which makes it suitable for adiabatic quantum computer processing. When processing large-scale and high-dimensional data, this transformation shows a natural advantage and significantly improves computational efficiency. The application potential of this transformation technology is huge in the medical field.
The Support Vector Machine (SVM) is a well-known supervised machine learning approach aimed at facing classification problems. Thanks to the exploitation of kernel functions, SVM succeeds to address also complex classification tasks involving non-linearly separable data. However, there are limitations to its success when the feature space becomes large, and the kernel functions become computationally expensive to estimate. Quantum-enhanced Support Vector Machine (QSVM) utilizes the properties of quantum computers to obtain an exponential speed up with respect to the conventional SVM by using the quantum state space as the feature space. Unfortunately, to benefit from these advantages, currently, it is necessary to have a background knowledge about quantum computing concepts and specific language skills. The goal of this paper is to introduce a web-based tool to make simple to all researchers, coming from several and heterogeneous scientific backgrounds, the application of QSVM to different real-world classification problems. To achieve this goal, the presented web tool involves data preprocessing techniques and a user-friendly interface. The suitability of the presented web tool is shown in an experimental session where QSVM is applied to solve well-known classification tasks.
This study focuses on the integration of quantum computing and artificial intelligence, proposing a multi-task optimisation framework based on the quantum annealing algorithm to address the bottlenecks in computational efficiency and model optimisation in traditional machine learning. The study converts problems such as time series prediction, Support Vector Machine (SVM) classification, and Convolutional Neural Network (CNN) training into Quadratic Unconstrained Binary Optimisation (QUBO) models and achieves parameter optimisation through the simulated annealing algorithm. In time series prediction, an autoregressive model is constructed based on historical data. The problem of minimising prediction error is mapped to a binary optimisation problem through QUBO transformation, and the model parameters are solved using the simulated annealing algorithm to achieve trend prediction of the target variable, validating the effectiveness of quantum optimisation in time series analysis. For classification tasks, the hinge loss and regularisation terms of SVM are converted into a QUBO matrix to optimise the classification hyperplane parameters, thereby enhancing the model's classification performance in the feature space. The results demonstrate that this method exhibits strong geometric interpretability and generalisation capabilities in binary classification problems. In the field of deep learning, L2 regularisation is introduced into the weight optimisation of CNNs, and a QUBO model is constructed to explore the application of quantum optimisation in image feature extraction and network training. Although limited by the scale of variables, this demonstrates the potential value of combining quantum computing with deep learning. The study shows that the quantum optimisation framework can effectively improve solution efficiency in small- to medium-scale problems, providing new technical pathways for time series analysis, classification tasks, and deep learning optimisation.
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 104 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.
Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.
This work presents a fully quantum approach to support vector machine (SVM) learning by integrating gate-based quantum kernel methods with quantum annealing-based optimization. We explore the construction of quantum kernels using various feature maps and qubit configurations, evaluating their suitability through Kernel-Target Alignment (KTA). The SVM dual problem is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling its solution via quantum annealers. Our experiments demonstrate that a high degree of alignment in the kernel and an appropriate regularization parameter lead to competitive performance, with the best model achieving an F1-score of 90%. These results highlight the feasibility of an end-to-end quantum learning pipeline and the potential of hybrid quantum architectures in quantum high-performance computing (QHPC) contexts.