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

arXiv:2001.01400 · Scientific Reports

Model Predictive Control for Finite Input Systems using the D-Wave Quantum Annealer

Daisuke Inoue, Hiroaki Yoshida

Published Jan 31, 2020• 42 citations
arXivHTMLPDF

Abstract

The D-Wave quantum annealer has emerged as a novel computational architecture that is attracting significant interest, but there have been only a few practical algorithms exploiting the power of quantum annealers. Here we present a model predictive control (MPC) algorithm using a quantum annealer for a system allowing a finite number of input values. Such an MPC problem is classified as a non-deterministic polynomial-time-hard combinatorial problem, and thus real-time sequential optimization is difficult to obtain with conventional computational systems. We circumvent this difficulty by converting the original MPC problem into a quadratic unconstrained binary optimization problem, which is then solved by the D-Wave quantum annealer. Two practical applications, namely stabilization of a spring-mass-damper system and dynamic audio quantization, are demonstrated. For both, the D-Wave method exhibits better performance than the classical simulated annealing method. Our results suggest new applications of quantum annealers in the direction of dynamic control problems.

DOI
10.1038/s41598-020-58081-9

Related papers

Quantum-Optimized Control of the Inverted-Pendulum System

George T. Stamatiou, Kostas Magoutis

Model Predictive Control (MPC) requires solving an optimization problem at every control step, and this perstep optimization becomes the bottleneck as the horizon grows. We investigate whether Quantum Annealing (QA) is a practical solver for this problem, using the inverted pendulum as a benchmark. We translate the MPC cost function into Quadratic Unconstrained Binary Optimization (QUBO) form, deploy it on a D-Wave quantum annealer, and benchmark four solvers (Gurobi, Simulated Annealing, hybrid, and QA) on both solution quality and a wall-clock decomposition (QPU access, service, communication, and minor-embedding time). We further characterize the minor embedding of the resulting clique graph on the QPU topology. The QA-based controller tracks the reference effectively, though with higher variance than the classical baselines. The dominant cost is cloud communication and queueing, not annealing itself. We discuss what these results imply for real-time hybrid quantum-classical control.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2026•0 citations

Solving Combinatorial Optimization Problems on a D-Wave Quantum Annealer and Development of Higher Level Hardware Abstraction Layers

Julian Hatzky

The area of quantum computing is a relatively new and promising branch of computation that hopes to provide help especially in the field of non-deterministic polynomial hard problems. Due to the fact that quantum computers are a heuristically non-binary approach to computation, based on the effects of quantum mechanics, a bunch of advantages and disadvantages come with it. The following work focuses especially on so-called quantum annealers, a special architecture of quantum computers that one can see as an application-specific unit that is using certain quantum mechanical effects to target binary quadratic optimization problems of the class of non-deterministic polynomial-time problems and tries to solve them faster than classical computers can do. Because this is a whole new area, it lacks extensive software support which is addressed in this work. Hence the majority of the thesis aims to develop and extend software that enables users to solve problem instances on a quantum annealer fast and reliable. Furthermore, the necessary steps to solve combinatorial optimization problems are explained and the necessary background of quantum physics theory is given. In conclusion, the main question of this work can be described as follows: 'Is it possible to create an automated pipeline to solve problems on a D-Wave Systems n.d. quantum annealer?'.

•May 3, 2021•1 citation

Towards Quantum Computing: Solving Satisfiability Problem by Quantum Annealing

Juexiao Su

To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.

•Jan 1, 2018•4 citations

Model Predictive Control of Internet Servers using Quantum Annealing

Efthymios Papageorgiou, George T. Stamatiou, Kostas Magoutis

