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 Power Engineering Society General Meeting

Interoperation Analysis of Reconfigurable Networked Microgrids through Quantum Approximate Optimization Algorithm

Hang Jing, Ye Wang, Yan Li

Published Jul 17, 2022• 3 citations
Publisher

Abstract

The maximum power exchange section is playing an important role in analyzing the interoperation of network microgrids. Mathematically, the problem is formulated into a weighted Max-Cut problem, which is non-deterministic polynomial-time hard (NP-hard). A Quantum Approximate Optimization Algorithm (QAOA) is introduced in this paper to search the approximate maximum power exchange sections in networked microgrids. QAOA is a hybrid quantum-classical algorithm, which uses a classical optimizer to train a parametrized quantum circuit. Layer number and angle parameters of the quantum circuit are discussed, which highly impact the performance of QAOA. Numerical examples on a typical reconfigurable networked microgrid system test and verify the effectiveness of QAOA in getting the maximum power exchange sections. This quantum computing implementation sheds light on the development of quantum algorithms to resolve the challenges in power systems that are hard to solve by classical computers.

DOI
10.1109/pesgm48719.2022.9916769

Related papers

Quantum Approximate Optimization Algorithm-Enabled DER Disturbance Analysis of Networked Microgrids

Hang Jing, Ye Wang, Yan Li +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is applied to Networked Microgrids (NMs) in this paper to search for the maximum power exchange section, which is playing an essential role in operating NMs. Mathematically, obtaining the maximum power section is to solve a Max-Cut problem over the modeling graph of NMs. Considering the integration and fluctuations of Distributed Energy Resources (DERs), the maximum power section will change frequently. To efficiently get the section, QAOA provides a powerful solution by leveraging quantum resources. The performance of QAOA highly depends on the critical parameters of quantum circuits. We find the designed parameters for QAOA are still effective under wide range change of output power of energy resources. Tests on a typical NMs system verify the effectiveness of the QAOA method in efficiently searching for the maximum power sections of NMs.

IEEE Energy Conversion Congress and Exposition (ECCE)•Oct 9, 2022•5 citations

Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem

Gavin E. Crooks

The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently know about the capabilities of QAOA, or of the difficulty of the requisite parameters optimization. Here, we study the performance of QAOA on the MaxCut combinatorial optimization problem, optimizing the quantum circuits on a classical computer using automatic differentiation and stochastic gradient descent, using QuantumFlow, a quantum circuit simulator implemented with TensorFlow. We find that we can amortize the training cost by optimizing on batches of problems instances; that QAOA can exceed the performance of the classical polynomial time Goemans-Williamson algorithm with modest circuit depth, and that performance with fixed circuit depth is insensitive to problem size. Moreover, MaxCut QAOA can be efficiently implemented on a gate-based quantum computer with limited qubit connectivity, using a qubit swap network. These observations support the prospects that QAOA will be an effective method for solving interesting problems on near-term quantum computers.

arXiv:1811.08419•Bulletin of the American Physical Society•Nov 20, 2018•340 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 Combinatorial Optimization Algorithms for Network Reconfiguration: QRAO vs. QAOA

Anh Phuong Ngo, Hieu Trung Nguyen

This paper reviews a hybrid quantum-classical distributed algorithm for NP-hard combinatorial optimization problems, which is embedded in IBM Qiskit's Alternating Direction Method of Multipliers (ADMM) optimizer. We demonstrate a proof of concept for solving Mixed-Integer Convex Programs (MICP) in power system applications using a use case on power distribution network reconfiguration in IBM quantum computers. Using the Qiskit ADMM optimizer, the MICP is decomposed into two subproblems: a quadratic unconstrained binary optimization (QUBO) solved by quantum algorithms and a convex one solved by classical solvers. Our essential contribution is integrating the Quantum Random Access Optimization (QRAO) into the quantum-classical distributed framework and the existing Quantum Approximate Optimization Algorithm (QAOA) implemented in the Qiskit ADMM Optimizer. QRAO utilizes Quantum Random Access Codes (QRACs) to minimize qubit requirements and utilizes quantum state rounding for solution extraction. We examine the impact of noise on solutions derived from QRAO and compare them with results from QAOA using a use case on network reconfiguration in response to faults in the power distribution system.

