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

IEEE International Conference on Information Systems and Computer Aided Education (ICISCAE)

Research on the Application of Quantum Annealing Algorithms in Multi-Task Modelling

Hong Zhang

Published Sep 27, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1109/iciscae66104.2025.11307355

Related papers

QUBO-Driven Quantum Annealing: A Unified Cloud-Scale Framework for Resource Forecasting, Classification, and Deep Learning Training

Yulian Song, Guozheng Zhao, Nan Wang +3 more

This paper proposes an integrated QUBO-based quantum-annealing optimization framework for next-generation cloud computing. First, for resource-demand forecasting, we blend Autoregressive (AR) models with Quadratic Unconstrained Binary Optimization (QUBO) and solve the resulting problem via Simulated Annealing; monthly-scale tests reveal superior trend-capture accuracy compared with classical predictors. Second, we embed quantum optimization into Support Vector Machines by casting kernel selection and penalty-parameter tuning as QUBO instances; evaluations on the Iris benchmark—and on synthetically enlarged variants—show marked gains in both classification accuracy and training speed, especially under large-data regimes. Third, we extend the same paradigm to deep learning: a QUBO-formulated quantum-annealing routine optimizes weight initialization and layer-wise learning rates in convolutional networks for image classification, yielding higher top-1 accuracy and reduced wall-clock training time. Across all tasks the hybrid quantum-classical solver consistently outperforms its classical counterparts while maintaining linear scalability in cloud environments. These results show the practical potential of quantum - enhanced algorithms for resource prediction, classification, and deep learning, and pave the way for wider use of quantum technologies in cloud - based AI services.

Applied and Computational Engineering•Aug 13, 2025•0 citations

Research on accelerated solution of SVM classification task based on quantum computing

teng zhang, Kai Li, Yao Fu +1 more

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.

International Conference on Electronic Information Engineering and Data Processing (EIEDP)•May 9, 2025•1 citation

Design and Optimization of Multimodal Hybrid Architectures Based on Quantum Computing

Siqi Liu

In this paper, a hybrid model framework based on quantum computing optimization is proposed for resource demand forecasting and data classification tasks. The study first constructs an AR model for demand forecasting, determines the lag order by PACF and ACF, and transforms the model parameters into QUBO form for optimization and solution after discretization. Secondly, for SVM classification, the penalty function method is adopted to transform the constraints into unconstrained optimization, and the QUBO model is constructed to achieve classification boundary optimization by discretizing the decision variables and introducing penalty function terms. Finally, in the field of deep learning, a parameter optimization method based on Adam's algorithm is proposed to construct a CNN model by combining the ReLU activation function, and the loss function is transformed into a QUBO matrix by parameter quantization technique, and the optimal parameter configurations are solved by using quantum computation. The results show that the framework achieves good results in both prediction accuracy and classification performance, providing a new solution for complex optimization situations.

Frontiers in Computing and Intelligent Systems•Apr 28, 2025•0 citations

Research on Machine Learning Optimization Algorithm Based on QUBO Model

Minyi Ye, Lanqing Wu, Guanquan Zhu +1 more

This paper deals with the research of QUBO model optimization machine learning algorithm, including the following: first, discretize the continuous parameters of the machine learning model into binary variables, and construct the QUBO objective function; then optimize the QUBO model by using the quantum annealing algorithm; and finally solve the globally optimal solution by adjusting the annealing parameters, which include the initial temperature, the coefficient of temperature reduction, and the number of iterations. QUBO model can discretize continuous variables (including parameters such as weights and bias) in AR, SVM, CNN and other models in machine learning into binary variables, so as to better deal with nonlinear relationships and reduce the computational complexity in the training process. With the QUBO model, the regularization term can be better controlled to avoid the overfitting problem. Meanwhile, the QUBO model can be solved in parallel by quantum computing or simulated annealing algorithm, which significantly improves the computational efficiency under large-scale data.

Frontiers in Computing and Intelligent Systems•Jun 26, 2025•0 citations

Multi-Task Quantum Annealing for Rapid Multi-Class Classification

Jargalsaikhan Artag, Moe Shimada, Jun‐ichi Shirakashi

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.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

A Collaborative Framework for Quantum Optimisation and Quantum Neural Networks: Credit Feature Selection and Image Classification

Long, JiaNing, Xuechen Liang

