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

Communications in computer and information science

Quantum Approximate Optimization Algorithm: Applications, Limitations and Enhancement

Pablo Herrero Gómez, Marcos Alemany Manzanaro, David Gil, Higinio Mora

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-22193-3_11

Related papers

Quantum approximate optimization algorithm: a review study and problems

Laith Abualigah, Saif AlNajdawi, Abiodun Motunrayo Ikotun +7 more

Elsevier eBooks•Jan 1, 2024•16 citations

Enhanced multiscale quantum approximate optimization algorithm in multibody combinatorial optimization problems

Leilei Chen, Ping Zou, Ya‐Fei Yu

Abstract At present, the quantum approximate optimization algorithm (QAOA) faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum (NISQ) devices. This study focuses on the multiscale quantum approximate optimization algorithm (MQAOA), which integrates renormalization group (RG) transformations with QAOA to address these limitations. Based on the connections between the variables in the problem to be solved, the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation. This approach not only extends the applicability of MQAOA to satisfiability (SAT) problems — including those with three-body and higher-order interactions in the problem Hamiltonian — but also eliminates the algorithm’s sensitivity to problem density. Validations conducted on quantum simulators show that, after running two-round MQAOA, its capability is enhanced to identify optimal solutions with approximately 97% success probability as defined by the ground-state overlap for Max-2-SAT problems (78% success probability for Max-3-SAT problems). The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems, providing a pathway for NISQ-era deployment.

Chinese Physics B•Dec 9, 2025•0 citations

Quantum Approximate Optimization

Kevin Thompson

•May 1, 2023•1 citation

Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm

Zhiding Liang, Gang Liu, Zheyuan Liu +8 more

In recent years, quantum computing has emerged as a transformative force in the field of combinatorial optimization, offering novel approaches to tackling complex problems that have long challenged classical computational methods. Among these, the Quantum Approximate Optimization Algorithm (QAOA) stands out for its potential to efficiently solve the Max-Cut problem, a quintessential example of combinatorial optimization. However, practical application faces challenges due to current limitations on quantum computational resource. Our work optimizes QAOA initialization, using Graph Neural Networks (GNN) as a warm-start technique. This sacrifices affordable computational resource on classical computer to reduce quantum computational resource overhead, enhancing QAOA's effectiveness. Experiments with various GNN architectures demonstrate the adaptability and stability of our framework, highlighting the synergy between quantum algorithms and machine learning. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing and contributing to practical applications.

arXiv:2403.03310•Mar 5, 2024•3 citations

Analytical Dimensions and Performance Evaluation of the Quantum Approximate Optimization Algorithm

Blas Trigueros, Pedro Juan Roig, Salvador Alcaraz +1 more

International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE)•Apr 18, 2026•0 citations

Invited: Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm

Zhiding Liang, Gang Liu, Zheyuan Liu +8 more

In recent years, quantum computing has emerged as a transformative force in the field of combinatorial optimization, offering novel approaches to tackling complex problems that have long challenged classical computational methods. Among these, the Quantum Approximate Optimization Algorithm (QAOA) stands out for its potential to efficiently solve the Max-Cut problem, a quintessential example of combinatorial optimization. However, practical application faces challenges due to current limitations on quantum computational resource. Our work optimizes QAOA initialization, using Graph Neural Networks (GNN) as a warm-start technique. This sacrifices affordable computational resource on classical computer to reduce quantum computational resource overhead, enhancing QAOA's effectiveness. Experiments with various GNN architectures demonstrate the adaptability and stability of our framework, highlighting the synergy between quantum algorithms and machine learning. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing and contributing to practical applications.

ACM/IEEE Design Automation Conference (DAC)•Jun 23, 2024•8 citations
Abstract At present, the quantum approximate optimization algorithm (QAOA) faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum (NISQ) devices. This study focuses on the multiscale quantum approximate optimization algorithm (MQAOA), which integrates renormalization group (RG) transformations with QAOA to address these limitations. Based on the connections between the variables in the problem to be solved, the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation. This approach not only extends the applicability of MQAOA to satisfiability (SAT) problems — including those with three-body and higher-order interactions in the problem Hamiltonian — but also eliminates the algorithm’s sensitivity to problem density. Validations conducted on quantum simulators show that, after running two-round MQAOA, its capability is enhanced to identify optimal solutions with approximately 97% success probability as defined by the ground-state overlap for Max-2-SAT problems (78% success probability for Max-3-SAT problems). The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems, providing a pathway for NISQ-era deployment.
In recent years, quantum computing has emerged as a transformative force in the field of combinatorial optimization, offering novel approaches to tackling complex problems that have long challenged classical computational methods. Among these, the Quantum Approximate Optimization Algorithm (QAOA) stands out for its potential to efficiently solve the Max-Cut problem, a quintessential example of combinatorial optimization. However, practical application faces challenges due to current limitations on quantum computational resource. Our work optimizes QAOA initialization, using Graph Neural Networks (GNN) as a warm-start technique. This sacrifices affordable computational resource on classical computer to reduce quantum computational resource overhead, enhancing QAOA's effectiveness. Experiments with various GNN architectures demonstrate the adaptability and stability of our framework, highlighting the synergy between quantum algorithms and machine learning. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing and contributing to practical applications.
In recent years, quantum computing has emerged as a transformative force in the field of combinatorial optimization, offering novel approaches to tackling complex problems that have long challenged classical computational methods. Among these, the Quantum Approximate Optimization Algorithm (QAOA) stands out for its potential to efficiently solve the Max-Cut problem, a quintessential example of combinatorial optimization. However, practical application faces challenges due to current limitations on quantum computational resource. Our work optimizes QAOA initialization, using Graph Neural Networks (GNN) as a warm-start technique. This sacrifices affordable computational resource on classical computer to reduce quantum computational resource overhead, enhancing QAOA's effectiveness. Experiments with various GNN architectures demonstrate the adaptability and stability of our framework, highlighting the synergy between quantum algorithms and machine learning. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing and contributing to practical applications.