Internet servers must adapt rapidly to workload or configuration changes. Optimal control-based approaches like Model Predictive Control (MPC) offer proactive adaptation but present challenges, including the need to take into account reconfiguration features of modern server architectures and the computation cost of the MPC optimization problem. This work examines these challenges using the Apache HTTP Server’s graceful restart for dynamic reconfiguration. We solve the MPC optimization problem using both classical and quantum optimization solutions, comparing their effectiveness. Evaluating our MPC implementation on Apache HTTP Server with classical and quantum annealing-based (QA) D-Wave quantum hardware, our results show that QA-based solutions lead to an effective MPC controller, similar to classical optimization with appropriate tuning. As problem complexity and integration with quantum computers increase, QA-based solutions are expected to outperform classical alternatives for dynamic control.

IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)•Sep 16, 2024•1 citation

Quantum Artificial Intelligence for Natural Language Processing Applications

Ramin Ayanzadeh

Natural Language Processing and Semantic Web include several NP complete/hard problems that are intractable for classical computing machines. Even though distributed computing has provided remarkable advances (more precisely in dealing with big data), non-decomposable NP problems are still intractable in many real-world applications. And, from quantum computing perspective, solving complex problems with universal quantum gates requires developing of quantum algorithms. Considering commercializing quantum annealing machines by D-Wave, achieving global optimum for discrete optimization problems has been realized. In this study, a novel approach has been introduced to convert symbolic AI problems into quadratic unconstrained binary optimization (QUBO) form. More narrowly, this method represents classification of text documents (fragments) as optimizing a QUBO function. After embedding the train corpus into a QUBO function, D-Wave quantum annealer is used to classify new observations with finding the minimum energy level of the system.

ACM Technical Symposium on Computer Science Education (SIGCSE)•Feb 21, 2018•2 citations

Solving the Traveling Salesman Problem on the D-Wave Quantum Computer

Siddharth Jain

The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem. Results of practical experiments are also presented using D-Wave’s 5,000 qubit Advantage 1.1 quantum annealer and the performance is compared to a classical solver. It is found the quantum annealer can only handle a problem size of 8 or less nodes and its performance is subpar compared to the classical solver both in terms of time and accuracy.

