Metraipolis › archive › dc_78cc5f2da74f

Learning angles for quantum approximate optimization — arXiv:2610.23296

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.23296
License (as archived)
CC0-1.0
Archived
2026-10-19T09:21:24.787Z
SHA-256 of the archived text
21884f60cd8fd869030ef879a7e6092897a01e1e61c244580c872d640347fea2
Stable URL of this page
https://metraipolis.com/documento/dc_78cc5f2da74f

How to cite

Learning angles for quantum approximate optimization — arXiv:2610.23296 — arXiv (en), https://arxiv.org/abs/2610.23296 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_78cc5f2da74f (Metraipolis archive dc_78cc5f2da74f, sha256 21884f60cd8fd869030ef879a7e6092897a01e1e61c244580c872d640347fea2)
BibTeX
@misc{dc78cc5f2da74f,
  title = {Learning angles for quantum approximate optimization — arXiv:2610.23296},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.23296},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_78cc5f2da74f; sha256 21884f60cd8fd869030ef879a7e6092897a01e1e61c244580c872d640347fea2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.23296. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Quantum Approximate Optimization Algorithm (QAOA) and its variants are leading algorithms to help solve challenging combinatorial optimization problems. QAOA maps these problems to Ising Hamiltonians such that their ground state is the desired solution. Candidate solutions are then drawn from a variational quantum circuit. The performance of QAOA hinges on a set of variational angles. However, finding good angles is an instance-specific and computationally expensive non-convex classical optimization task. Here, we learn the mapping from the problem instance to high-quality QAOA angles. Our learned models replace the per-instance optimization, that we call the solver, with a single forward pass that is several orders of magnitude faster than the solver with a near identical quality. Our models further generalize to unseen topologies such as Barabási-Albert and 2D grid graphs. Experiments on quantum hardware confirm that QAOA samples with angles produced by our open-source models are indistinguishable from solver angles. Crucially, models sensitive to the topology of the problem instance increase the quality of the QAOA angles. Our work amortizes a major bottleneck in QAOA by an up-front data generation and training cost. Importantly, this cost can be amortized over time in settings where many similar problems are optimized on a regular basis, as is often the case in applications for industry.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.23296 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:17:41.714Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).