Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

Published May 1, 2026• 0 citations
Publisher

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.

DOI
10.1109/icdsbs69077.2026.11634835

Related papers

Contingency Analysis via QAOA in the NISQ Era

Joseph Maxwell Lange, Yan Li

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.

IEEE Transportation Electrification Conference and Expo•Jun 10, 2026•0 citations

Quantum contingency analysis for power system steady-state security identification

Fei Feng, Yifan Zhou, Mikhail A. Bragin +2 more

Unprecedented extreme climate events cause devastating infrastructure outages within power systems. Comprehensive outage identification is essential for the identification of critical components to ensure the uninterrupted power supply in a secure manner to withstand extreme weather events. Accurate outage identification, however, requires simulations of a large number of outage scenarios necessitating highly scalable computations thus challenging classical computing paradigms. Quantum computing provides a promising resolution by exploiting exponential scalability achieved through superposition and entanglement of voltage states. This paper devises a quantum contingency analysis (QCA) method to identify outage scenarios on Noisy Intermediate-Scale Quantum (NISQ) devices. Advanced quantum circuits incorporating Pauli-twirling, dynamic decoupling, and matrix-free measurement are designed to mitigate hardware-induced errors. A preconditioned hybrid method is devised to alleviate the computation burden of parameter optimization of quantum gates. Case studies identify line and generation outages via QCA in typical power systems. Our research underscores that quantum computing exhibits exponential scalability in identifying power grid outages and critical components.

Scientific Reports•Apr 30, 2025•5 citations

Quantum Computing-Enabled Contingency Analysis for Power Systems

Yuqi Jiang, Zhiding Liang, Yan Li +2 more

The rapid development of quantum computing has provided a ground-breaking tool for solving problems that are insurmountable on classical computers. In the power system domain, quantum computing is still in the nascent stage, with limited but ongoing studies. The Quantum Approximation Optimization Algorithm (QAOA) has been applied in solving several NPhard problems and can be further studied to address challenging problems in power systems. Key applications include contingency analysis, optimal power flow, and unit commitment, among others. With the significant integration of renewable energy, the intermittent nature of renewable energy introduces substantial volatility to the system. An overhead contingency analysis is required to evaluate the possible system outage scenarios, which will identify critical contingencies to maintain system stability. However, the contingency analysis is a prototypical NP-Hard problem, requiring substantial classical computation resources. In this work, QAOA is developed for the$N-k$contingency analysis on line contingency as well as the general contingency scenarios, with the aim of minimizing the shedding of the power load while ensuring the power flow constraints. A tailored objective function is developed to encode the$N-k$contingency condition as well as the power flow loss constraints into a problem Hamiltonian for QAOA computation. The developed method is verified on IEEE 9- and 14-bus systems compared with classical methods as the baseline. In addition, a QAOA parameter study including the number of QAOA parameters, the number of repetitions of the quantum circuits execution, and the number of iteration steps of the classical optimization algorithm, is conducted to offer insights for the parameter tuning under different problem sizes. This work is anticipated to establish a quantum framework for solving critical and complex power system problems in the Noisy intermediate-scale quantum (NISQ) era.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Quantum Computing for Enhancing Power System Stability in Smart Grids

Sandip D. Satav, Mahendra Kumar B, P. Lakshmi Prabha +3 more

The quick incorporation of renewable energy resources into smart grid has exacerbated issues with voltage stability, frequency variations and cascading failures due to unpredictable renewable energy generation and extreme weather. The conventional classical approaches of power flow analysis and stability assessment face the challenge of computational complexity, and are not so useful in real-time decision making under large-scale systems. In this paper, a hybrid quantum/classical approach is introduced, comprising quantum-enhanced forecasting, an efficient power flow computation using the Harrow-Hassidim-Lloyd (HHL) algorithm and a quadratic unconstrained binary optimization (QUBO) for stability-constrained distributed energy resource allocation. The proposed approach allows to put all these parts together in a single pipeline and manage contingencies proactively and optimize resource deployment. Results using simulation on typical test systems have revealed significant advantages such as 15 times faster execution time than conventional fast decoupled load flow, 52% load shedding reduction, 56% lower mean absolute error on bus voltage magnitude and improved minimum bus voltage level (above 0.95 p.u.) under severe contingencies. The results demonstrate the potential of the framework to be a major contribution towards power system resilience and to reliably integrate the renewables in the future smart grid.

