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 Conference on Methods and Models in Automation and Robotics

Quantum Computing-Driven Optimization of Machine Learning Algorithms for Embedded Systems

Michał Mańkowski, Bartosz Zwoliński, Arkadiusz Lewandowski, Antoni Stępień, Łukasz Grzymkowski, Tomasz P. Stefański

Published Aug 1, 2026• 0 citations
Publisher

Abstract

The development of quantum technologies opens new possibilities for the optimization of machine learning (ML) algorithms. In this contribution, we report on the experimental use of quantum computing for training ML algorithms and models designed to be deployed for inference on embedded systems with limited computational resources. Due to the small size of resource-efficient models for embedded systems, this application of quantum computing provides an excellent opportunity to evaluate a technology that is currently being developed in the noisy intermediate-scale quantum era. We develop an approach based on transforming classical supervised learning problems into a discrete form, enabling their solution using quantum annealing (QA) methods. Three models are presented: a binary XNORNet network, a support vector machine (SVM) with a discrete representation of dual coefficients, and a convolutional neural network. All experiments are performed on the MNIST dataset, using classical optimization methods, simulated annealing, and QA on the D-Wave Advantage system. While classical gradientbased methods maintain superior absolute accuracy (up to 95.97% for SVM), the D-Wave system demonstrates a significant reduction in core optimization time, achieving speedups of up to 15.6× compared to classical optimization on a central processing unit when the system overhead is excluded. Preliminary results suggest that while QA entails a slight accuracy and memory requirements penalty, a drastic reduction in active annealing duration serves as a promising strategy to reduce training latency in future embedded-focused ML applications.

DOI
10.1109/mmar70562.2026.11667844

Related papers

Quantum Optimization for Machine Learning

Asha Sohal, Ramesh Kait, Asha Sohal

The convergence of machine learning (ML) and quantum computing is quickly becoming a game-changing new frontier in computational science. The most intriguing area of overlap may be quantum optimization, which seeks to reduce the exponentially increasing complexity and computational cost of ML algorithms. As they grow larger and more complicated, traditional optimization methods, particularly in high-dimensional and non-convex space, will inevitably hit performance limits. Quantum optimization is the whole new paradigm that leverages quantum mechanical effects like superposition, entanglement, and tunnelling to explore solution spaces more efficiently. The chapter outlines the theory, practice, and potential of hybrid quantum-classical optimization algorithms for machine learning. The most brilliant research direction in the current NISQ (noisy intermediate-scale quantum) era is mixed systems leveraging classical computing capability augmented by quantum capacity. In such designs, computationally intensive subroutines like optimization for global optima or escape from local minima are left to quantum processors and data preprocessing, iterative refinement, and model testing are performed by classical processors. We start by defining the fundamental principles of quantum computing and acquainting readers with the fundamentals like qubits, quantum gates, and quantum circuits. These are the building blocks for quantum algorithms, which hopefully can be utilized for optimization, for example, the QAOA (quantum approximate optimization algorithm), the VQE (variational quantum Eigensolver), and quantum annealing. They all build to optimize the problems in some way differently: QAOA through parameterized quantum circuits, VQE through approximations of ground states of the Hamiltonians, and quantum annealing through quantum evolution to low-energy solutions. We then form a loop between these quantum algorithms and regular machine learning tasks. Optimization impacts virtually all ML phases, from training neural networks, where one reduces loss functions; feature selection, where one aims to discover the most relevant subset of input variables; and hyperparameter optimization, which often involves expensive search procedures over extremely large combinatorial spaces. Quantum optimization techniques can therefore, in principle, accelerate such procedures through computational complexity reduction and enhancing solutions over challenging landscapes. Realistic simulations and case studies emphasize the degree to which hybrid quantum-classical algorithms have been employed in solving ML problems, that is, QSVMs, quantum-enhanced clustering, and quantum reinforcement learning. Despite their experimental nature, these applications already show encouraging results in terms of improved performance metrics as well as reduction in time-to-solution compared to classical-only solutions. Notwithstanding that, this new field is not bereft of real challenges. Quantum hardware suffers from hard limits on qubit fidelity, decoherence, and scalability in the current times. Furthermore, quantum circuit integration into broad ML pipelines requires novel architectures and software platforms. As a counter to those issues, this chapter surveys recent advances in quantum programming languages, simulators, and hybrid platforms like PennyLane, Qiskit, and TensorFlow Quantum. We conclude by looking to the future possibility that quantum optimization will revolutionize the machine learning landscape. As hardware improves and algorithmic complexity increases, the possibility of quantum-powered learning systems solving hard problems becomes increasingly accessible. From speeding up deep network training to enabling new types of unsupervised learning, quantum optimization holds the potential to recast computational tractability in machine learning. This chapter is an all-encompassing introduction and state-of-the-art work for students, researchers, and practitioners interested in using quantum optimization for practical ML applications. It sets the foundation for understanding how to pursue hybrid approaches (how they may be applied today in the real world and bracing oneself for disruption in the future).

