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

Optimization Methods for Mixed-Integer Control Problems in Complex Systems

Xinyu Fei

Published Jan 1, 2023• 0 citations
Publisher

Abstract

Applying sophisticated optimization methods to control problems in various systems offers a structured approach for achieving system efficiency and reliability, while ensuring the feasibility of physics-based constraints. This dissertation primarily focuses on developing optimization algorithms for control problems in complex systems with mixed-integer variables and parameter uncertainties. In Chapter 1, we provide a detailed introduction about the problem motivation and summarize our problems and contributions. Specifically, we develop new optimization models and algorithms for network-based traffic control and binary control in quantum systems, detailed as follows. Traffic signal control is an effective way of mitigating traffic congestion, where its complexity escalates in large cities due to numerous intersections and varying traffic conditions. Advancements in communication technologies within transportation infrastructures have made distributed traffic signal control at the network level possible and worth investigating. In Chapter 2, we build a stochastic optimization model for network-level traffic signal control under traffic demand uncertainty and solve it using decentralized algorithms. We compare the results with state-of-the-art traffic control methods via testing instances of real-world traffic networks and data. Quantum computing and quantum systems provide a novel way of significantly accelerating computation and their operations largely rely on quantum pulse control optimization to attain desired states or status. The optimization of binary quantum pulse control can potentially enhance the performance of classical quantum variational techniques and improve solution quality. In Chapter 3, we study a discrete-valued binary quantum control problem and propose an algorithmic framework to solve the problem with penalty on switches. In Chapter 4, we explore the binary quantum control problem in a continuous time horizon by optimizing both control functions and control time intervals. Moreover, the time-varying noise in quantum systems and the wide use of inhomogeneous quantum ensembles highlight the need for quantum controls considering uncertainties. In Chapter 5, we develop a stochastic optimization model for the binary quantum control problem with uncertain Hamiltonian controllers and solve it using gradient-based methods with rounding algorithms. We test the performance of our approaches and benchmark with state-of-the-art control methods in all three chapters. Lastly, in Chapter 6, we conclude the dissertation and state future research directions.

DOI
10.7302/23026

Related papers

Binary Quantum Control Optimization with Uncertain Hamiltonians

Xinyu Fei, Lucas T. Brady, Jeffrey M. Larson +2 more

Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. We demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. Accepted for Special Issue. Funding: This work was supported by the US Department of Energy, Advanced Scientific Computing Research [Grants DE-AC02-06CH11357, DE-SC0018018]; Defense Sciences Office, DARPA [Grant IAA-8839-annex-130]; the US National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation [Grant 2041745]; and the US National Aeronautics and Space Administration (NASA) Ames Research Center [Grant 80ARC020D0010]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0560 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0560 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

arXiv:2401.10120•INFORMS journal on computing•Nov 7, 2024•1 citation

Binary Control Pulse Optimization for Quantum Systems

Xinyu Fei, Lucas T. Brady, Jeffrey M. Larson +2 more

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

arXiv:2204.05773•Quantum•Jan 4, 2023•11 citations

Switching Time Optimization for Binary Quantum Optimal Control

Xinyu Fei, Lucas T. Brady, Jeffrey M. Larson +2 more

Quantum optimal control is a technique for controlling the evolution of a quantum system and has been applied to a wide range of problems in quantum physics. We study a binary quantum control optimization problem, where control decisions are binary-valued and the problem is solved in diverse quantum algorithms. In this paper, we utilize classical optimization and computing techniques to develop an algorithmic framework that sequentially optimizes the number of control switches and the duration of each control interval on a continuous time horizon. Specifically, we first solve the continuous relaxation of the binary control problem based on time discretization and then use a heuristic to obtain a controller sequence with a penalty on the number of switches. Then, we formulate a switching time optimization model and apply sequential least-squares programming with accelerated time-evolution simulation to solve the model. We demonstrate that our computational framework can obtain binary controls with high-quality performance and also reduce computational time via solving a family of quantum control instances in various quantum physics applications.

arXiv:2308.03132•ACM Transactions on Quantum Computing•Jul 19, 2024•3 citations

Computational techniques for optimal control of quantum systems

Evangelos A. Coutsias, G. von Winckel

