Abstract:Contextual combinatorial optimization (CCO) plays a critical role in decision-making under uncertainty, yet remains a significant challenge. We present Quantum End-to-End Learning (QEL), the first quantum computing-based end-to-end learning framework for CCO that leverages Quantum Approximate Optimization Algorithms. Inspired by the integration of state preparation and evolution in data re-uploading, we propose a context re-uploading phase-separator that jointly captures the complex relations among contexts, uncertain coefficients, and optimal solutions. This allows a contextual encoder to be seamlessly integrated within a quantum surrogate policy, enabling joint end-to-end training with a stationarity guarantee. Exploiting an optimization-aware structure grounded in physical principles that classical methods cannot readily leverage, our approach demonstrates practicality by directly training on task loss despite the discreteness and nonconvexity, while avoiding calls to NP-hard optimization solvers. QEL empirically achieves competitive performance while requiring substantially fewer parameters than classical benchmarks, highlighting its industrial-level potential for the future quantum era.
| Comments: | 23 pages, 2 figures, preprint |
| Subjects: | Quantum Physics (quant-ph); Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.20222 [quant-ph] |
| (or arXiv:2605.20222v1 [quant-ph] for this version) | |
| https://doi.org/10.48550/arXiv.2605.20222 arXiv-issued DOI via DataCite |
From: Jaehwan Lee [view email]
[v1]
Wed, 13 May 2026 05:04:09 UTC (106 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。