Back to News
quantum-computing

Quantum End-to-End Learning for Contextual Combinatorial Optimization

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers Jaehwan Lee and Changhyun Kwon introduced the first quantum end-to-end learning framework for contextual combinatorial optimization (CCO), addressing decision-making under uncertainty with quantum computing. The framework, called QEL, integrates Quantum Approximate Optimization Algorithms with a novel context re-uploading phase-separator to capture relationships between contexts, uncertainties, and optimal solutions. QEL enables joint end-to-end training with a stationarity guarantee by embedding a contextual encoder within a quantum surrogate policy, bypassing NP-hard optimization solvers. Unlike classical methods, QEL leverages optimization-aware quantum structures to train directly on task loss despite discreteness and nonconvexity, reducing computational overhead. Empirical results show QEL matches classical performance with significantly fewer parameters, demonstrating potential for industrial-scale quantum applications.
Quantum End-to-End Learning for Contextual Combinatorial Optimization

Summarize this article with:

Quantum Physics arXiv:2605.20222 (quant-ph) [Submitted on 13 May 2026] Title:Quantum End-to-End Learning for Contextual Combinatorial Optimization Authors:Jaehwan Lee, Changhyun Kwon View a PDF of the paper titled Quantum End-to-End Learning for Contextual Combinatorial Optimization, by Jaehwan Lee and 1 other authors View PDF HTML (experimental) 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: 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 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Jaehwan Lee [view email] [v1] Wed, 13 May 2026 05:04:09 UTC (106 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum End-to-End Learning for Contextual Combinatorial Optimization, by Jaehwan Lee and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 Change to browse by: cs cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-optimization
quantum-computing

Source Information

Source: arXiv Quantum Physics