MG-Net: Learn to Customize QAOA with Circuit Depth Awareness
Not on the map. Why?
Abstract (arXiv)
Quantum Approximate Optimization Algorithm (QAOA) and its variants exhibit immense potential in tackling combinatorial optimization challenges. However, their practical realization confronts a dilemma: the requisite circuit depth for satisfactory performance is problem-specific and often exceeds the maximum capability of current quantum devices. To address this dilemma, here we first analyze the convergence behavior of QAOA, uncovering the origins of this dilemma and elucidating the intricate relationship between the employed mixer Hamiltonian, the specific problem at hand, and the permissible maximum circuit depth. Harnessing this understanding, we introduce the Mixer Generator Network (MG-Net), a unified deep learning framework adept at dynamically formulating optimal mixer Hamiltonians tailored to distinct tasks and circuit depths. Systematic simulations, encompassing Ising models and weighted Max-Cut instances with up to 64 qubits, substantiate our theoretical findings, highlighting MG-Net's superior performance in terms of both approximation ratio and efficiency.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 18 of its 64 references that are in the map. First posted on arXiv 27 Sep 2024.
Builds on
18 of 64 references.
References · 18
- 2017Attention Is All You Needcited by 59,932
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2020Variational Quantum Algorithmscited by 687
- 2013Ising formulations of many NP problemscited by 204
- 2021Theory of overparametrization in quantum neural networkscited by 100
- 2020Quantum circuit architecture search for variational quantum algorithmscited by 81
- 2021Reinforcement learning for optimization of variational quantum circuit architecturescited by 76
- 2021Quantum Architecture Search via Deep Reinforcement Learningcited by 58
- 2022Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networkscited by 52
- 2021Exponentially Many Local Minima in Quantum Neural Networkscited by 22
- 2021Quantum Architecture Search via Continual Reinforcement Learningcited by 22
- 2021The dilemma of quantum neural networkscited by 20
6 more
- 2022Symmetric Pruning in Quantum Neural Networkscited by 20
- 2022A Convergence Theory for Over-parameterized Variational Quantum Eigensolverscited by 14
- 2023Multimodal deep representation learning for quantum cross-platform verificationcited by 9
- 2020Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparationcited by 7
- 2024Neural auto-designer for enhanced quantum kernelscited by 7
- 2019Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithmscited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Artificial intelligence for representing and characterizing quantum systemscited by 9
- 2025Q-Detection: A Quantum-Classical Hybrid Poisoning Attack Detection Methodcited by 1
- 2026Neural QAOA2: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimizationcited by 1
- 2026GeoPAR: Large-Scale Multi-Agent Combinatorial Optimization with Geometry-Guided Parallel Autoregressive Learningcited by 0
- 2026GeoPAR: Large-Scale Multi-Agent Combinatorial Optimization with Geometry-Guided Parallel Autoregressive Learning1 Sep 2026
- 2026Neural QAOA2: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimization13 May 2026
- 2025Artificial intelligence for representing and characterizing quantum systems5 Sep 2025
- 2025Q-Detection: A Quantum-Classical Hybrid Poisoning Attack Detection Method7 Jul 2025