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 Automation Science and Engineering (CASE)

Quantum-Assisted Dynamic Optimization for Industrial Control Systems: A Robust Tube-MPC Framework

Xiaofei Zhao

Published Aug 1, 2026• 0 citations
Publisher

Abstract

Real-time optimal control of complex hybrid systems-governed by both continuous thermodynamic dynamics and discrete topological switching-presents a formidable Mixed-Integer Nonlinear Programming (MINLP) challenge. Traditional exact solvers often experience severe performance degradation, or “engineering suffocation,” under strict computational time budgets and tightened robust safety constraints. To address this critical bottleneck, we propose the Quantum-Classical Collaborative MINLP Dynamic Optimization (QC-MINLP-DO) framework, which integrates the Quantum Approximate Optimization Algorithm (QAOA) with robust modedependent Tube-MPC. By enforcing a strict dual-timescale separation, the framework isolates continuous worst-case safety from discrete combinatorial exploration. A fast-timescale Tube-MPC guarantees absolute recursive feasibility and physical safety against bounded disturbances. Asynchronously, a costaware meta-scheduler maps a trust-region-bounded pseudo-Boolean surrogate to a sparse Ising Hamiltonian, utilizing the QAOA backend to orthogonally sample high-quality topological candidates. Crucially, a two-tiered Cross-Domain Admissibility Veto Protocol strictly intercepts any unsafe or infeasible proposals prior to execution. Extensive time-domain simulations on a green-hydrogen microgrid demonstrate the framework's efficacy across varying Feasibility Fragmentation Index (FI) regimes. Remarkably, under a strict 1.5-second Time-to-Solution (TTS) budget and extreme FI penalties, the quantumassisted framework completely avoids the choking phenomenon of classical solvers, delivering up to a 15.3x reduction in Non-Update Probability (NUP) while mathematically guaranteeing zero physical constraint violations.

DOI
10.1109/case69030.2026.11704316

Related papers

Hybrid quantum-classical optimization of the resource scheduling problem

Tyler Christeson, Md Habib Ullah, Ali Arabnya +2 more

• We propose a new hybrid quantum-classical algorithm for solving the UC problem. • The hybrid model successfully optimizes 24-hour UC systems from 10 to 1000 units. • The model outperforms classical metaheuristics (GA and SA) and classical MINLP. • This represents an improvement over previous QCUC methods, a step to real-world use. Resource scheduling is critical in many industries, especially in power systems where the Unit Commitment (UC) problem determines the on/off status and output levels of generators under physical and economic constraints. Traditional exact methods, such as Branch‑and‑Bound, Branch‑and‑Cut, dynamic programming and mixed‑integer linear programming (MILP), remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time‑consuming for large‑scale systems. In this paper, we introduce a quantum‑classical hybrid algorithm for UC, and other resource scheduling problems by extension, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary “master problem” is formulated as a quadratic unconstrained binary optimization (QUBO) model and solved on a quantum annealer. The continuous “subproblem,” which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed‑integer nonlinear programming (MINLP) baseline, the hybrid algorithm achieves a consistently lower computation‑time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large‑scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.

arXiv:2511.00733•Next research.•Jan 27, 2026•9 citations

Exploring Hybrid Quantum-Classical Algorithms for Multiscale Bioprocess Optimization

Ilse María Hernández-Romero, Shawn M. Gibford, William R. Clements +3 more

Bioprocess optimization spans multiple scales, from molecular interactions to plant-wide operations, presenting challenges due to nonlinearity, high-dimensionality, and computational intractability. Traditional methods, such as Mixed-Integer Nonlinear Programming (MINLP), often fail to efficiently solve these problems. This work explores Hybrid Quantum-Classical (HQC) algorithms as a promising alternative. By integrating quantum solvers for discrete combinatorial optimization with classical solvers for continuous variable refinement, HQC approaches overcome computational bottlenecks inherent to classical techniques. The application of HQC algorithms enhances efficiency, scalability, and decision-making in bioprocess optimization, particularly in metabolic pathway selection, real-time fermentor control, and plant-wide resource allocation. This perspective outlines the theoretical foundation of HQC methods, their applications across bioprocess scales, and future research directions.

Industrial & Engineering Chemistry Research•Apr 21, 2025•6 citations

Dynamic Quantum Optimal Communication Topology Design for Consensus Control in Linear Multi-Agent Systems

Milad Hasanzadeh, Amin Kargarian

