IEEE Transportation Electrification Conference and Expo
Contingency Analysis via QAOA in the NISQ Era
Joseph Maxwell Lange, Yan Li
Abstract
In power systems, contingency analysis evaluates “what-if” scenarios to assess the impact of component failures. Traditionally, this analysis has focused on ensuring system stability under the loss of a single component ($N-1$), such as a transmission line, load, or generator. However, the increasing prevalence of malicious attacks and extreme events leading to cascading failures has made it necessary to consider the simultaneous loss of multiple components ($N-k$, where $k\gt 1$). $N-k$ contingency analysis is often NP-hard, rendering largescale implementations intractable using classical computational methods. The Quantum Approximate Optimization Algorithm (QAOA) provides a promising framework for addressing such NP-hard problems. In this paper, QAOA is applied to solve the $N-k$ contingency analysis problem on the IEEE 9-bus system using two distinct contingency formulations. QAOA enables the approximation of solutions to this NP-hard problem with polynomial scaling. These results demonstrate the potential of quantum computing to address complex, real-world challenges in power systems in the near term. With the rapid advancement and accessibility of Noisy Intermediate-Scale Quantum (NISQ) devices, the development of quantum algorithms capable of solving classically intractable problems while remaining implementable on near-term hardware represents a critical and timely area of research. QAOA is therefore evaluated for its suitability on NISQ hardware through its application to increasingly important contingency analysis problems.