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

The computational power of quantum approximate optimization algorithms

Ryan Maamer

Published Jan 1, 2022• 0 citations
OpenAlex

Related papers

Interoperation Analysis of Reconfigurable Networked Microgrids through Quantum Approximate Optimization Algorithm

Hang Jing, Ye Wang, Yan Li

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.

IEEE Power Engineering Society General Meeting•Jul 17, 2022•3 citations

Quantum Approximate Optimization Algorithm: Applications, Limitations and Enhancement

Pablo Herrero Gómez, Marcos Alemany Manzanaro, David Gil +1 more

Communications in computer and information science•Jan 1, 2026•0 citations

Implementation of a Quantum Approximate Optimization Algorithm for Continuous Variables with Qiskit

Luna, Miguel, Vedant Patare, Gamzepelin Aksoy +1 more

In this paper, we propose a quantum approximate optimization algorithm (QAOA) for solving continuous-variable optimization problems on gate-based universal quantum computers. Our approach exploits the power of quantum computing to explore the solution space efficiently and find approximate optima. We demonstrate the effectiveness of our algorithm by solving a quadratic program, testing different combinations of mixer operators, numbers of repetitions and optimizers. The optimizer and the number of repetitions had the greatest effect size. The best performance was achieved using the SPSA optimizer, three repetitions, and the binary X mixer.

•Oct 1, 2025•0 citations

Quantum Approximate Optimization Algorithm

Tokuhiro, Lena

•Jan 1, 2025•0 citations

Data-driven quantum approximate optimization algorithm for power systems

Hang Jing, Ye Wang, Yan Li

Abstract Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems. It is especially promising for Distributed Energy Resources (DERs) dominant systems that have been widely developed to promote energy sustainability. In those systems, knowing the maximum sections of power and data delivery is essential for monitoring, operation, and control. However, high computational effort is required. By leveraging quantum resources, Quantum Approximate Optimization Algorithm (QAOA) provides a means to search for these sections efficiently. However, QAOA performance relies heavily on critical parameters, especially for weighted graphs. Here we present a data-driven QAOA, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density. We verify the strategy with 39,774 expectation value calculations. Without parameter optimization, our data-driven QAOA is comparable with the Goemans-Williamson algorithm. This work advances QAOA and pilots its practical application to power systems in noisy intermediate-scale quantum devices.

arXiv:2204.00738•Communications Engineering•Mar 9, 2023•60 citations

Quantum Approximate Optimization

Kevin Thompson

•May 1, 2023•1 citation
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.
In this paper, we propose a quantum approximate optimization algorithm (QAOA) for solving continuous-variable optimization problems on gate-based universal quantum computers. Our approach exploits the power of quantum computing to explore the solution space efficiently and find approximate optima. We demonstrate the effectiveness of our algorithm by solving a quadratic program, testing different combinations of mixer operators, numbers of repetitions and optimizers. The optimizer and the number of repetitions had the greatest effect size. The best performance was achieved using the SPSA optimizer, three repetitions, and the binary X mixer.
Abstract Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems. It is especially promising for Distributed Energy Resources (DERs) dominant systems that have been widely developed to promote energy sustainability. In those systems, knowing the maximum sections of power and data delivery is essential for monitoring, operation, and control. However, high computational effort is required. By leveraging quantum resources, Quantum Approximate Optimization Algorithm (QAOA) provides a means to search for these sections efficiently. However, QAOA performance relies heavily on critical parameters, especially for weighted graphs. Here we present a data-driven QAOA, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density. We verify the strategy with 39,774 expectation value calculations. Without parameter optimization, our data-driven QAOA is comparable with the Goemans-Williamson algorithm. This work advances QAOA and pilots its practical application to power systems in noisy intermediate-scale quantum devices.