QAOA Parameter Transfer for Hypergraphs
Lucas T. Braydwood, Phillip C. Lotshaw

TL;DR
This paper develops analytical rules for reweighting QAOA parameters to transfer solutions across hypergraphs with different localities, improving optimization efficiency for complex hypergraph problems.
Contribution
It introduces novel reweighting rules for QAOA parameters tailored to hypergraphs, including mixing terms, based on analytical derivations and numerical validation.
Findings
Reweighting rules improve QAOA performance on hypergraphs with locality ≤ 5.
Analytical derivations rely on cycle-free, low-depth assumptions.
Numerical results outperform previous methods that ignore mixing term reweighting.
Abstract
Variational Quantum Algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), have shown promise in solving optimization problems but rely on costly variational loops that can themselves be hard optimization problems. Many methods have been proposed to mitigate this variational cost, with one of the most common being parameter transfer and concentration where variational parameters for one problem instance or for an average over problem instances can be used as a good set of parameters for another instance. Methods exist for reweighting these parameters based off graph degree and edge weights, but there has been little work on how to do this reweighting to handle higher locality problems where the graph structure turns into a hypergraph structure. In this paper, we analytically derive parameter reweighting rules to transfer parameters between different locality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
