Metraipolis › archive › dc_684233e4ffcd

Batched pattern search for QAOA parameter optimization on cloud-accessed quantum hardware — arXiv:2609.13669

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.13669
License (as archived): CC0-1.0
Archived: 2026-10-16T02:24:12.404Z
SHA-256 of the archived text: f5b01a47541c60836bac4f848f18c3220f20293551b1a00474cd96fbe51e4bb0
Stable URL of this page: https://metraipolis.com/documento/dc_684233e4ffcd

How to cite

Batched pattern search for QAOA parameter optimization on cloud-accessed quantum hardware — arXiv:2609.13669 — arXiv (en), https://arxiv.org/abs/2609.13669 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_684233e4ffcd (Metraipolis archive dc_684233e4ffcd, sha256 f5b01a47541c60836bac4f848f18c3220f20293551b1a00474cd96fbe51e4bb0)

BibTeX

@misc{dc684233e4ffcd,
  title = {Batched pattern search for QAOA parameter optimization on cloud-accessed quantum hardware — arXiv:2609.13669},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13669},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_684233e4ffcd; sha256 f5b01a47541c60836bac4f848f18c3220f20293551b1a00474cd96fbe51e4bb0},
  year = {2026}
}

Archived text

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

On a cloud-accessed quantum processor the classical optimizer of a variational algorithm communicates with the device through submitted jobs, and each job carries a queueing and turnaround overhead that does not depend on how many circuits it contains. We study a simple consequence of this for the quantum approximate optimization algorithm (QAOA). An optimizer whose next set of trial parameters is known before any result returns can evaluate the whole set in one job, whereas a sequential optimizer such as COBYLA spends one job per function evaluation. We compare a batched pattern search with COBYLA on IBM's \ibmfez\ processor for cardinality-constrained portfolio selection with six to twelve assets, giving both optimizers the same number of jobs and the same number of shots. At every size the batched search reaches, after its first job, a parameter quality that the serial optimizer takes several jobs to match, and the two methods converge to comparable final values; repeating the eight-asset comparison from four starting points gives the same ordering each time. The instances are small enough to be solved exactly, which lets us check that the device's output distribution is correlated with the true ranking of portfolios and is clearly separated from a control circuit of the same depth with the cost layer removed. A short scan over circuit depth at classically optimal parameters shows that on this device the measured solution quality peaks at two or three QAOA layers. The protocol is described in enough detail to be reproduced, and the notebooks and raw counts are released.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-15 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.13669 — 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-16T01:57:56.988Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).