Auerbach Publications eBooks•Feb 24, 2026•0 citations

Quantum–inspired Methods for Training Machine Learning Models

Nilesh T. Fonseka, Anuradha Mahasinghe

Machine learning model training, which ultimately optimizes a model’s cost function is usually a time- consuming and computationally intensive process on classical computers. This has been more intense due to the in- creased demand for large-scale data analysis, requiring unconventional computing paradigms like quantum computing to enhance training efficiency. Adiabatic quantum computers have excelled at solving optimization problems, which require the quadratic unconstrained binary optimization (QUBO) format of the problem of interest. In this study, the squared error minimization in the multiple linear regression model is reformulated as a QUBO problem enabling it to be solved using D-wave adiabatic quantum computers. Same formulation was used to obtain a solution using gate-based algorithms such as quantum approximate optimization algorithm (QAOA) and sampling variational quantum eigensolver (VQE) im- plemented via IBM Qiskit. The results obtained through these approaches in the context of runtime and mean squared error(MSE) were analyzed and compared to the classical approaches. Our experimental results indicate a runtime ad- vantage in the D-wave annealing approach over the classical Scikit learn regression approach. The time advantage can be observed when N>524288 compared to Sklearn Linear Regression and when N>65536 compared to Sklearn SGDRegressor. Support vector machine induced neural networks, where the margin-based entropy loss is converted into a QUBO with Lagrangian approach is also focused in this study concerning the applicability for nonlinear models.

International Journal of Information Technology and Computer Science•Dec 2, 2025•1 citation

Quantum Machine Learning Approaches for Complex Optimization in Smart Computing Systems

Khaldun Pichlerová

Quantum Machine Learning (QML) has emerged as a transformative paradigm that integrates the computational advantages of quantum computing with the adaptive intelligence of machine learning to solve complex optimization problems in smart computing systems. Traditional optimization techniques often struggle with high-dimensional search spaces, combinatorial complexity, computational overhead, and scalability limitations in applications such as intelligent transportation, healthcare analytics, smart manufacturing, cybersecurity, cloud computing, and Internet of Things (IoT) infrastructures. QML approaches exploit quantum superposition, entanglement, and quantum parallelism to accelerate optimization tasks and enhance predictive performance beyond classical machine learning capabilities. This research proposes a hybrid Quantum Machine Learning optimization framework that combines Variational Quantum Circuits (VQCs), Quantum Neural Networks (QNNs), and classical deep learning models to address resource allocation, task scheduling, energy optimization, and intelligent decision-making in smart computing environments. The proposed framework integrates quantum-enhanced feature extraction, adaptive optimization layers, and reinforcement-based learning mechanisms to improve convergence speed and computational efficiency. Experimental analysis is performed using benchmark optimization datasets and simulated quantum environments to evaluate accuracy, execution time, energy efficiency, and scalability. Comparative results demonstrate that the proposed QML-based framework achieves superior optimization accuracy, reduced computational latency, and improved resource utilization when compared with traditional machine learning and classical metaheuristic optimization methods. Furthermore, the study highlights the practical significance of hybrid quantum-classical architectures in next-generation intelligent systems where large-scale optimization and real-time decision support are critical. The findings suggest that QML can significantly contribute to the advancement of sustainable, adaptive, and high-performance smart computing ecosystems while opening new directions for future quantum-aware intelligent infrastructures.