This paper proposes a quantum framework for the design of communication topologies in consensus-based multi-agent systems. The communication graph is selected online by solving a mixed-integer quadratic program (MIQP) that minimizes a cost combining communication and distance penalties with degree-regularization terms, while enforcing exact connectivity through a flow-based formulation. To cope with the combinatorial complexity of this NP-hard problem, we develop a three-block ADMM scheme that decomposes the MIQP into a convex quadratic program in relaxed edge and flow variables, a pure binary unconstrained subproblem, and a closed-form auxiliary update. The binary subproblem is mapped to a quadratic unconstrained binary optimization (QUBO) Hamiltonian and approximately solved via quantum imaginary time evolution (QITE). The resulting time-varying, optimizer-generated Laplacians are applied to linear first- and second-order consensus dynamics. Numerical simulations on networks demonstrate that the proposed method produces connected topologies that satisfy degree constraints, achieve consensus, and incur costs comparable to those of classical mixed-integer solvers, thereby illustrating how quantum algorithms can be embedded as topology optimizers within closed-loop distributed control architectures.

arXiv:2602.06215•Feb 5, 2026•2 citations

QC-C&CG: Quantum-Classical Algorithm for Two-stage Adaptive Robust Optimization

Duong The Do, Jiaming Cheng, Duong Tung Nguyen

Quantum optimization provides a promising approach for solving large-scale combinatorial problems through quadratic unconstrained binary optimization (QUBO) formulations. However, integrating QUBO-based solvers into structured optimization frameworks while preserving solution guarantees remains a fundamental challenge. This paper develops a hybrid quantum-classical column-and-constraint generation (QCCG) framework for solving two-stage adaptive robust optimization problems with binary first-stage decisions and linear recourse under polyhedral uncertainty. The proposed approach reformulates the restricted master problem as a QUBO and solves it approximately using a quantum optimizer, while retaining a classical adversarial subproblem to compute worst-case recourse and certify solution quality. We construct a constraint-preserving QUBO encoding for inequality-constrained master problems using slack variables and penalty terms, enabling general mixed-integer structures to be mapped to quantum-compatible representations. To address inexactness arising from discretization, penalty modeling, and quantum optimization, we introduce a bound-adjustment mechanism that yields valid lower and upper bounds and provides a certified stopping criterion. We show that the proposed framework generalizes classical column-and-constraint generation and retains its convergence properties when the master problem is solved exactly. Numerical experiments on two-stage robust location-transportation problems demonstrate that the proposed hybrid approach achieves solution quality comparable to classical methods while reducing the computational burden associated with solving mixed-integer master problems, highlighting the potential of hybrid quantum-classical optimization for scalable decision-making under uncertainty.

arXiv:2609.13216•Aug 28, 2026•0 citations

QTIS: A QAOA-Based Quantum Time Interval Scheduler

José A. Tirado-Domínguez, Eladio Gutiérrez, Oscar Plata

Task scheduling with constrained time intervals and limited resources remains a fundamental challenge across domains such as manufacturing, logistics, cloud computing, and healthcare. This study presents a novel variant of the Quantum Approximate Optimization Algorithm (QAOA) designed to address the task scheduling problem formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model. The proposed method, referred to as Quantum Time Interval Scheduler (QTIS), integrates an ancilla-assisted quantum circuit to dynamically detect and penalize overlapping tasks, enhancing the enforcement of scheduling constraints. Two complementary implementations are explored for overlap detection: a quantum approach based on RY rotations and CCNOT gates, and a classical alternative relying on preprocessed interval comparisons. QTIS decomposes the problem Hamiltonian, Hp, into two components, each parameterized by a distinct angle. The first component encodes the objective function, while the second captures penalty terms associated with overlapping intervals, which are controlled by the auxiliary circuit. Subsequently, three minimization strategies are evaluated: standard QAOA, T-QAOA, and HT-QAOA, showing that employing separate parameters for the different components of the problem Hamiltonian leads to lower energy values and improved solution quality. Results confirm the efficiency of QTIS in scheduling tasks with fixed temporal windows while minimizing conflicts, demonstrating its potential to advance hybrid quantum-classical optimization in complex scheduling environments.

quant-pharXiv:2511.15590•Future Generation Computer Systems•Nov 20, 2025•2 citations

Hybrid Quantum Optimization and Sensing for Real-Time Hospital Operations: OR Scheduling, ICU Staffing, and MRI Throughput

A. Vishnukumar, B Dinesh, Harini Pachaiyappan +3 more

