International Conference on Data Science and Business Systems (ICDSBS)
Order N – k Contingency Analysis in Large Scale Power Grids using Quantum Approximate Optimization Algorithm
Hruday Divakaran, Gayathri Mani, Venakt Vishal Mangipudi, Sneh Patel, Shaleen Soni, Mangalagowri R, Subramani C
Abstract
High-order contingencies (N −k) identification is critical for maintaining the resilience of power systems, but this problem is challenged by the combinatorial explosion, making it difficult to solve using traditional exhaustive search methods for large-scale power grids. In this paper, we introduce the first quantum solution for N −k contingency analysis using the Quantum Approximate Optimization Algorithm (QAOA). By formulating the voltage stability indices (Lmn) in a quantum cost Hamiltonian with a high-contrast penalty logic, we show that the quantum solution is capable of identifying the isolation of critical failures in the IEEE 118-bus test system. The proposed solution goes beyond the traditional N−1 analysis by leveraging the power of quantum superposition to simultaneously assess millions of possible failure configurations. We successfully demonstrated the hardware validation of high-order N−k analysis on the 133-qubit IBM Torino processor. By utilizing a multi-tier error suppression strategy including Pauli twirling, dynamical decoupling, and ZNE-mitigated optimization where we achieve an approximation ratio (α) of 0.8675 for N−2 and 0.8350 for N−3 contingencies, proving the viability on Heron-class hardware. These results confirm an accurate and efficient solution for real-time power grid security analysis, providing a theoretical basis for the development of quantum strategies in power grid management.