Frontiers in Physics•Nov 12, 2021•56 citations
The D-Wave quantum annealer has emerged as a novel computational architecture that is attracting significant interest, but there have been only a few practical algorithms exploiting the power of quantum annealers. Here we present a model predictive control (MPC) algorithm using a quantum annealer for a system allowing a finite number of input values. Such an MPC problem is classified as a non-deterministic polynomial-time-hard combinatorial problem, and thus real-time sequential optimization is difficult to obtain with conventional computational systems. We circumvent this difficulty by converting the original MPC problem into a quadratic unconstrained binary optimization problem, which is then solved by the D-Wave quantum annealer. Two practical applications, namely stabilization of a spring-mass-damper system and dynamic audio quantization, are demonstrated. For both, the D-Wave method exhibits better performance than the classical simulated annealing method. Our results suggest new applications of quantum annealers in the direction of dynamic control problems.
Model Predictive Control (MPC) requires solving an optimization problem at every control step, and this perstep optimization becomes the bottleneck as the horizon grows. We investigate whether Quantum Annealing (QA) is a practical solver for this problem, using the inverted pendulum as a benchmark. We translate the MPC cost function into Quadratic Unconstrained Binary Optimization (QUBO) form, deploy it on a D-Wave quantum annealer, and benchmark four solvers (Gurobi, Simulated Annealing, hybrid, and QA) on both solution quality and a wall-clock decomposition (QPU access, service, communication, and minor-embedding time). We further characterize the minor embedding of the resulting clique graph on the QPU topology. The QA-based controller tracks the reference effectively, though with higher variance than the classical baselines. The dominant cost is cloud communication and queueing, not annealing itself. We discuss what these results imply for real-time hybrid quantum-classical control.
The area of quantum computing is a relatively new and promising branch of computation that hopes to provide help especially in the field of non-deterministic polynomial hard problems. Due to the fact that quantum computers are a heuristically non-binary approach to computation, based on the effects of quantum mechanics, a bunch of advantages and disadvantages come with it. The following work focuses especially on so-called quantum annealers, a special architecture of quantum computers that one can see as an application-specific unit that is using certain quantum mechanical effects to target binary quadratic optimization problems of the class of non-deterministic polynomial-time problems and tries to solve them faster than classical computers can do. Because this is a whole new area, it lacks extensive software support which is addressed in this work. Hence the majority of the thesis aims to develop and extend software that enables users to solve problem instances on a quantum annealer fast and reliable. Furthermore, the necessary steps to solve combinatorial optimization problems are explained and the necessary background of quantum physics theory is given. In conclusion, the main question of this work can be described as follows: 'Is it possible to create an automated pipeline to solve problems on a D-Wave Systems n.d. quantum annealer?'.
To date, conventional computers have never been able to efficiently handle certain tasks, where the number of computation steps is likely to blow up as the problem size increases. As an emerging technology and new computing paradigm, quantum computing has a great potential to tackle those hard tasks efficiently. Among all the existing quantum computation models, quantum annealing has drawn significant attention in recent years due to the realization of the commercialized quantum annealer, sparking research interests in developing applications to solve problems that are intractable for classical computers.However, designing and implementing algorithms that manage to harness the enormous computation power from quantum annealer remains a challenging task. Generally, it requires mapping of the given optimization problem into quadratic unconstrained binary optimization(QUBO) problem and embedding the subsequent QUBO onto the physical architecture of quantum annealer. Additionally, practical quantum annealers are susceptible to errors leading to low probability of the correct solution.In this study, we focus on solving Boolean satisfiability (SAT) problem using quantum annealer while addressing practical limitations. We have proposed a mapping technique that maps SAT problem to QUBO, and we have further devised a tool flow that embeds the QUBO onto the architecture of a quantum annealing device. Additionally, We have optimized the proposed embedding flow to reduce run-time in addition to shortening the qubit chain length, leading to robust quantum annealing. To further improve the reliability of quantum annealing, we have also developed a post processing embedding technique that enlarges the energy gap between ground state and the first excited state. To demonstrate the effectiveness of proposed methods, we have conducted experiments on real quantum annealing devices manufactured by D-Wave Systems, showing compelling result of using quantum annealer to solve SAT problem.
Internet servers must adapt rapidly to workload or configuration changes. Optimal control-based approaches like Model Predictive Control (MPC) offer proactive adaptation but present challenges, including the need to take into account reconfiguration features of modern server architectures and the computation cost of the MPC optimization problem. This work examines these challenges using the Apache HTTP Server’s graceful restart for dynamic reconfiguration. We solve the MPC optimization problem using both classical and quantum optimization solutions, comparing their effectiveness. Evaluating our MPC implementation on Apache HTTP Server with classical and quantum annealing-based (QA) D-Wave quantum hardware, our results show that QA-based solutions lead to an effective MPC controller, similar to classical optimization with appropriate tuning. As problem complexity and integration with quantum computers increase, QA-based solutions are expected to outperform classical alternatives for dynamic control.
Natural Language Processing and Semantic Web include several NP complete/hard problems that are intractable for classical computing machines. Even though distributed computing has provided remarkable advances (more precisely in dealing with big data), non-decomposable NP problems are still intractable in many real-world applications. And, from quantum computing perspective, solving complex problems with universal quantum gates requires developing of quantum algorithms. Considering commercializing quantum annealing machines by D-Wave, achieving global optimum for discrete optimization problems has been realized. In this study, a novel approach has been introduced to convert symbolic AI problems into quadratic unconstrained binary optimization (QUBO) form. More narrowly, this method represents classification of text documents (fragments) as optimizing a QUBO function. After embedding the train corpus into a QUBO function, D-Wave quantum annealer is used to classify new observations with finding the minimum energy level of the system.
The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem. Results of practical experiments are also presented using D-Wave’s 5,000 qubit Advantage 1.1 quantum annealer and the performance is compared to a classical solver. It is found the quantum annealer can only handle a problem size of 8 or less nodes and its performance is subpar compared to the classical solver both in terms of time and accuracy.