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

IEEE Transportation Electrification Conference and Expo

Contingency Analysis via QAOA in the NISQ Era

Joseph Maxwell Lange, Yan Li

Published Jun 10, 2026• 0 citations
Publisher

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.

DOI
10.1109/iteceats66641.2026.11592846

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

Quantum Approximate Optimization Algorithm (QAOA) for Solving NP-Hard Problems

Srikanth Kilaru, Thota Sravya Vardhani, Attluri Udaya Lakshmi +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.

IEEE Nexo-Tech International Conference on Advanced Technologies and Innovations (ICATI)•May 8, 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 Approximate Optimization Algorithm on Different Qubit Systems

Seongmin Kim, In‐Saeng Suh, E. A. Coello Pérez +6 more

Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.

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

Quantum Computing For Combinatorial Optimization: Algorithms, Complexity Analysis, And Real-World Applications.

G. Swapna, P. Sunil

Combinatorial optimization problems play a vital role in computer science and engineering, with applications in logistics, network design, finance, and resource allocation. However, many of these problems are NP-hard, making them computationally expensive to solve using classical optimization techniques, especially for large-scale instances. In recent years, quantum computing has emerged as a promising paradigm capable of addressing these limitations by leveraging quantum mechanical principles such as superposition and entanglement. This study investigates the application of quantum computing for solving combinatorial optimization problems, with a focus on algorithm design, complexity analysis, and real-world applicability. The research primarily employs the Quantum Approximate Optimization Algorithm (QAOA) and Grover's search algorithm to solve representative problems such as Max-Cut and the Knapsack problem. The performance of these algorithms is evaluated using key metrics including accuracy, execution time, and approximation ratio, and is compared with classical optimization techniques. The results demonstrate that QAOA is capable of generating near-optimal solutions, achieving accuracy levels of up to 93% for small problem instances. However, the study also highlights the challenges associated with current quantum systems, including noise, limited qubit availability, and increased execution time. Comparative analysis reveals that while classical methods remain more efficient for small-scale problems, quantum algorithms show significant potential for scalability and handling complex optimization tasks. The findings suggest that hybrid quantum-classical approaches offer a practical solution in the current Noisy Intermediate-Scale Quantum (NISQ) era. The study concludes that although quantum computing is still evolving, it holds strong potential for transforming combinatorial optimization in the future.

•Jan 1, 2026•0 citations
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 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.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.
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.
Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.
Combinatorial optimization problems play a vital role in computer science and engineering, with applications in logistics, network design, finance, and resource allocation. However, many of these problems are NP-hard, making them computationally expensive to solve using classical optimization techniques, especially for large-scale instances. In recent years, quantum computing has emerged as a promising paradigm capable of addressing these limitations by leveraging quantum mechanical principles such as superposition and entanglement. This study investigates the application of quantum computing for solving combinatorial optimization problems, with a focus on algorithm design, complexity analysis, and real-world applicability. The research primarily employs the Quantum Approximate Optimization Algorithm (QAOA) and Grover's search algorithm to solve representative problems such as Max-Cut and the Knapsack problem. The performance of these algorithms is evaluated using key metrics including accuracy, execution time, and approximation ratio, and is compared with classical optimization techniques. The results demonstrate that QAOA is capable of generating near-optimal solutions, achieving accuracy levels of up to 93% for small problem instances. However, the study also highlights the challenges associated with current quantum systems, including noise, limited qubit availability, and increased execution time. Comparative analysis reveals that while classical methods remain more efficient for small-scale problems, quantum algorithms show significant potential for scalability and handling complex optimization tasks. The findings suggest that hybrid quantum-classical approaches offer a practical solution in the current Noisy Intermediate-Scale Quantum (NISQ) era. The study concludes that although quantum computing is still evolving, it holds strong potential for transforming combinatorial optimization in the future.