The control of matter and energy at a fundamental level will be a cornerstone of new technologies for years to come. This idea is exemplified in a distilled form by controlling the dynamics of quantum mechanical systems via a time-dependent potential. The contributions detailed within this work focus on the computational aspects of formulating and solving quantum control problems efficiently. The accurate numerical computation of optimal controls of infinite dimensional quantum control problems is a very difficult task that requires to take into account the features of the original infinite dimensional problem. An important issue is the choice of the functional space where the minimization process is defined. A systematic comparison of L2 versus H1 based minimization shows that the choice of the appropriate functional space matters and has many consequences in the implementation of some optimization techniques. A matrix-free cascadic BFGS algorithm is introduced in the L 2 and H1 settings and it is demonstrated that the choice of H1 over L2 results in a substantial performance and robustness increase. A comparison between optimal control resulting from function space minimization and the control obtained by minimization over Chebyshev and POD basis function coefficients is presented. A theoretical and computational framework is presented to obtain accurate controls for fast quantum state transitions that are needed in a host of applications such as nano electronic devices and quantum computing. This method is based on a reduced Hessian Krylov-Newton scheme applied to a norm-preserving discrete model of a dipole quantum control problem. The use of second-order numerical methods for solving the control problem is justified proving existence of optimal solutions and analyzing first- and second-order optimality conditions. Criteria for the discretization of the non-convex optimization problem and for the formulation of the Hessian are given to ensure accurate gradients and a symmetric Hessian. Robustness of the Newton approach is obtained using a globalization strategy with a robust linesearch procedure. Results of numerical experiments demonstrate that the Newton approach presented in this dissertation is able to provide fast and accurate controls for high-energy state transitions. Control of bound-to-bound and bound-to-continuum transitions in open quantum systems and vector field control of two-dimensional systems is presented. An efficient space-time spectral discretization of the time-dependent Schrodinger equation and preconditioning strategy for a fast approximate solution with Krylov methods is outlined.

•Jan 1, 2011•0 citations

Discrete quantum control

Jon R. Grice

This dissertation is a study of several aspects of discrete time quantum control. After reviewing the necessary background from quantum mechanics and control theory we construct a simple model and solve a control problem on it as a proof of concept for the discrete control formulation developed herein. We apply optimal control to solve a state preparation problem on a physically motivated time discretized single qubit system with simplified dynamics to enable the Bellman equation to be solved both numerically and approximately analytically. However for more than one qubit classical theories of control become problematic, a notable difficulty being the exponential increase in the size of the state space with the number of particles. To study workarounds for this problem we quantify how much information a quantum measurement can extract from the system and then use the results to show that a naive classical technique for controlling a multiparticle system performs poorly when the system has "quantum" properties. We then consider the problem of protecting the entanglement of a bipartite quantum system using discrete open loop control with a technique that seems to have no classical analog. The states of the bipartite system, called X-states, have a special structure which is generalized to states of systems with more than two qubits. We develop the properties of these generalized X-states which are a class of mixed states with interesting multipartite entanglement properties

•Jan 1, 2009•0 citations

Quantum Annealing Applications for Power Grid Modernization

Tyler Christeson

Power grid modernization is essential for ensuring the reliability, efficiency, and sustainability of power systems in response to increasing demand, supply uncertainty, and decentralization of resources. This dissertation investigates the application of quantum computing (QC) in solving two challenging power grid problems, including Unit Commitment (UC) and Vehicle-to-Grid (V2G) optimization. Through novel approaches in quantum modeling, this work seeks to advance computational strategies that could support grid modernization efforts as grid complexity grows beyond the capabilities of classical optimization methods. The first part of this research introduces QC and the core mechanics of quantum physics that are vital to understanding quantum computations. Different methods of QC and their histories are discussed, including gate-based models and quantum annealing. Quantum annealing (QA) is the focus of the rest of the chapter, discussing the QA process, the mathematics behind it, and the reformulations required to make an optimization problem quantum-compatible. In the second part, a hybrid quantum-classical model is developed to solve the UC problem, combining QA with classical solvers to balance computational efficiency and solution accuracy. The results are compared to a classical deterministic and metaheuristic solutions, which reveals that while classical models outperform quantum solutions at smaller scales, the hybrid approach offers promising advantages in handling more complex grid configurations. This hybrid model provides a pathway for QC to enhance classical optimization techniques, especially as hardware and embedding algorithms continue to evolve. A novel discretization strategy is introduced that is designed to solve the UC problem more efficiently compatible with quantum annealing (QA) hardware. By representing continuous variables as binary variables using a logarithmic binning technique, this approach aims to reduce the number of binary variables needed for problem reformulation. Results show that this novel discretization significantly decreased computational time and yielded fewer binary variables, although further adjustments are needed to improve solution accuracy and optimality. The final part examines the feasibility of using a quantum model to optimize V2G scheduling. This quantum model, aimed at minimizing EV charging costs over a 24-hour period, achieves a reasonable optimality rate relative to a classical deterministic solution for a studied test system. The study demonstrates QC’s potential for real-world applications, albeit on a limited scale, and highlights the scalability possibilities for broader V2G network management as quantum technology matures. This is followed by a review of existing methods for V2G and mobile energy storage system optimization, with a focus on enhancing grid resilience and a discussion around potential quantum advantages and pathways for future utilization. Collectively, these findings demonstrate that while QC in grid optimization is still in its nascent stages, it holds substantial promise for meeting the computational demands of the future power grid. This research paves the way for continued exploration of quantum-enhanced solutions to support grid modernization in the era of renewable energy integration, electrification, and continually increasing complexity.

