QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks
Not on the map. Why?
Abstract (arXiv)
The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, variational parameters need to be optimized by solving a series of nonlinear, nonconvex optimization programs. In this work, we propose a QAOA parameter transfer scheme using Graph Attention Networks (GAT) to solve Maximum Independent Set (MIS) problems. We prepare optimized parameters for graphs of 12 and 14 vertices and use GATs to transfer their parameters to larger graphs. Additionally, we design a hybrid distributed resource-aware algorithm for MIS (HyDRA-MIS), which decomposes large problems into smaller ones that can fit onto noisy intermediate-scale quantum (NISQ) computers. We integrate our GAT-based parameter transfer approach to HyDRA-MIS and demonstrate competitive results compared to KaMIS, a state-of-the-art classical MIS solver, on graphs with several thousands vertices.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 45 references that are in the map. First posted on arXiv 29 Apr 2025.
Builds on
9 of 45 references.
References · 9
- 2017Graph Attention Networkscited by 8,854
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2017graph2vec: Learning Distributed Representations of Graphscited by 228
- 2023Challenges and Opportunities in Quantum Optimizationcited by 42
- 2015Finding Near-Optimal Independent Sets at Scalecited by 32
- 2018Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphscited by 9
- 2025QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuitscited by 7
- 2025Cross-Problem Parameter Transfer in Quantum Approximate Optimization Algorithm: A Machine Learning Approachcited by 3
Built on by
Not cited yet.