A Quantum Computing Approach for the Unit Commitment Problem
arXiv:2212.06480 · doi:10.1007/978-3-031-24907-5_14
Abstract
Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus, more complex models of this so-called \emph{unit commitment problem (UCP)} have to be solved more rapidly, a task that probably can be solved more efficiently via quantum computing. In this article, we model a UCP with minimum running and idle times as a quadratic unconstrained optimization problem to solve it on quantum computing hardware. First experiments confirm the advantages of our formulation in terms of qubit usage and connectivity and most importantly solution quality.
arXiv commentAccepted at OR Proceedings 2022
References in corpus (6)
- Ising formulations of many NP problems
- Quantum Chemistry in the Age of Quantum Computing
- Quantum computing for energy systems optimization: Challenges and opportunities
- Warm-starting quantum optimization
- Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms
- Variational Quantum Continuous Optimization: a Cornerstone of Quantum Mathematical Analysis