This paper investigates the efficacy of quantum computing in two distinct machine learning tasks: feature selection for credit risk assessment and image classification for handwritten digit recognition. For the first task, we address the feature selection challenge of the German Credit Dataset by formulating it as a Quadratic Unconstrained Binary Optimization (QUBO) problem, which is solved using quantum annealing to identify the optimal feature subset. Experimental results show that the resulting credit scoring model maintains high classification precision despite using a minimal number of features. For the second task, we focus on classifying handwritten digits 3 and 6 in the MNIST dataset using Quantum Neural Networks (QNNs). Through meticulous data preprocessing (downsampling, binarization), quantum encoding (FRQI and compressed FRQI), and the design of QNN architectures (CRADL and CRAML), we demonstrate that QNNs can effectively handle high-dimensional image data. Our findings highlight the potential of quantum computing in solving practical machine learning problems while emphasizing the need to balance resource expenditure and model efficacy.

arXiv:2509.11110•Sep 14, 2025•0 citations
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.
This paper proposes an integrated QUBO-based quantum-annealing optimization framework for next-generation cloud computing. First, for resource-demand forecasting, we blend Autoregressive (AR) models with Quadratic Unconstrained Binary Optimization (QUBO) and solve the resulting problem via Simulated Annealing; monthly-scale tests reveal superior trend-capture accuracy compared with classical predictors. Second, we embed quantum optimization into Support Vector Machines by casting kernel selection and penalty-parameter tuning as QUBO instances; evaluations on the Iris benchmark—and on synthetically enlarged variants—show marked gains in both classification accuracy and training speed, especially under large-data regimes. Third, we extend the same paradigm to deep learning: a QUBO-formulated quantum-annealing routine optimizes weight initialization and layer-wise learning rates in convolutional networks for image classification, yielding higher top-1 accuracy and reduced wall-clock training time. Across all tasks the hybrid quantum-classical solver consistently outperforms its classical counterparts while maintaining linear scalability in cloud environments. These results show the practical potential of quantum - enhanced algorithms for resource prediction, classification, and deep learning, and pave the way for wider use of quantum technologies in cloud - based AI services.
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.
In this paper, a hybrid model framework based on quantum computing optimization is proposed for resource demand forecasting and data classification tasks. The study first constructs an AR model for demand forecasting, determines the lag order by PACF and ACF, and transforms the model parameters into QUBO form for optimization and solution after discretization. Secondly, for SVM classification, the penalty function method is adopted to transform the constraints into unconstrained optimization, and the QUBO model is constructed to achieve classification boundary optimization by discretizing the decision variables and introducing penalty function terms. Finally, in the field of deep learning, a parameter optimization method based on Adam's algorithm is proposed to construct a CNN model by combining the ReLU activation function, and the loss function is transformed into a QUBO matrix by parameter quantization technique, and the optimal parameter configurations are solved by using quantum computation. The results show that the framework achieves good results in both prediction accuracy and classification performance, providing a new solution for complex optimization situations.
This paper deals with the research of QUBO model optimization machine learning algorithm, including the following: first, discretize the continuous parameters of the machine learning model into binary variables, and construct the QUBO objective function; then optimize the QUBO model by using the quantum annealing algorithm; and finally solve the globally optimal solution by adjusting the annealing parameters, which include the initial temperature, the coefficient of temperature reduction, and the number of iterations. QUBO model can discretize continuous variables (including parameters such as weights and bias) in AR, SVM, CNN and other models in machine learning into binary variables, so as to better deal with nonlinear relationships and reduce the computational complexity in the training process. With the QUBO model, the regularization term can be better controlled to avoid the overfitting problem. Meanwhile, the QUBO model can be solved in parallel by quantum computing or simulated annealing algorithm, which significantly improves the computational efficiency under large-scale data.
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 paper investigates the efficacy of quantum computing in two distinct machine learning tasks: feature selection for credit risk assessment and image classification for handwritten digit recognition. For the first task, we address the feature selection challenge of the German Credit Dataset by formulating it as a Quadratic Unconstrained Binary Optimization (QUBO) problem, which is solved using quantum annealing to identify the optimal feature subset. Experimental results show that the resulting credit scoring model maintains high classification precision despite using a minimal number of features. For the second task, we focus on classifying handwritten digits 3 and 6 in the MNIST dataset using Quantum Neural Networks (QNNs). Through meticulous data preprocessing (downsampling, binarization), quantum encoding (FRQI and compressed FRQI), and the design of QNN architectures (CRADL and CRAML), we demonstrate that QNNs can effectively handle high-dimensional image data. Our findings highlight the potential of quantum computing in solving practical machine learning problems while emphasizing the need to balance resource expenditure and model efficacy.