Metraipolis › archive › dc_4bf1340d649e

Learning Grover mixers for constrained optimization — arXiv:2610.38572

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38572
License (as archived)
CC0-1.0
Archived
2026-11-01T02:50:03.200Z
SHA-256 of the archived text
94fce5074f745190709906fca21aa5d1d896290de20513e284d301cf7f56670d
Stable URL of this page
https://metraipolis.com/documento/dc_4bf1340d649e

How to cite

Learning Grover mixers for constrained optimization — arXiv:2610.38572 — arXiv (en), https://arxiv.org/abs/2610.38572 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4bf1340d649e (Metraipolis archive dc_4bf1340d649e, sha256 94fce5074f745190709906fca21aa5d1d896290de20513e284d301cf7f56670d)
BibTeX
@misc{dc4bf1340d649e,
  title = {Learning Grover mixers for constrained optimization — arXiv:2610.38572},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38572},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4bf1340d649e; sha256 94fce5074f745190709906fca21aa5d1d896290de20513e284d301cf7f56670d},
  year = {2026}
}

Archived text

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

Grover-Mixer QAOA (GM-QAOA) is a promising quantum framework for constrained combinatorial optimization. However, its practical implementation requires the efficient preparation of a uniform superposition over feasible states. In this work, we propose a two-stage variational approach. First, a parameterized quantum circuit is trained to prepare this superposition, using an entropy-based cost function that favors a uniform distribution over feasible bitstrings. The trained circuit is then embedded in GM-QAOA, where it provides both the initial state and, together with its inverse, yields the Grover mixer. The resulting method is evaluated on two representative benchmark problems: the Maximum Weight Independent Set (MWIS) problem and the Multidimensional Knapsack Problem (MKP). While the results demonstrate consistent improvements over standard QAOA for MWIS, only marginal gains are observed for MKP, with the advantage diminishing as the problem size increases. The reduced performance on MKP reflects the growing difficulty of training the variational mixer, likely due to increasingly challenging optimization landscapes. Overall, these findings highlight both the potential of variational Grover mixers and the trade-off between their performance gains and the additional resources required for their training.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.38572 — 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-11-01T02:19:43.454Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).