A hybrid classical-quantum approach to highly constrained Unit Commitment problems
Bruna Salgado, Andr\'e Sequeira, and Luis Paulo Santos

TL;DR
This paper presents a hybrid quantum-classical algorithm for solving the NP-hard unit commitment problem in power systems, incorporating real-world constraints and demonstrating near-classical solution accuracy with polynomial efficiency.
Contribution
It introduces a novel hybrid quantum-classical approach using QAOA for the UC problem, including spinning reserve constraints and warm-start optimization, achieving efficient approximate solutions.
Findings
Hybrid solutions within 5.1% of classical solutions
Reduced QAOA convergence iterations with warm-start
Polynomial time complexity for large instances
Abstract
The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify the optimal unit combination and classical methods to determine individual unit powers. The proposed hybrid algorithm is the first to include both the spinning reserve constraint (thus improving its applicability to real-world scenarios) and to explore QAOA warm-start optimization in this context.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
