MLQAOA: Graph Learning Accelerated Hybrid Quantum-Classical Multilevel QAOA
arXiv:2404.14399 · doi:10.1109/QCE60285.2024.00072
Abstract
Learning the problem structure at multiple levels of coarseness to inform the decomposition-based hybrid quantum-classical combinatorial optimization solvers is a promising approach to scaling up variational approaches. We introduce a multilevel algorithm reinforced with the spectral graph representation learning-based accelerator to tackle large-scale graph maximum cut instances and fused with several versions of the quantum approximate optimization algorithm (QAOA) and QAOA-inspired algorithms. The graph representation learning model utilizes the idea of QAOA variational parameters concentration and substantially improves the performance of QAOA. We demonstrate the potential of using multilevel QAOA and representation learning-based approaches on very large graphs by achieving high-quality solutions in a much faster time. Reproducibility: Our source code and results are available at https://github.com/bachbao/MLQAOA
arXiv comment18 pages, 3 figures, 4 tables
References in corpus (21)
- Variational Quantum Algorithms
- A Quantum Approximate Optimization Algorithm
- Noisy intermediate-scale quantum (NISQ) algorithms
- graph2vec: Learning Distributed Representations of Graphs
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Warm-starting quantum optimization
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Combinatorial Optimization with Physics-Inspired Graph Neural Networks
- NetLSD: Hearing the Shape of a Graph
- Multistart Methods for Quantum Approximate Optimization
- Classical symmetries and the Quantum Approximate Optimization Algorithm
- Multilevel Combinatorial Optimization Across Quantum Architectures
- Evaluating Quantum Approximate Optimization Algorithm: A Case Study
- A simple yet effective baseline for non-attributed graph classification
- Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
- A Simple Baseline Algorithm for Graph Classification
- Quantum-Informed Recursive Optimization Algorithms
- Cutting Quantum Circuits to Run on Quantum and Classical Platforms
- Hierarchical Multigrid Ansatz for Variational Quantum Algorithms
- Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms