Hybrid Quantum-Classical Multi-cut Benders Approach with a Power System Application
arXiv:2112.05643 · doi:10.1016/j.compchemeng.2023.108161
Abstract
Leveraging the current generation of quantum devices to solve optimization problems of practical interest necessitates the development of hybrid quantum-classical (HQC) solution approaches. In this paper, a multi-cut Benders decomposition (BD) approach that exploits multiple feasible solutions of the master problem (MP) to generate multiple valid cuts is adapted, so as to be used as an HQC solver for general mixed-integer linear programming (MILP) problems. The use of different cut selection criteria and strategies to manage the size of the MP by eliciting a subset of cuts to be added in each iteration of the BD scheme using quantum computing is discussed. The HQC optimization algorithm is applied to the Unit Commitment (UC) problem. UC is a prototypical use case of optimization applied to electrical power systems, a critical sector that may benefit from advances in quantum computing. The validity and computational viability of the proposed approach are demonstrated using the D-Wave Advantage 4.1 quantum annealer.
arXiv comment15 pages, 5 figures, 6 tables
References in corpus (13)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Ising formulations of many NP problems
- Robustness of adiabatic quantum computation
- Quantum computing for energy systems optimization: Challenges and opportunities
- Quantum Computing based Hybrid Solution Strategies for Large-scale Discrete-Continuous Optimization Problems
- Grover Adaptive Search for Constrained Polynomial Binary Optimization
- Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
- Benchmarking Quantum Annealing Controls with Portfolio Optimization
- Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement
- Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
- Quantum Computing for Power Flow Algorithms: Testing on real Quantum Computers
- Typical Approximation Performance for Maximum Coverage Problem