North American Power Symposium (NAPS)•Oct 13, 2024•9 citations

Design of quantum approximation optimization algorithm for the maximum cut problem

Yun-Jiang Wang, XI Huiming, XIAO Zhuoyan +2 more

The max-cut problem (MCP) is a classic problem in the field of combinatorial optimization and has important applications in various fields, including statistical physics and image processing. However, except for some special cases, the MCP still encounters a non-deterministic polynomial complete problem (an NP-complete problem), and there is currently no known efficient classical algorithm that can solve it in polynomial time. The quantum approximate optimization algorithm (QAOA), as a pivotal algorithm in the noisy intermediate-scale quantum (NISQ) computing era, has shown significant potential for solving the MCP. However, due to the lack of quantum error correction, the reliability of computations in NISQ systems sharply declines as the circuit depth of the algorithm increases. Therefore, designing an efficient, shallow-depth, and low-complexity QAOA for the MCP is a critical challenge in demonstrating the advantages of quantum computing in the NISQ era.In this paper, according to the standard QAOA algorithm, we introduce Pauli Y rotation gates into the target Hamiltonian circuit for the MCP. By enhancing the flexibility of quantum trial functions and improving the efficiency of Hilbert space exploration within a single iteration, we significantly improve the performance of QAOA on the MCP.We conduct extensive numerical simulations using the MindSpore quantum platform, and compare the proposed RY-layer-assisted QAOA with standard QAOA and its existing variants, including MA-QAOA and QAOA+. The experiments are performed on various graph types, including complete graphs, 3-regular graphs, 4-regular graphs, and random graphs with edge probabilities between 0.3 and 0.5. Our results show that the RY-layer-assisted QAOA achieves higher approximation ratios in all graph types, particularly in regular and random graphs, where traditional QAOA variants are difficult to implement. Moreover, the proposed method exhibits strong robustness as the graph size increases, and can maintain high performance even for larger graphs. Importantly, the RY-layer-assisted QAOA requires fewer CNOT gates and has a lower circuit depth than the standard QAOA and its variants, making it more suitable for NISQ devices with limited coherence times and high error rates.In conclusion, the RY-layer-assisted QAOA provides a promising approach for solving MCP in the NISQ era. By improving the approximation ratio while reducing circuit complexity, this method demonstrates significant potential for practical quantum computing applications, thus paving the way for developing more efficient and reliable quantum optimization algorithms.

