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

Scientific Reports

Quantum contingency analysis for power system steady-state security identification

Fei Feng, Yifan Zhou, Mikhail A. Bragin, Y. Shamash, Peng Zhang

Published Apr 30, 2025• 5 citations
Publisher

Abstract

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.

DOI
10.1038/s41598-025-98776-5

Related papers

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

Order N – k Contingency Analysis in Large Scale Power Grids using Quantum Approximate Optimization Algorithm

Hruday Divakaran, Gayathri Mani, Venakt Vishal Mangipudi +4 more

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.

International Conference on Data Science and Business Systems (ICDSBS)•May 1, 2026•0 citations

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 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 Computing Approaches to Time-Domain Simulation of Electromagnetic Transients in Interconnected Power Systems

Shaik Anjimoon, Swathi Basawaraiu, Rajeev Sobti +3 more

The advent of quantum computing has heralded unprecedented possibilities in diverse scientific domains, including electrical engineering. This research paper delves into the innovative integration of quantum computing methodologies for the time-domain simulation of electromagnetic transients in interconnected power systems. Electromagnetic transients are pivotal phenomena that influence the stability, reliability, and efficiency of power systems, necessitating accurate and rapid simulation techniques. Classical computational paradigms, albeit powerful, encounter substantial limitations in terms of computational speed and capacity when dealing with large-scale, complex interconnected power networks. To address these challenges, this paper introduces quantum algorithms that leverage the principles of superposition and entanglement, ensuring a quantum leap in simulation capabilities. A comprehensive comparison with conventional simulation methodologies is presented, highlighting the quantum algorithms' superior efficiency and precision. The quantum circuit models for various power system components are meticulously constructed and optimized for quantum resource utilization. Furthermore, the paper explores error mitigation strategies and quantum error correction codes tailored for power system applications, ensuring robustness in the presence of quantum noise and decoherence. The empirical results, obtained from simulations on quantum processors and simulators, underscore the substantial advantages and potential of quantum computing in revolutionizing electromagnetic transient analysis. This research not only paves the way for accelerated and accurate simulations but also contributes to the enhanced stability and reliability of modern interconnected power systems.

International Conference on Power Energy, Environment and Intelligent Control (PEEIC)•Dec 19, 2023•1 citation

Noisy-intermediate-scale quantum power system state estimation

Fei Feng, Peng Zhang, Yifan Zhou +1 more

Quantum power system state estimation (QPSSE) offers an inspiring direction for tackling the challenge of state estimation through quantum computing. Nevertheless, the current bottlenecks originate from the scarcity of practical and scalable QPSSE methodologies in the noisy intermediate-scale quantum (NISQ) era. This paper devises a NISQ-QPSSE algorithm that facilitates state estimation on real NISQ devices. Our new contributions include: (1) A variational quantum circuit (VQC)-based QPSSE formulation that empowers QPSSE analysis utilizing shallow-depth quantum circuits; (2) A variational quantum linear solver (VQLS)-based QPSSE solver integrating QPSSE iterations with VQC optimization; (3) An advanced NISQ-compatible QPSSE methodology for tackling the measurement and coefficient matrix issues on real quantum computers; (4) A noise-resilient method to alleviate the detrimental effects of noise disturbances. The encouraging test results on the simulator and real-scale systems affirm the precision, universality, and scalability of our QPSSE algorithm and demonstrate the vast potential of QPSSE in the thriving NISQ era.

iEnergy•Sep 1, 2024•8 citations
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.
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.
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 advent of quantum computing has heralded unprecedented possibilities in diverse scientific domains, including electrical engineering. This research paper delves into the innovative integration of quantum computing methodologies for the time-domain simulation of electromagnetic transients in interconnected power systems. Electromagnetic transients are pivotal phenomena that influence the stability, reliability, and efficiency of power systems, necessitating accurate and rapid simulation techniques. Classical computational paradigms, albeit powerful, encounter substantial limitations in terms of computational speed and capacity when dealing with large-scale, complex interconnected power networks. To address these challenges, this paper introduces quantum algorithms that leverage the principles of superposition and entanglement, ensuring a quantum leap in simulation capabilities. A comprehensive comparison with conventional simulation methodologies is presented, highlighting the quantum algorithms' superior efficiency and precision. The quantum circuit models for various power system components are meticulously constructed and optimized for quantum resource utilization. Furthermore, the paper explores error mitigation strategies and quantum error correction codes tailored for power system applications, ensuring robustness in the presence of quantum noise and decoherence. The empirical results, obtained from simulations on quantum processors and simulators, underscore the substantial advantages and potential of quantum computing in revolutionizing electromagnetic transient analysis. This research not only paves the way for accelerated and accurate simulations but also contributes to the enhanced stability and reliability of modern interconnected power systems.
Quantum power system state estimation (QPSSE) offers an inspiring direction for tackling the challenge of state estimation through quantum computing. Nevertheless, the current bottlenecks originate from the scarcity of practical and scalable QPSSE methodologies in the noisy intermediate-scale quantum (NISQ) era. This paper devises a NISQ-QPSSE algorithm that facilitates state estimation on real NISQ devices. Our new contributions include: (1) A variational quantum circuit (VQC)-based QPSSE formulation that empowers QPSSE analysis utilizing shallow-depth quantum circuits; (2) A variational quantum linear solver (VQLS)-based QPSSE solver integrating QPSSE iterations with VQC optimization; (3) An advanced NISQ-compatible QPSSE methodology for tackling the measurement and coefficient matrix issues on real quantum computers; (4) A noise-resilient method to alleviate the detrimental effects of noise disturbances. The encouraging test results on the simulator and real-scale systems affirm the precision, universality, and scalability of our QPSSE algorithm and demonstrate the vast potential of QPSSE in the thriving NISQ era.