•Sep 1, 2026•0 citations

Quantum-Enhanced Reinforcement Learning for Power Grid Security Assessment

B. Peter, Mert Korkali

The increasingly challenging task of maintaining power grid security requires innovative solutions. Novel approaches using reinforcement learning (RL) agents have been proposed to help grid operators navigate the massive decision space and nonlinear behavior of these complex networks. However, applying RL to the assessment of the security of the power grid, specifically for combinatorially difficult contingency analysis problems, has proven to be difficult to scale. The integration of quantum computing into these RL frameworks helps scale by improving computational efficiency and boosting agent proficiency by leveraging quantum advantages in action exploration and model-based interdependence. To demonstrate a proof-of-concept use of quantum computing for RL agent training and simulation, we propose a hybrid agent that runs on quantum hardware using IBM’s Qiskit Runtime. We also provide detailed insight into the construction of parameterized quantum circuits (PQCs) to generate relevant quantum output. The increased ability of this agent to maintain grid stability is demonstrated relative to a reference model without quantum enhancement using N − k contingency analysis. Additionally, we offer a comparative assessment of the training procedures for RL models integrated with a quantum backend.

North American Power Symposium (NAPS)•Oct 26, 2025•1 citation

PACE-QAOA: Physics-Constrained Quantum Optimization for Qubit-Efficient Power System Islanding

Yuqi Jiang, Zhiding Liang, Qiang Guan +2 more

Increasing renewable-energy penetration heightens power-system variability and complicates disturbance containment. Controlled islanding mitigates cascading failures by partitioning a stressed network to limit disrupted power transfer while preserving each island's operational integrity, but this constrained partitioning problem is NP-hard. Although QAOA offers a complementary search strategy, limited near-term qubit capacity restricts conventional formulations. This paper presents a qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement. The encoding exploits grid structure while formally preserving the original feasible solution space and objective. For a fixed island count on sparse working graphs, the formulation reduces phase-separator and per-layer gate complexity from quadratic to linear scaling with system size. Tests on eight IEEE systems ranging from 9 to 89 buses and multiple quantum-provider backends produce feasible, high-quality islanding solutions under practical circuit and sampling budgets. Factorial ablation attributes resource and runtime improvements to the complementary effects of compact encoding and qubit-efficient constraint handling. Noise analysis shows stable solution quality under tested device noise, while landscape diagnostics reveal smoother, more consistently scaled QAOA cost surfaces and improved parameter-optimization behavior. These results offer a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.