Multidisciplinary Journal of Research in Engineering and Technology•May 28, 2026•0 citations

Quantum-Inspired Optimization of Large-Scale Machine Learning Algorithms

Jincheng Zhang

Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.

•Sep 7, 2026•0 citations

Quantum Optimization, Machine Learning, Annealing, and Neural Networks

Pascal Halffmann, Shivam Kumar Sharma

This chapter investigates the application of quantum computing to optimization, a field traditionally dominated by classical methods but increasingly limited by computational demands in tackling complex, large-scale problems. The discussion focuses on quantum optimization techniques, particularly variational quantum algorithms like the Quantum Approximate Optimization Algorithm (QAOA) and the variational quantum eigensolver (VQE), along with quantum annealing (QA), a process inspired by physical annealing that leverages quantum tunnelling and superposition. The chapter also explores the integration of quantum approaches within machine learning frameworks, where quantum algorithms can potentially accelerate model training and enhance capabilities. Additionally, it presents practical applications and challenges associated with these quantum algorithms, covering their effectiveness on noisy intermediate-scale quantum (NISQ) devices and the evolving landscape of quantum hardware. This chapter concludes with insights into quantum optimization's future potential to address optimization and machine learning challenges that are currently intractable for classical methods, marking a significant shift in computational science.

CRC Press eBooks•Jan 14, 2025•7 citations

Quantum-Inspired Optimization of Large-Scale Machine Learning Models

Jincheng Zhang

The training of large-scale machine learning models presents significant computational challenges, primarily due to the inherent complexity of optimization algorithms like stochastic gradient descent (SGD) and its variants. These algorithms often struggle with convergence speed, getting trapped in local minima, and the ability to effectively explore the vast solution space. This paper investigates the potential of quantum-inspired optimization techniques to address these limitations. Specifically, we explore the application of quantum annealing and variational quantum eigensolver (VQE) approaches to accelerate the training and optimization process of large-scale machine learning models. Our core claim is that by mapping the optimization problem to a quantum system, we can leverage quantum computation to overcome the computational bottlenecks associated with classical optimization methods. We propose a framework where the objective function of the machine learning model is translated into a Hamiltonian for a quantum annealer or the cost function for a VQE, enabling a quantum-inspired solution. The results, while theoretical in this initial exploration, demonstrate a potential pathway for significantly reducing training times and improving the overall performance of large-scale machine learning models. Further research is needed to develop efficient hybrid quantum-classical algorithms and explore the practical limitations of this approach.

