Metraipolis › archive › dc_65032e66d9ec
Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow — arXiv:2609.30532
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30532
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:04:50.102Z
- SHA-256 of the archived text
bff8008668b1a62960e1fae13a5bb803f7e650db14ab780205d2466a6c64f65b- Stable URL of this page
https://metraipolis.com/documento/dc_65032e66d9ec
How to cite
Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow — arXiv:2609.30532 — arXiv (en), https://arxiv.org/abs/2609.30532 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65032e66d9ec (Metraipolis archive dc_65032e66d9ec, sha256 bff8008668b1a62960e1fae13a5bb803f7e650db14ab780205d2466a6c64f65b)
BibTeX
@misc{dc65032e66d9ec,
title = {Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow — arXiv:2609.30532},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30532},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65032e66d9ec; sha256 bff8008668b1a62960e1fae13a5bb803f7e650db14ab780205d2466a6c64f65b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30532. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Today's Quantum Processing Units (QPUs) are too small and too noisy to solve large combinatorial optimization problems directly, so practical hybrid solvers split a problem into pieces and iterate a decompose-solve-aggregate loop over whatever backends are available: classical heuristics, simulators, emulators, or a QPU. In practice, the loop is a driver script. It sits on top of the quantum-HPC middleware, handling task generation, provenance, recovery, and portability. Instead, we treat the loop as a scientific workflow and ask what a workflow layer adds to a generic workflow management system and QPU-sharing middleware. Two decomposition patterns from real applications, iterative consensus (ADMM) and hierarchical partitioning, turn out to stress the orchestration layer very differently: over 120 managed runs, orchestration took 78.4% of end-to-end time for the iterative pattern, almost all of it in a per-round barrier, but only 6.2% for the hierarchical one. Our workflow model adds four things a generic engine does not have: a termination predicate residing in the task graph that reads the previous round's residuals, subproblem-level recovery with warm-start and quorum-deferred aggregation, failover from a QPU to a classical replica within a round, and a provenance schema that describes CPUs, simulators and QPUs with the same fields, including the shot budget included. We report the cost of each layer on our engine, show that speculative re-execution enable runs to complete under injected failures that stall an unmanaged driver. We also use the same provenance to give per-device latency tails across simulators, emulators and IQM QPUs. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-28 in cs.DC). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.30532 — 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-08T01:40:22.284Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).