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.
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.
Adaptive computing systems must react to workload and configuration shifts under hard constraints such as capacity limits, stability, and reconfiguration costs. Model Predictive Control (MPC) provides a principled framework by repeatedly solving a finite-horizon optimization problem online, but MPC's runtime optimization can become the bottleneck as horizon length and discrete decision spaces grow. In recent works we expressed discrete-time MPC optimization as a QUBO problem which is solved via classical and quantum methods. This poster paper synthesizes two complementary case studies, a simulated tandem queueing model controlled via buffer tuning and a running Apache HTTP server controlled by tuning the number of concurrent users in the system, showing tradeoffs that determine feasibility in real-time control loops.
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.
Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.
Buildings contribute to more than 70% of overall U.S. electricity usage and greenhouse gas emissions. The future building control optimizes more connected devices and renewable energy equipment, which requires a rapid and accurate response. It also poses the challenge of solving non-linear problems with discrete variables in real time. In one study, we developed a novel optimization using quantum annealing for MPC of rooftop units in buildings. Our approach demonstrated significant improvements in computational speed from hours to seconds by considering day-ahead demand response signals. Our findings highlight the potential of quantum computing in solving large-scale non-linear discrete optimization problems for building energy systems. The other research presented a new framework for building-to-grid integration. We developed MPC for a commercial distribution grid for cost reduction. With similar solutions to traditional algorithms, quantum computing reduced computational time to less than 1.1%. We proved its potential to solve large-scale discrete optimization problems for urban energy systems
In model predictive control (MPC), a process dynamic model is utilized to make predictions of the value of the objective function and constraints throughout a prediction horizon. In one method of solving this problem, the time required to find the optimal values of the decision variables depends on the time required to perform the arithmetic operations involved in computing the model predictions. Methods for attempting to reduce the computation time of an MPC could then include developing approximate (reduced-order or data-driven) models for a system that take less time to solve, or to parallelize the computations using, for example, multiple cores or CPU’s. However, an observation in all of these cases is that the values of the process states across the prediction horizon are not the values returned by the optimization problem; the manipulated input trajectory is the desired decision variable. An optimization strategy that cannot explicitly return the process states but can generate some representation of them that then leads to computation of the desired process input would thus be suitable for MPC. Quantum computers achieve their parallelism through creating values that cannot all be returned. They can then operate on this set of values to return a number that is meaningful with respect to that set of values that could not all be returned. Motivated by this, we wish to investigate an idea for utilizing quantum parallelism in developing a representation of an objective function that depends on the solution of a process dynamic model, but then only returning the control actions that minimize the objective function value dependent on those solutions. To do this, several steps are necessary. The first is to locate a quantum algorithm which has the desired characteristics for achieving the goals. In this work, we perform these steps using an amplitude amplification strategy based on Grover’s algorithm on a quantum computer. The second is to analyze the algorithm with respect to its ability to translate across problems in the MPC domain, with respect to both its ability to handle nonlinear systems and to handle a variety of different structures of the set of all possible objective function values given the allowable values of the decision variables. We thus evaluate the benefits and limitations of the algorithm from this perspective. We do not wish to imply that this algorithm is more computationally-tractable for use with MPC than classical optimization techniques traditionally applied in an MPC context. Rather, we wish to understand the manner in which such an algorithm would be designed and when it is appropriate for MPC problems (in the sense of returning the correct answers to the optimization problem), as a step toward better understanding the interactions of the quantum properties of quantum algorithms with control goals. We also see this as forming an important first step in algorithm design/analysis, which can then translate to future works in comparing this technique computationally with classical “competitor” algorithms to guide further work in searching for relevant quantum algorithms for control applications.