•Sep 6, 2026•0 citations
The development of quantum technologies opens new possibilities for the optimization of machine learning (ML) algorithms. In this contribution, we report on the experimental use of quantum computing for training ML algorithms and models designed to be deployed for inference on embedded systems with limited computational resources. Due to the small size of resource-efficient models for embedded systems, this application of quantum computing provides an excellent opportunity to evaluate a technology that is currently being developed in the noisy intermediate-scale quantum era. We develop an approach based on transforming classical supervised learning problems into a discrete form, enabling their solution using quantum annealing (QA) methods. Three models are presented: a binary XNORNet network, a support vector machine (SVM) with a discrete representation of dual coefficients, and a convolutional neural network. All experiments are performed on the MNIST dataset, using classical optimization methods, simulated annealing, and QA on the D-Wave Advantage system. While classical gradientbased methods maintain superior absolute accuracy (up to 95.97% for SVM), the D-Wave system demonstrates a significant reduction in core optimization time, achieving speedups of up to 15.6× compared to classical optimization on a central processing unit when the system overhead is excluded. Preliminary results suggest that while QA entails a slight accuracy and memory requirements penalty, a drastic reduction in active annealing duration serves as a promising strategy to reduce training latency in future embedded-focused ML applications.
The convergence of machine learning (ML) and quantum computing is quickly becoming a game-changing new frontier in computational science. The most intriguing area of overlap may be quantum optimization, which seeks to reduce the exponentially increasing complexity and computational cost of ML algorithms. As they grow larger and more complicated, traditional optimization methods, particularly in high-dimensional and non-convex space, will inevitably hit performance limits. Quantum optimization is the whole new paradigm that leverages quantum mechanical effects like superposition, entanglement, and tunnelling to explore solution spaces more efficiently. The chapter outlines the theory, practice, and potential of hybrid quantum-classical optimization algorithms for machine learning. The most brilliant research direction in the current NISQ (noisy intermediate-scale quantum) era is mixed systems leveraging classical computing capability augmented by quantum capacity. In such designs, computationally intensive subroutines like optimization for global optima or escape from local minima are left to quantum processors and data preprocessing, iterative refinement, and model testing are performed by classical processors. We start by defining the fundamental principles of quantum computing and acquainting readers with the fundamentals like qubits, quantum gates, and quantum circuits. These are the building blocks for quantum algorithms, which hopefully can be utilized for optimization, for example, the QAOA (quantum approximate optimization algorithm), the VQE (variational quantum Eigensolver), and quantum annealing. They all build to optimize the problems in some way differently: QAOA through parameterized quantum circuits, VQE through approximations of ground states of the Hamiltonians, and quantum annealing through quantum evolution to low-energy solutions. We then form a loop between these quantum algorithms and regular machine learning tasks. Optimization impacts virtually all ML phases, from training neural networks, where one reduces loss functions; feature selection, where one aims to discover the most relevant subset of input variables; and hyperparameter optimization, which often involves expensive search procedures over extremely large combinatorial spaces. Quantum optimization techniques can therefore, in principle, accelerate such procedures through computational complexity reduction and enhancing solutions over challenging landscapes. Realistic simulations and case studies emphasize the degree to which hybrid quantum-classical algorithms have been employed in solving ML problems, that is, QSVMs, quantum-enhanced clustering, and quantum reinforcement learning. Despite their experimental nature, these applications already show encouraging results in terms of improved performance metrics as well as reduction in time-to-solution compared to classical-only solutions. Notwithstanding that, this new field is not bereft of real challenges. Quantum hardware suffers from hard limits on qubit fidelity, decoherence, and scalability in the current times. Furthermore, quantum circuit integration into broad ML pipelines requires novel architectures and software platforms. As a counter to those issues, this chapter surveys recent advances in quantum programming languages, simulators, and hybrid platforms like PennyLane, Qiskit, and TensorFlow Quantum. We conclude by looking to the future possibility that quantum optimization will revolutionize the machine learning landscape. As hardware improves and algorithmic complexity increases, the possibility of quantum-powered learning systems solving hard problems becomes increasingly accessible. From speeding up deep network training to enabling new types of unsupervised learning, quantum optimization holds the potential to recast computational tractability in machine learning. This chapter is an all-encompassing introduction and state-of-the-art work for students, researchers, and practitioners interested in using quantum optimization for practical ML applications. It sets the foundation for understanding how to pursue hybrid approaches (how they may be applied today in the real world and bracing oneself for disruption in the future).
Machine learning model training, which ultimately optimizes a model’s cost function is usually a time- consuming and computationally intensive process on classical computers. This has been more intense due to the in- creased demand for large-scale data analysis, requiring unconventional computing paradigms like quantum computing to enhance training efficiency. Adiabatic quantum computers have excelled at solving optimization problems, which require the quadratic unconstrained binary optimization (QUBO) format of the problem of interest. In this study, the squared error minimization in the multiple linear regression model is reformulated as a QUBO problem enabling it to be solved using D-wave adiabatic quantum computers. Same formulation was used to obtain a solution using gate-based algorithms such as quantum approximate optimization algorithm (QAOA) and sampling variational quantum eigensolver (VQE) im- plemented via IBM Qiskit. The results obtained through these approaches in the context of runtime and mean squared error(MSE) were analyzed and compared to the classical approaches. Our experimental results indicate a runtime ad- vantage in the D-wave annealing approach over the classical Scikit learn regression approach. The time advantage can be observed when N>524288 compared to Sklearn Linear Regression and when N>65536 compared to Sklearn SGDRegressor. Support vector machine induced neural networks, where the margin-based entropy loss is converted into a QUBO with Lagrangian approach is also focused in this study concerning the applicability for nonlinear models.
Quantum Machine Learning (QML) has emerged as a transformative paradigm that integrates the computational advantages of quantum computing with the adaptive intelligence of machine learning to solve complex optimization problems in smart computing systems. Traditional optimization techniques often struggle with high-dimensional search spaces, combinatorial complexity, computational overhead, and scalability limitations in applications such as intelligent transportation, healthcare analytics, smart manufacturing, cybersecurity, cloud computing, and Internet of Things (IoT) infrastructures. QML approaches exploit quantum superposition, entanglement, and quantum parallelism to accelerate optimization tasks and enhance predictive performance beyond classical machine learning capabilities. This research proposes a hybrid Quantum Machine Learning optimization framework that combines Variational Quantum Circuits (VQCs), Quantum Neural Networks (QNNs), and classical deep learning models to address resource allocation, task scheduling, energy optimization, and intelligent decision-making in smart computing environments. The proposed framework integrates quantum-enhanced feature extraction, adaptive optimization layers, and reinforcement-based learning mechanisms to improve convergence speed and computational efficiency. Experimental analysis is performed using benchmark optimization datasets and simulated quantum environments to evaluate accuracy, execution time, energy efficiency, and scalability. Comparative results demonstrate that the proposed QML-based framework achieves superior optimization accuracy, reduced computational latency, and improved resource utilization when compared with traditional machine learning and classical metaheuristic optimization methods. Furthermore, the study highlights the practical significance of hybrid quantum-classical architectures in next-generation intelligent systems where large-scale optimization and real-time decision support are critical. The findings suggest that QML can significantly contribute to the advancement of sustainable, adaptive, and high-performance smart computing ecosystems while opening new directions for future quantum-aware intelligent infrastructures.
Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.
This chapter investigates the application of quantum computing to optimization, a field traditionally dominated by classical methods but increasingly limited by computational demands in tackling complex, large-scale problems. The discussion focuses on quantum optimization techniques, particularly variational quantum algorithms like the Quantum Approximate Optimization Algorithm (QAOA) and the variational quantum eigensolver (VQE), along with quantum annealing (QA), a process inspired by physical annealing that leverages quantum tunnelling and superposition. The chapter also explores the integration of quantum approaches within machine learning frameworks, where quantum algorithms can potentially accelerate model training and enhance capabilities. Additionally, it presents practical applications and challenges associated with these quantum algorithms, covering their effectiveness on noisy intermediate-scale quantum (NISQ) devices and the evolving landscape of quantum hardware. This chapter concludes with insights into quantum optimization's future potential to address optimization and machine learning challenges that are currently intractable for classical methods, marking a significant shift in computational science.
The training of large-scale machine learning models presents significant computational challenges, primarily due to the inherent complexity of optimization algorithms like stochastic gradient descent (SGD) and its variants. These algorithms often struggle with convergence speed, getting trapped in local minima, and the ability to effectively explore the vast solution space. This paper investigates the potential of quantum-inspired optimization techniques to address these limitations. Specifically, we explore the application of quantum annealing and variational quantum eigensolver (VQE) approaches to accelerate the training and optimization process of large-scale machine learning models. Our core claim is that by mapping the optimization problem to a quantum system, we can leverage quantum computation to overcome the computational bottlenecks associated with classical optimization methods. We propose a framework where the objective function of the machine learning model is translated into a Hamiltonian for a quantum annealer or the cost function for a VQE, enabling a quantum-inspired solution. The results, while theoretical in this initial exploration, demonstrate a potential pathway for significantly reducing training times and improving the overall performance of large-scale machine learning models. Further research is needed to develop efficient hybrid quantum-classical algorithms and explore the practical limitations of this approach.