•Nov 21, 2025•0 citations
Applying sophisticated optimization methods to control problems in various systems offers a structured approach for achieving system efficiency and reliability, while ensuring the feasibility of physics-based constraints. This dissertation primarily focuses on developing optimization algorithms for control problems in complex systems with mixed-integer variables and parameter uncertainties. In Chapter 1, we provide a detailed introduction about the problem motivation and summarize our problems and contributions. Specifically, we develop new optimization models and algorithms for network-based traffic control and binary control in quantum systems, detailed as follows. Traffic signal control is an effective way of mitigating traffic congestion, where its complexity escalates in large cities due to numerous intersections and varying traffic conditions. Advancements in communication technologies within transportation infrastructures have made distributed traffic signal control at the network level possible and worth investigating. In Chapter 2, we build a stochastic optimization model for network-level traffic signal control under traffic demand uncertainty and solve it using decentralized algorithms. We compare the results with state-of-the-art traffic control methods via testing instances of real-world traffic networks and data. Quantum computing and quantum systems provide a novel way of significantly accelerating computation and their operations largely rely on quantum pulse control optimization to attain desired states or status. The optimization of binary quantum pulse control can potentially enhance the performance of classical quantum variational techniques and improve solution quality. In Chapter 3, we study a discrete-valued binary quantum control problem and propose an algorithmic framework to solve the problem with penalty on switches. In Chapter 4, we explore the binary quantum control problem in a continuous time horizon by optimizing both control functions and control time intervals. Moreover, the time-varying noise in quantum systems and the wide use of inhomogeneous quantum ensembles highlight the need for quantum controls considering uncertainties. In Chapter 5, we develop a stochastic optimization model for the binary quantum control problem with uncertain Hamiltonian controllers and solve it using gradient-based methods with rounding algorithms. We test the performance of our approaches and benchmark with state-of-the-art control methods in all three chapters. Lastly, in Chapter 6, we conclude the dissertation and state future research directions.
Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. We demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. Accepted for Special Issue. Funding: This work was supported by the US Department of Energy, Advanced Scientific Computing Research [Grants DE-AC02-06CH11357, DE-SC0018018]; Defense Sciences Office, DARPA [Grant IAA-8839-annex-130]; the US National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation [Grant 2041745]; and the US National Aeronautics and Space Administration (NASA) Ames Research Center [Grant 80ARC020D0010]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0560 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0560 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.
Quantum optimal control is a technique for controlling the evolution of a quantum system and has been applied to a wide range of problems in quantum physics. We study a binary quantum control optimization problem, where control decisions are binary-valued and the problem is solved in diverse quantum algorithms. In this paper, we utilize classical optimization and computing techniques to develop an algorithmic framework that sequentially optimizes the number of control switches and the duration of each control interval on a continuous time horizon. Specifically, we first solve the continuous relaxation of the binary control problem based on time discretization and then use a heuristic to obtain a controller sequence with a penalty on the number of switches. Then, we formulate a switching time optimization model and apply sequential least-squares programming with accelerated time-evolution simulation to solve the model. We demonstrate that our computational framework can obtain binary controls with high-quality performance and also reduce computational time via solving a family of quantum control instances in various quantum physics applications.
The control of matter and energy at a fundamental level will be a cornerstone of new technologies for years to come. This idea is exemplified in a distilled form by controlling the dynamics of quantum mechanical systems via a time-dependent potential. The contributions detailed within this work focus on the computational aspects of formulating and solving quantum control problems efficiently. The accurate numerical computation of optimal controls of infinite dimensional quantum control problems is a very difficult task that requires to take into account the features of the original infinite dimensional problem. An important issue is the choice of the functional space where the minimization process is defined. A systematic comparison of L2 versus H1 based minimization shows that the choice of the appropriate functional space matters and has many consequences in the implementation of some optimization techniques. A matrix-free cascadic BFGS algorithm is introduced in the L 2 and H1 settings and it is demonstrated that the choice of H1 over L2 results in a substantial performance and robustness increase. A comparison between optimal control resulting from function space minimization and the control obtained by minimization over Chebyshev and POD basis function coefficients is presented. A theoretical and computational framework is presented to obtain accurate controls for fast quantum state transitions that are needed in a host of applications such as nano electronic devices and quantum computing. This method is based on a reduced Hessian Krylov-Newton scheme applied to a norm-preserving discrete model of a dipole quantum control problem. The use of second-order numerical methods for solving the control problem is justified proving existence of optimal solutions and analyzing first- and second-order optimality conditions. Criteria for the discretization of the non-convex optimization problem and for the formulation of the Hessian are given to ensure accurate gradients and a symmetric Hessian. Robustness of the Newton approach is obtained using a globalization strategy with a robust linesearch procedure. Results of numerical experiments demonstrate that the Newton approach presented in this dissertation is able to provide fast and accurate controls for high-energy state transitions. Control of bound-to-bound and bound-to-continuum transitions in open quantum systems and vector field control of two-dimensional systems is presented. An efficient space-time spectral discretization of the time-dependent Schrodinger equation and preconditioning strategy for a fast approximate solution with Krylov methods is outlined.
This dissertation is a study of several aspects of discrete time quantum control. After reviewing the necessary background from quantum mechanics and control theory we construct a simple model and solve a control problem on it as a proof of concept for the discrete control formulation developed herein. We apply optimal control to solve a state preparation problem on a physically motivated time discretized single qubit system with simplified dynamics to enable the Bellman equation to be solved both numerically and approximately analytically. However for more than one qubit classical theories of control become problematic, a notable difficulty being the exponential increase in the size of the state space with the number of particles. To study workarounds for this problem we quantify how much information a quantum measurement can extract from the system and then use the results to show that a naive classical technique for controlling a multiparticle system performs poorly when the system has "quantum" properties. We then consider the problem of protecting the entanglement of a bipartite quantum system using discrete open loop control with a technique that seems to have no classical analog. The states of the bipartite system, called X-states, have a special structure which is generalized to states of systems with more than two qubits. We develop the properties of these generalized X-states which are a class of mixed states with interesting multipartite entanglement properties
Power grid modernization is essential for ensuring the reliability, efficiency, and sustainability of power systems in response to increasing demand, supply uncertainty, and decentralization of resources. This dissertation investigates the application of quantum computing (QC) in solving two challenging power grid problems, including Unit Commitment (UC) and Vehicle-to-Grid (V2G) optimization. Through novel approaches in quantum modeling, this work seeks to advance computational strategies that could support grid modernization efforts as grid complexity grows beyond the capabilities of classical optimization methods. The first part of this research introduces QC and the core mechanics of quantum physics that are vital to understanding quantum computations. Different methods of QC and their histories are discussed, including gate-based models and quantum annealing. Quantum annealing (QA) is the focus of the rest of the chapter, discussing the QA process, the mathematics behind it, and the reformulations required to make an optimization problem quantum-compatible. In the second part, a hybrid quantum-classical model is developed to solve the UC problem, combining QA with classical solvers to balance computational efficiency and solution accuracy. The results are compared to a classical deterministic and metaheuristic solutions, which reveals that while classical models outperform quantum solutions at smaller scales, the hybrid approach offers promising advantages in handling more complex grid configurations. This hybrid model provides a pathway for QC to enhance classical optimization techniques, especially as hardware and embedding algorithms continue to evolve. A novel discretization strategy is introduced that is designed to solve the UC problem more efficiently compatible with quantum annealing (QA) hardware. By representing continuous variables as binary variables using a logarithmic binning technique, this approach aims to reduce the number of binary variables needed for problem reformulation. Results show that this novel discretization significantly decreased computational time and yielded fewer binary variables, although further adjustments are needed to improve solution accuracy and optimality. The final part examines the feasibility of using a quantum model to optimize V2G scheduling. This quantum model, aimed at minimizing EV charging costs over a 24-hour period, achieves a reasonable optimality rate relative to a classical deterministic solution for a studied test system. The study demonstrates QC’s potential for real-world applications, albeit on a limited scale, and highlights the scalability possibilities for broader V2G network management as quantum technology matures. This is followed by a review of existing methods for V2G and mobile energy storage system optimization, with a focus on enhancing grid resilience and a discussion around potential quantum advantages and pathways for future utilization. Collectively, these findings demonstrate that while QC in grid optimization is still in its nascent stages, it holds substantial promise for meeting the computational demands of the future power grid. This research paves the way for continued exploration of quantum-enhanced solutions to support grid modernization in the era of renewable energy integration, electrification, and continually increasing complexity.