QAOA Parameter Transfer for Hypergraphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917444957765632 |
|---|---|
| author | Braydwood, Lucas T. Lotshaw, Phillip C. |
| author_facet | Braydwood, Lucas T. Lotshaw, Phillip C. |
| contents | 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 hypergraphs, resulting in a reweighting for the mixing terms in the Hamiltonian which have previously not been considered. These analytics rely on three cycle-free and low-circuit-depth assumptions, but numerics indicate that the results can be used even when these assumptions are not satisfied. The numerics obtain high quality results across a diverse set of hypergraphs with locality less than or equal to five, improving on previous relations that do not reweight the mixing terms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26040 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | QAOA Parameter Transfer for Hypergraphs Braydwood, Lucas T. Lotshaw, Phillip C. Quantum Physics 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 hypergraphs, resulting in a reweighting for the mixing terms in the Hamiltonian which have previously not been considered. These analytics rely on three cycle-free and low-circuit-depth assumptions, but numerics indicate that the results can be used even when these assumptions are not satisfied. The numerics obtain high quality results across a diverse set of hypergraphs with locality less than or equal to five, improving on previous relations that do not reweight the mixing terms. |
| title | QAOA Parameter Transfer for Hypergraphs |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.26040 |