quant-pharXiv:2608.02789•Aug 5, 2026•2 citations
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.
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−1N-1N−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−kN-kN−k, where k>1k\gt 1k>1). N−kN-kN−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−kN-kN−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.
Unprecedented extreme climate events cause devastating infrastructure outages within power systems. Comprehensive outage identification is essential for the identification of critical components to ensure the uninterrupted power supply in a secure manner to withstand extreme weather events. Accurate outage identification, however, requires simulations of a large number of outage scenarios necessitating highly scalable computations thus challenging classical computing paradigms. Quantum computing provides a promising resolution by exploiting exponential scalability achieved through superposition and entanglement of voltage states. This paper devises a quantum contingency analysis (QCA) method to identify outage scenarios on Noisy Intermediate-Scale Quantum (NISQ) devices. Advanced quantum circuits incorporating Pauli-twirling, dynamic decoupling, and matrix-free measurement are designed to mitigate hardware-induced errors. A preconditioned hybrid method is devised to alleviate the computation burden of parameter optimization of quantum gates. Case studies identify line and generation outages via QCA in typical power systems. Our research underscores that quantum computing exhibits exponential scalability in identifying power grid outages and critical components.
The rapid development of quantum computing has provided a ground-breaking tool for solving problems that are insurmountable on classical computers. In the power system domain, quantum computing is still in the nascent stage, with limited but ongoing studies. The Quantum Approximation Optimization Algorithm (QAOA) has been applied in solving several NPhard problems and can be further studied to address challenging problems in power systems. Key applications include contingency analysis, optimal power flow, and unit commitment, among others. With the significant integration of renewable energy, the intermittent nature of renewable energy introduces substantial volatility to the system. An overhead contingency analysis is required to evaluate the possible system outage scenarios, which will identify critical contingencies to maintain system stability. However, the contingency analysis is a prototypical NP-Hard problem, requiring substantial classical computation resources. In this work, QAOA is developed for theN−kN-kN−kcontingency analysis on line contingency as well as the general contingency scenarios, with the aim of minimizing the shedding of the power load while ensuring the power flow constraints. A tailored objective function is developed to encode theN−kN-kN−kcontingency condition as well as the power flow loss constraints into a problem Hamiltonian for QAOA computation. The developed method is verified on IEEE 9- and 14-bus systems compared with classical methods as the baseline. In addition, a QAOA parameter study including the number of QAOA parameters, the number of repetitions of the quantum circuits execution, and the number of iteration steps of the classical optimization algorithm, is conducted to offer insights for the parameter tuning under different problem sizes. This work is anticipated to establish a quantum framework for solving critical and complex power system problems in the Noisy intermediate-scale quantum (NISQ) era.
The quick incorporation of renewable energy resources into smart grid has exacerbated issues with voltage stability, frequency variations and cascading failures due to unpredictable renewable energy generation and extreme weather. The conventional classical approaches of power flow analysis and stability assessment face the challenge of computational complexity, and are not so useful in real-time decision making under large-scale systems. In this paper, a hybrid quantum/classical approach is introduced, comprising quantum-enhanced forecasting, an efficient power flow computation using the Harrow-Hassidim-Lloyd (HHL) algorithm and a quadratic unconstrained binary optimization (QUBO) for stability-constrained distributed energy resource allocation. The proposed approach allows to put all these parts together in a single pipeline and manage contingencies proactively and optimize resource deployment. Results using simulation on typical test systems have revealed significant advantages such as 15 times faster execution time than conventional fast decoupled load flow, 52% load shedding reduction, 56% lower mean absolute error on bus voltage magnitude and improved minimum bus voltage level (above 0.95 p.u.) under severe contingencies. The results demonstrate the potential of the framework to be a major contribution towards power system resilience and to reliably integrate the renewables in the future smart grid.
The increasingly challenging task of maintaining power grid security requires innovative solutions. Novel approaches using reinforcement learning (RL) agents have been proposed to help grid operators navigate the massive decision space and nonlinear behavior of these complex networks. However, applying RL to the assessment of the security of the power grid, specifically for combinatorially difficult contingency analysis problems, has proven to be difficult to scale. The integration of quantum computing into these RL frameworks helps scale by improving computational efficiency and boosting agent proficiency by leveraging quantum advantages in action exploration and model-based interdependence. To demonstrate a proof-of-concept use of quantum computing for RL agent training and simulation, we propose a hybrid agent that runs on quantum hardware using IBM’s Qiskit Runtime. We also provide detailed insight into the construction of parameterized quantum circuits (PQCs) to generate relevant quantum output. The increased ability of this agent to maintain grid stability is demonstrated relative to a reference model without quantum enhancement using N − k contingency analysis. Additionally, we offer a comparative assessment of the training procedures for RL models integrated with a quantum backend.
Increasing renewable-energy penetration heightens power-system variability and complicates disturbance containment. Controlled islanding mitigates cascading failures by partitioning a stressed network to limit disrupted power transfer while preserving each island's operational integrity, but this constrained partitioning problem is NP-hard. Although QAOA offers a complementary search strategy, limited near-term qubit capacity restricts conventional formulations. This paper presents a qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement. The encoding exploits grid structure while formally preserving the original feasible solution space and objective. For a fixed island count on sparse working graphs, the formulation reduces phase-separator and per-layer gate complexity from quadratic to linear scaling with system size. Tests on eight IEEE systems ranging from 9 to 89 buses and multiple quantum-provider backends produce feasible, high-quality islanding solutions under practical circuit and sampling budgets. Factorial ablation attributes resource and runtime improvements to the complementary effects of compact encoding and qubit-efficient constraint handling. Noise analysis shows stable solution quality under tested device noise, while landscape diagnostics reveal smoother, more consistently scaled QAOA cost surfaces and improved parameter-optimization behavior. These results offer a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.