Metraipolis › archive › dc_581e9fe7580b

Query-Efficient Quantum Multi-Objective Optimization for Materials Configuration Search via Bayesian Weight Selection — arXiv:2610.41788

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41788
License (as archived)
CC0-1.0
Archived
2026-11-03T08:27:40.616Z
SHA-256 of the archived text
825c35919749613038077d9dbc72663baab642f9eca67f14e1a8dcbf02e75e02
Stable URL of this page
https://metraipolis.com/documento/dc_581e9fe7580b

How to cite

Query-Efficient Quantum Multi-Objective Optimization for Materials Configuration Search via Bayesian Weight Selection — arXiv:2610.41788 — arXiv (en), https://arxiv.org/abs/2610.41788 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_581e9fe7580b (Metraipolis archive dc_581e9fe7580b, sha256 825c35919749613038077d9dbc72663baab642f9eca67f14e1a8dcbf02e75e02)
BibTeX
@misc{dc581e9fe7580b,
  title = {Query-Efficient Quantum Multi-Objective Optimization for Materials Configuration Search via Bayesian Weight Selection — arXiv:2610.41788},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41788},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_581e9fe7580b; sha256 825c35919749613038077d9dbc72663baab642f9eca67f14e1a8dcbf02e75e02},
  year = {2026}
}

Archived text

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

Materials design is a multi-objective problem, and recent advances in quantum optimization make it possible to bring quantum solvers to bear on such problems. The realistic near-term win, though, is not raw quantum advantage but making an expensive, noisy quantum solver usable by spending its calls wisely. Quantum Approximate Multi-Objective Optimization (QAMOO) traces a Pareto front by solving a family of scalarized Ising problems, one per objective-weight vector, with QAOA --- but chooses those weights \emph{non-adaptively}, sampling them at random, blind to what it has already found. We recast weight selection as \emph{multi-objective Bayesian optimization}: our method, BW-QAMOO (Bayes-Weighted QAMOO), picks each next weight by expected hypervolume improvement (EHVI) under a Gaussian-process (GP) surrogate over the weight-to-objective map. On a frustrated alloy-configuration benchmark across $m\in\{3,4\}$ objectives and $n\in\{10,11,12\}$ sites, BW-QAMOO reaches the same Pareto hypervolume as QAMOO's random sampling with a median 33% fewer scalarized solves across the 90/95\% targets and 60--74\% fewer than a uniform-grid baseline), on a genuine (simulated) QAOA solver; a paired Wilcoxon test confirms the saving is significant, and the advantage grows with the objective count m as the weight simplex expands and blind sampling wastes more of the budget. This is a \emph{query-efficiency} result, and we close with the open challenges on the path to real alloy data and hardware.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Computational Physics (physics.comp-ph) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.41788 — 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-03T08:09:38.859Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).