This paper presents a hybrid quantum-classical framework for real-time hospital operations that addresses three routine sources of delay and risk: operating room (OR) rescheduling under disruptions, dynamic ICU/ED staffing under shocks, and MRI throughput with quality control. The approach integrates shallow, latency-bounded quantum optimization within established scheduling pipelines to accelerate diversified search over combinatorial decision spaces under strict deadlines, while classical solvers enforce feasibility, safety, and deterministic fallbacks. In parallel, sensing-guided MRI control provides realtime field/SNR characterization that drives adaptive acquisition and stabilizes AI reconstruction, reducing rescans without compromising diagnostic integrity. The system comprises: (1) a realtime OR rescheduling module that preserves credentialing, safety, and resource constraints; (2) a dynamic ICU/ED assignment module that maintains safe coverage and fairness with acuityand skill-mix awareness; and (3) an MRI module that couples on-scanner quality control with physics-consistent reconstruction to shorten scan times. Evaluation emphasizes wall-clock latency, constraint satisfaction, utilization, and image-quality indices-metrics aligned to patient access, safety, and operational resilience. Results indicate that shallow hybrid quantum methods, when fused with robust classical controllers and sensing feedback, can deliver reliable, incremental improvements under real-time hospital conditions, while providing auditable guardrails and failsafe rollbacks suitable for near-term deployment.