Acta Physica Sinica•Jan 1, 2025•1 citation

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
The maximum power exchange section is playing an important role in analyzing the interoperation of network microgrids. Mathematically, the problem is formulated into a weighted Max-Cut problem, which is non-deterministic polynomial-time hard (NP-hard). A Quantum Approximate Optimization Algorithm (QAOA) is introduced in this paper to search the approximate maximum power exchange sections in networked microgrids. QAOA is a hybrid quantum-classical algorithm, which uses a classical optimizer to train a parametrized quantum circuit. Layer number and angle parameters of the quantum circuit are discussed, which highly impact the performance of QAOA. Numerical examples on a typical reconfigurable networked microgrid system test and verify the effectiveness of QAOA in getting the maximum power exchange sections. This quantum computing implementation sheds light on the development of quantum algorithms to resolve the challenges in power systems that are hard to solve by classical computers.
The Quantum Approximate Optimization Algorithm (QAOA) is applied to Networked Microgrids (NMs) in this paper to search for the maximum power exchange section, which is playing an essential role in operating NMs. Mathematically, obtaining the maximum power section is to solve a Max-Cut problem over the modeling graph of NMs. Considering the integration and fluctuations of Distributed Energy Resources (DERs), the maximum power section will change frequently. To efficiently get the section, QAOA provides a powerful solution by leveraging quantum resources. The performance of QAOA highly depends on the critical parameters of quantum circuits. We find the designed parameters for QAOA are still effective under wide range change of output power of energy resources. Tests on a typical NMs system verify the effectiveness of the QAOA method in efficiently searching for the maximum power sections of NMs.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently know about the capabilities of QAOA, or of the difficulty of the requisite parameters optimization. Here, we study the performance of QAOA on the MaxCut combinatorial optimization problem, optimizing the quantum circuits on a classical computer using automatic differentiation and stochastic gradient descent, using QuantumFlow, a quantum circuit simulator implemented with TensorFlow. We find that we can amortize the training cost by optimizing on batches of problems instances; that QAOA can exceed the performance of the classical polynomial time Goemans-Williamson algorithm with modest circuit depth, and that performance with fixed circuit depth is insensitive to problem size. Moreover, MaxCut QAOA can be efficiently implemented on a gate-based quantum computer with limited qubit connectivity, using a qubit swap network. These observations support the prospects that QAOA will be an effective method for solving interesting problems on near-term quantum computers.
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.
This paper reviews a hybrid quantum-classical distributed algorithm for NP-hard combinatorial optimization problems, which is embedded in IBM Qiskit's Alternating Direction Method of Multipliers (ADMM) optimizer. We demonstrate a proof of concept for solving Mixed-Integer Convex Programs (MICP) in power system applications using a use case on power distribution network reconfiguration in IBM quantum computers. Using the Qiskit ADMM optimizer, the MICP is decomposed into two subproblems: a quadratic unconstrained binary optimization (QUBO) solved by quantum algorithms and a convex one solved by classical solvers. Our essential contribution is integrating the Quantum Random Access Optimization (QRAO) into the quantum-classical distributed framework and the existing Quantum Approximate Optimization Algorithm (QAOA) implemented in the Qiskit ADMM Optimizer. QRAO utilizes Quantum Random Access Codes (QRACs) to minimize qubit requirements and utilizes quantum state rounding for solution extraction. We examine the impact of noise on solutions derived from QRAO and compare them with results from QAOA using a use case on network reconfiguration in response to faults in the power distribution system.
The max-cut problem (MCP) is a classic problem in the field of combinatorial optimization and has important applications in various fields, including statistical physics and image processing. However, except for some special cases, the MCP still encounters a non-deterministic polynomial complete problem (an NP-complete problem), and there is currently no known efficient classical algorithm that can solve it in polynomial time. The quantum approximate optimization algorithm (QAOA), as a pivotal algorithm in the noisy intermediate-scale quantum (NISQ) computing era, has shown significant potential for solving the MCP. However, due to the lack of quantum error correction, the reliability of computations in NISQ systems sharply declines as the circuit depth of the algorithm increases. Therefore, designing an efficient, shallow-depth, and low-complexity QAOA for the MCP is a critical challenge in demonstrating the advantages of quantum computing in the NISQ era.In this paper, according to the standard QAOA algorithm, we introduce Pauli Y rotation gates into the target Hamiltonian circuit for the MCP. By enhancing the flexibility of quantum trial functions and improving the efficiency of Hilbert space exploration within a single iteration, we significantly improve the performance of QAOA on the MCP.We conduct extensive numerical simulations using the MindSpore quantum platform, and compare the proposed RY-layer-assisted QAOA with standard QAOA and its existing variants, including MA-QAOA and QAOA+. The experiments are performed on various graph types, including complete graphs, 3-regular graphs, 4-regular graphs, and random graphs with edge probabilities between 0.3 and 0.5. Our results show that the RY-layer-assisted QAOA achieves higher approximation ratios in all graph types, particularly in regular and random graphs, where traditional QAOA variants are difficult to implement. Moreover, the proposed method exhibits strong robustness as the graph size increases, and can maintain high performance even for larger graphs. Importantly, the RY-layer-assisted QAOA requires fewer CNOT gates and has a lower circuit depth than the standard QAOA and its variants, making it more suitable for NISQ devices with limited coherence times and high error rates.In conclusion, the RY-layer-assisted QAOA provides a promising approach for solving MCP in the NISQ era. By improving the approximation ratio while reducing circuit complexity, this method demonstrates significant potential for practical quantum computing applications, thus paving the way for developing more efficient and reliable quantum optimization algorithms.
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.