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

ACM/SPEC International Conference on Performance Engineering (ICPE)

QUADS: Hybrid Quantum–Classical Control of Adaptive Computer Systems

George T. Stamatiou, Ευθύμιος Παπαγεωργίου, Kostas Magoutis

Published Apr 23, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1145/3777911.3799729

Related papers

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-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

Model predictive quantum control: a modular approach for efficient and robust quantum optimal control

Eya Guizani, Julian Berberich

Abstract Model predictive control (MPC) is one of the most successful modern control methods. It relies on repeatedly solving a finite-horizon optimal control problem and applying the beginning piece of the optimal input. In this paper, we develop a modular framework for improving efficiency and robustness of quantum optimal control (QOC) via MPC. We first provide a tutorial introduction to basic concepts of MPC from a QOC perspective. We then present multiple MPC schemes, ranging from simple approaches to more sophisticated schemes which admit stability guarantees. This yields a modular framework which can be used 1) to improve efficiency of open-loop QOC and 2) to improve robustness of closed-loop quantum control by incorporating feedback. We demonstrate these benefits with numerical results, where we benchmark the proposed methods against competing approaches.

arXiv:2509.05167•New Journal of Physics•Oct 1, 2026•2 citations

HybridQC: Hardware-Grounded Simulation of Tightly Integrated Hybrid Quantum-Classical Systems

Panayiotis Christou, Shuwen Kan, Ying Mao

Hybrid quantum-classical performance depends on how quantum processors share classical compute, controllers, memory, and communication links. Circuit simulators and provider measurements expose kernel and job behavior, but leave topology-level questions about controller bottlenecks, quantum capacity, and mixed-workload contention unanswered. We present HybridQC, a discrete-event simulator for configurable hybrid compute units (HCUs). Users specify resource graphs containing classical compute, memory, controllers, quantum annealing (QA) and digital quantum computing (DQC) devices, and links. Jobs become dependent stages for preparation, quantum execution, transfers, reconstruction, and postprocessing. Finite capacities and selectable scheduling policies determine where stages wait and overlap. Service profiles use measurements from D-Wave Advantage 1 and Advantage 2 and IBM Kingston, Marrakesh, and Fez, separating physical quantum-processor occupancy from cloud wall time. Mean absolute percentage errors are 3.92%-8.04% for D-Wave access time and 5.26%-19.01% for IBM quantum seconds. Balanced 10x HCU scaling improves makespan by 2.19x-3.42x, while policy choice changes makespan by 1.80x for a mixed workload with 20 jobs per workload family. Scaling depends on which inputs grow: 100x data growth yields median runtime near 306 s, while 100x joint growth in circuits, shots, and depth reaches 4.806 x 10^7 s on the fixed HCU. HybridQC enables designers to study topology, scheduling, and workload growth before tightly integrated quantum-classical machines exist physically.

cs.PFCross-listedarXiv:2607.13352•Jul 16, 2026•2 citations

Parallelizing process model integration for model predictive control through oracle design and analysis for a Grover’s algorithm-inspired optimization strategy

Kip Nieman, Helen Durand, Saahil Patel +2 more

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.

Digital Chemical Engineering•Aug 24, 2024•4 citations

A Model Predictive Control-Inspired Quantum Algorithm

Dominic Messina, Alicia B. Magann, Mohan Sarovar +1 more

We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.

quant-pharXiv:2607.24992•Jul 29, 2026•0 citations
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.
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.
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.
Abstract Model predictive control (MPC) is one of the most successful modern control methods. It relies on repeatedly solving a finite-horizon optimal control problem and applying the beginning piece of the optimal input. In this paper, we develop a modular framework for improving efficiency and robustness of quantum optimal control (QOC) via MPC. We first provide a tutorial introduction to basic concepts of MPC from a QOC perspective. We then present multiple MPC schemes, ranging from simple approaches to more sophisticated schemes which admit stability guarantees. This yields a modular framework which can be used 1) to improve efficiency of open-loop QOC and 2) to improve robustness of closed-loop quantum control by incorporating feedback. We demonstrate these benefits with numerical results, where we benchmark the proposed methods against competing approaches.
Hybrid quantum-classical performance depends on how quantum processors share classical compute, controllers, memory, and communication links. Circuit simulators and provider measurements expose kernel and job behavior, but leave topology-level questions about controller bottlenecks, quantum capacity, and mixed-workload contention unanswered. We present HybridQC, a discrete-event simulator for configurable hybrid compute units (HCUs). Users specify resource graphs containing classical compute, memory, controllers, quantum annealing (QA) and digital quantum computing (DQC) devices, and links. Jobs become dependent stages for preparation, quantum execution, transfers, reconstruction, and postprocessing. Finite capacities and selectable scheduling policies determine where stages wait and overlap. Service profiles use measurements from D-Wave Advantage 1 and Advantage 2 and IBM Kingston, Marrakesh, and Fez, separating physical quantum-processor occupancy from cloud wall time. Mean absolute percentage errors are 3.92%-8.04% for D-Wave access time and 5.26%-19.01% for IBM quantum seconds. Balanced 10x HCU scaling improves makespan by 2.19x-3.42x, while policy choice changes makespan by 1.80x for a mixed workload with 20 jobs per workload family. Scaling depends on which inputs grow: 100x data growth yields median runtime near 306 s, while 100x joint growth in circuits, shots, and depth reaches 4.806 x 10^7 s on the fixed HCU. HybridQC enables designers to study topology, scheduling, and workload growth before tightly integrated quantum-classical machines exist physically.
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.
We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.