International Conference on Smart Technologies and Systems for Next Generation Computing (ICSTSN)•Nov 20, 2025•0 citations
Real-time optimal control of complex hybrid systems-governed by both continuous thermodynamic dynamics and discrete topological switching-presents a formidable Mixed-Integer Nonlinear Programming (MINLP) challenge. Traditional exact solvers often experience severe performance degradation, or “engineering suffocation,” under strict computational time budgets and tightened robust safety constraints. To address this critical bottleneck, we propose the Quantum-Classical Collaborative MINLP Dynamic Optimization (QC-MINLP-DO) framework, which integrates the Quantum Approximate Optimization Algorithm (QAOA) with robust modedependent Tube-MPC. By enforcing a strict dual-timescale separation, the framework isolates continuous worst-case safety from discrete combinatorial exploration. A fast-timescale Tube-MPC guarantees absolute recursive feasibility and physical safety against bounded disturbances. Asynchronously, a costaware meta-scheduler maps a trust-region-bounded pseudo-Boolean surrogate to a sparse Ising Hamiltonian, utilizing the QAOA backend to orthogonally sample high-quality topological candidates. Crucially, a two-tiered Cross-Domain Admissibility Veto Protocol strictly intercepts any unsafe or infeasible proposals prior to execution. Extensive time-domain simulations on a green-hydrogen microgrid demonstrate the framework's efficacy across varying Feasibility Fragmentation Index (FI) regimes. Remarkably, under a strict 1.5-second Time-to-Solution (TTS) budget and extreme FI penalties, the quantumassisted framework completely avoids the choking phenomenon of classical solvers, delivering up to a 15.3x reduction in Non-Update Probability (NUP) while mathematically guaranteeing zero physical constraint violations.
• We propose a new hybrid quantum-classical algorithm for solving the UC problem. • The hybrid model successfully optimizes 24-hour UC systems from 10 to 1000 units. • The model outperforms classical metaheuristics (GA and SA) and classical MINLP. • This represents an improvement over previous QCUC methods, a step to real-world use. Resource scheduling is critical in many industries, especially in power systems where the Unit Commitment (UC) problem determines the on/off status and output levels of generators under physical and economic constraints. Traditional exact methods, such as Branch‑and‑Bound, Branch‑and‑Cut, dynamic programming and mixed‑integer linear programming (MILP), remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time‑consuming for large‑scale systems. In this paper, we introduce a quantum‑classical hybrid algorithm for UC, and other resource scheduling problems by extension, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary “master problem” is formulated as a quadratic unconstrained binary optimization (QUBO) model and solved on a quantum annealer. The continuous “subproblem,” which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed‑integer nonlinear programming (MINLP) baseline, the hybrid algorithm achieves a consistently lower computation‑time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large‑scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.
Bioprocess optimization spans multiple scales, from molecular interactions to plant-wide operations, presenting challenges due to nonlinearity, high-dimensionality, and computational intractability. Traditional methods, such as Mixed-Integer Nonlinear Programming (MINLP), often fail to efficiently solve these problems. This work explores Hybrid Quantum-Classical (HQC) algorithms as a promising alternative. By integrating quantum solvers for discrete combinatorial optimization with classical solvers for continuous variable refinement, HQC approaches overcome computational bottlenecks inherent to classical techniques. The application of HQC algorithms enhances efficiency, scalability, and decision-making in bioprocess optimization, particularly in metabolic pathway selection, real-time fermentor control, and plant-wide resource allocation. This perspective outlines the theoretical foundation of HQC methods, their applications across bioprocess scales, and future research directions.
This paper proposes a quantum framework for the design of communication topologies in consensus-based multi-agent systems. The communication graph is selected online by solving a mixed-integer quadratic program (MIQP) that minimizes a cost combining communication and distance penalties with degree-regularization terms, while enforcing exact connectivity through a flow-based formulation. To cope with the combinatorial complexity of this NP-hard problem, we develop a three-block ADMM scheme that decomposes the MIQP into a convex quadratic program in relaxed edge and flow variables, a pure binary unconstrained subproblem, and a closed-form auxiliary update. The binary subproblem is mapped to a quadratic unconstrained binary optimization (QUBO) Hamiltonian and approximately solved via quantum imaginary time evolution (QITE). The resulting time-varying, optimizer-generated Laplacians are applied to linear first- and second-order consensus dynamics. Numerical simulations on networks demonstrate that the proposed method produces connected topologies that satisfy degree constraints, achieve consensus, and incur costs comparable to those of classical mixed-integer solvers, thereby illustrating how quantum algorithms can be embedded as topology optimizers within closed-loop distributed control architectures.
Quantum optimization provides a promising approach for solving large-scale combinatorial problems through quadratic unconstrained binary optimization (QUBO) formulations. However, integrating QUBO-based solvers into structured optimization frameworks while preserving solution guarantees remains a fundamental challenge. This paper develops a hybrid quantum-classical column-and-constraint generation (QCCG) framework for solving two-stage adaptive robust optimization problems with binary first-stage decisions and linear recourse under polyhedral uncertainty. The proposed approach reformulates the restricted master problem as a QUBO and solves it approximately using a quantum optimizer, while retaining a classical adversarial subproblem to compute worst-case recourse and certify solution quality. We construct a constraint-preserving QUBO encoding for inequality-constrained master problems using slack variables and penalty terms, enabling general mixed-integer structures to be mapped to quantum-compatible representations. To address inexactness arising from discretization, penalty modeling, and quantum optimization, we introduce a bound-adjustment mechanism that yields valid lower and upper bounds and provides a certified stopping criterion. We show that the proposed framework generalizes classical column-and-constraint generation and retains its convergence properties when the master problem is solved exactly. Numerical experiments on two-stage robust location-transportation problems demonstrate that the proposed hybrid approach achieves solution quality comparable to classical methods while reducing the computational burden associated with solving mixed-integer master problems, highlighting the potential of hybrid quantum-classical optimization for scalable decision-making under uncertainty.
Task scheduling with constrained time intervals and limited resources remains a fundamental challenge across domains such as manufacturing, logistics, cloud computing, and healthcare. This study presents a novel variant of the Quantum Approximate Optimization Algorithm (QAOA) designed to address the task scheduling problem formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model. The proposed method, referred to as Quantum Time Interval Scheduler (QTIS), integrates an ancilla-assisted quantum circuit to dynamically detect and penalize overlapping tasks, enhancing the enforcement of scheduling constraints. Two complementary implementations are explored for overlap detection: a quantum approach based on RY rotations and CCNOT gates, and a classical alternative relying on preprocessed interval comparisons. QTIS decomposes the problem Hamiltonian, Hp, into two components, each parameterized by a distinct angle. The first component encodes the objective function, while the second captures penalty terms associated with overlapping intervals, which are controlled by the auxiliary circuit. Subsequently, three minimization strategies are evaluated: standard QAOA, T-QAOA, and HT-QAOA, showing that employing separate parameters for the different components of the problem Hamiltonian leads to lower energy values and improved solution quality. Results confirm the efficiency of QTIS in scheduling tasks with fixed temporal windows while minimizing conflicts, demonstrating its potential to advance hybrid quantum-classical optimization in complex scheduling environments.
This paper presents a hybrid quantum-classical framework for real-time hospital operations that addresses three routine sources of delay and risk: operating room (OR) rescheduling under disruptions, dynamic ICU/ED staffing under shocks, and MRI throughput with quality control. The approach integrates shallow, latency-bounded quantum optimization within established scheduling pipelines to accelerate diversified search over combinatorial decision spaces under strict deadlines, while classical solvers enforce feasibility, safety, and deterministic fallbacks. In parallel, sensing-guided MRI control provides realtime field/SNR characterization that drives adaptive acquisition and stabilizes AI reconstruction, reducing rescans without compromising diagnostic integrity. The system comprises: (1) a realtime OR rescheduling module that preserves credentialing, safety, and resource constraints; (2) a dynamic ICU/ED assignment module that maintains safe coverage and fairness with acuityand skill-mix awareness; and (3) an MRI module that couples on-scanner quality control with physics-consistent reconstruction to shorten scan times. Evaluation emphasizes wall-clock latency, constraint satisfaction, utilization, and image-quality indices-metrics aligned to patient access, safety, and operational resilience. Results indicate that shallow hybrid quantum methods, when fused with robust classical controllers and sensing feedback, can deliver reliable, incremental improvements under real-time hospital conditions, while providing auditable guardrails and failsafe rollbacks suitable for near-term deployment.