Quantum-Classical Hybrid Methods for Optimization: Lessons from Classical Decomposition

Abstract:Quantum and physics-inspired solvers provide specialized sampling interfaces for Ising and quadratic unconstrained binary optimization models, but constrained optimization requires broader coordination and certification. This survey uses classical decomposition to analyze how such solvers can be integrated into hybrid quantum-classical algorithms. We distinguish formal decomposition, reformulation and reduction, and computational orchestration. For each interface, we ask what the transformation preserves, which assumptions make the outer method converge, and which certificates the implemented inner routine supplies. The central questions are whether that information meets the classical algorithm's requirements and whether hybridization improves solution quality or total cost enough to justify its coordination overhead. Benders decomposition, column generation, graph reduction, and copositive methods illustrate this distinction by separating heuristic proposals from classical certification. We also distinguish component effects within a fixed wrapper, reduction--solver interactions, and comparisons between complete quantum-enabled and classical systems. The analyzed studies provide conditional component benefits and favorable co-design evidence, but do not establish transferable end-to-end superiority over strong classical comparators. The resulting framework identifies opportunities for constraint programming and operations research in structure-preserving design, safeguarded hybrid algorithms, and controlled benchmarking.

Optimization and Control (math.OC); Emerging Technologies (cs.ET); Quantum Physics (quant-ph)

arXiv:2610.27362 [math.OC]

(or arXiv:2610.27362v1 [math.OC] for this version)

https://doi.org/10.48550/arXiv.2610.27362 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

SOURCE_MANIFEST.json

supplementary__audit-schema.json

supplementary__claim-locations.csv

supplementary__discovery-search__2026-10-12__bibliography-sources.json

supplementary__discovery-search__2026-10-12__discovery.json

supplementary__discovery-search__2026-10-12__literature-search-additions.csv

supplementary__discovery-search__README.txt

supplementary__discovery-search__extension__comparative-search.json

supplementary__discovery-search__extension__constraints-theory-search.json

supplementary__discovery-search__extension__decomposition-search.json

supplementary__discovery-search__extension__root-search.json

supplementary__discovery-search__metadata-clarifications.json

supplementary__discovery-search__targeted__arxiv-search.json

supplementary__discovery-search__targeted__method-candidates.json

supplementary__discovery-search__targeted__publisher-search.json

supplementary__discovery-search__targeted__root-search.json

supplementary__discovery-search__targeted__search-summary.txt

supplementary__literature-search.csv

supplementary__software-catalog.json

supplementary__software-screening.json

supplementary__status-checks__2026-10-12__additional-published-status.json

supplementary__status-checks__2026-10-12__background-status.json

supplementary__status-checks__2026-10-12__evidence-status.json

supplementary__status-checks__README.txt

supplementary__status-checks__group-a.json

supplementary__status-checks__group-b.json

supplementary__status-checks__publication_status_checks.csv

supplementary__targeted-checks__2026-10-12-author-round4-background.json

supplementary__targeted-checks__2026-10-12-final-claims.json

supplementary_data_dictionary.md

supplementary_exclusion_log.csv

supplementary_studies.csv

survey-metadata.json

(29 additional files not shown) You must enabled JavaScript to view entire file list.

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.