aiqbench analysis
This study investigates using small quantum neural networks to compress parameter-heavy modules within classical attention-based routing models, specifically for the capacitated vehicle routing problem. While the hybrid approach successfully reduces model parameters by over 56% on smaller instances, it fails to demonstrate quantum advantage or solver dominance compared to established classical algorithms on larger datasets. The primary contribution is identifying encoder feed-forward replacement as a viable strategy for module compression rather than establishing a breakthrough in solving complexity.
A hybrid quantum-classical neural network for learning to route
arXiv:2609.00489v1 Announce Type: new Abstract: This work studies hybrid quantum-classical neural networks for learning routing heuristics. Specifically, this paper asks whether small quantum neural networks can replace parameter-heavy modules inside a competitive attention-based routing model while maintaining solution quality. For the capacitated vehicle routing problem, encoder feed-forward replacement emerges as the most promising design: it reduces the number of model parameters by 56.6% while keeping the hybrid model close to the classical neural baseline at small and medium instance sizes, although the gap grows for larger instances. This work also compares to classical routing algorithms, which remain highly competitive and often superior on the fixed Euclidean test sets. Our results therefore do not indicate quantum advantage or solver dominance, but identify encoder feed-forward replacement as a viable hybrid-module compression strategy for neural combinatorial optimization.
Abstract:This work studies hybrid quantum-classical neural networks for learning routing heuristics. Specifically, this paper asks whether small quantum neural networks can replace parameter-heavy modules inside a competitive attention-based routing model while maintaining solution quality. For the capacitated vehicle routing problem, encoder feed-forward replacement emerges as the most promising design: it reduces the number of model parameters by 56.6% while keeping the hybrid model close to the classical neural baseline at small and medium instance sizes, although the gap grows for larger instances. This work also compares to classical routing algorithms, which remain highly competitive and often superior on the fixed Euclidean test sets. Our results therefore do not indicate quantum advantage or solver dominance, but identify encoder feed-forward replacement as a viable hybrid-module compression strategy for neural combinatorial optimization.
5 pages. Submitted to the Congresso Brasileiro de Ciências e Tecnologias Quânticas (CBCTQ 2026)
Machine Learning (cs.LG); Quantum Physics (quant-ph)
arXiv:2609.00489 [cs.LG]
(or arXiv:2609.00489v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.00489 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 240 words
Related coverage

Quantum Computers Now Generate Diverse States, Sidestepping a Major Simulation Hurdle
Quantum Zeitgeist · Jun 1, 2026

OQC And Trust Base Study Helps Map The Path to Quantum Advantage in Finance
The Quantum Insider · Sep 17, 2026

Trust Base partners with OQC to explore quantum finance workflows
Quantum Zeitgeist · Sep 16, 2026
Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions
arXiv · Jul 23, 2026