arXiv Machine Learning By Marcus Rolf Peter Ritt, Alexsandro Santos da Rosa J\'unior, Marcos Vinicius Reballo, Cesar Augusto do Amaral, Fernando Augusto Caletti de Barros

A hybrid quantum-classical neural network for learning to route

Read the original on arXiv Machine Learning →

The paper investigates hybrid quantum‑classical neural networks for learning routing heuristics, focusing on whether small quantum neural networks can replace parameter‑heavy modules in an attention‑based routing model without sacrificing solution quality. For the capacitated vehicle routing problem, replacing the encoder feed‑forward component with a quantum version reduces model parameters by 56.6% while maintaining performance close to the classical baseline on small and medium instances, though the gap widens for larger instances. The study also compares the hybrid approach to classical routing algorithms, finding that classical methods remain highly competitive and often superior on fixed Euclidean test sets, indicating no quantum advantage but highlighting encoder feed‑forward replacement as a viable compression strategy for neural combinatorial optimization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 7

GNN-Guided Graph Coarsening and Adaptive QUBO Penalties for the Capacitated Vehicle Routing Problem with Time Windows on a Quantum Annealer

The paper presents a method for reducing the size of Quadratic Unconstrained Binary Optimization (QUBO) models used to solve the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) on quantum annealers. It introduces adaptive penalty calibration to improve constraint satisfaction and replaces hand‑tuned merge heuristics with a graph neural network (GNN) that consistently achieves higher feasibility across Solomon benchmark families. Experiments on simulated annealing and a D‑Wave Advantage2 processor show significant reductions in constraint violations and improved feasibility rates, with the QUBO size remaining 5–6 times smaller.

By Youssef Kamel Rezk, Pawe{\l} Gora
arXiv Machine Learning
Jun 9

Zero-shot Quantum Neural Architecture Search

arXiv:2605. 27410v2 Announce Type: replace-cross Abstract: Variational Quantum Algorithms (VQAs) are a leading approach to exploiting near-term quantum hardware, leveraging parameterized quantum circuits and classical optimization to achieve advantage.

By Tung Dao, Son N. Tran, Huynh Thi Thanh Binh
arXiv AI
Jun 29

Parameter-Efficient Quantum-Inspired Fast Weight Programmers for Traffic-Matrix Forecasting

arXiv:2606. 27821v1 Announce Type: cross Abstract: Traffic matrices (TMs) capture network-wide origin-destination demand and are central to traffic engineering, yet accurate whole-matrix forecasting remains challenging when prediction must be performed under the memory, update, and training-budget constraints of online network control.

By Kuo-Chung Peng, Jiun-Cheng Jiang, Chun-Hua Lin, Tai-Yue Li, Nan-Yow Chen, Samuel Yen-Chi Chen
arXiv AI
Sep 25

Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment

Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment introduces Sim‑HVQC, a hybrid deep quantum neural network that integrates an adaptive, parameter‑free SimAM weighting module with classical feature extraction to retain class‑discriminative information before encoding into a Variational Quantum Circuit. Unlike prior work limited to binary classification, this framework is trained and evaluated on multiple multi‑class datasets such as MNIST, KMNIST, Fashion‑MNIST, and EMNIST. The study highlights reproducibility, parameter efficiency, and interpretability through multi‑seed evaluation, parameter analysis, and latent/quantum feature inspection, with source code publicly available on GitHub.

By Dilli Hang Rai
arXiv AI
Jun 2

Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework

arXiv:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).

By Syed Farhan Ahmad, Gregory T. Byrd