Solving Power System Problems using Adiabatic Quantum Computing
By: Zeynab Kaseb , Matthias Moller , Peter Palensky and more
Potential Business Impact:
Solves tricky power grid problems with new computer.
This paper proposes a novel combinatorial optimization framework that reformulates existing power system problems into a format executable on quantum annealers. The proposed framework accommodates both normal and complex numbers and enables efficient handling of large-scale problems, thus ensuring broad applicability across power system problems. As a proof of concept, we demonstrate its applicability in two classical problems: (i) power system parameter identification, where we estimate the admittance matrix given voltage and current measurements, and (ii) power flow analysis, where we reformulate the nonlinear equations governing active and reactive power balance. The results show that the proposed framework effectively and efficiently solves both linear and nonlinear power system problems, and thus offers significant advantages in scenarios where traditional solvers face challenges, such as ill-conditioned systems and fault conditions.
Similar Papers
Performance Comparison of Gate-Based and Adiabatic Quantum Computing for Power Flow Analysis
Quantum Physics
Helps power grids work better with new computers.
Problem-Structure-Informed Quantum Approximate Optimization Algorithm for Large-Scale Unit Commitment with Limited Qubits
Systems and Control
Solves power grid problems with fewer quantum computers.
Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers
Quantum Physics
Solves hard problems faster than quantum computers.