arXiv AI

Coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios based on qubo and hybrid quantum algorithms

arXiv:2606. 06543v1 Announce Type: cross Abstract: This study examines the coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios.

arXiv Machine Learning
1d ago

Context-Aware Error Mitigation Orchestration for Hybrid Quantum Reinforcement Learning on NISQ Systems

The paper introduces Adaptive Policy-Guided Error Mitigation (APGEM), a context-aware layer that dynamically selects error mitigation strategies—such as ZNE, PEC, CDR, and REM—during quantum reinforcement learning (QRL) training on NISQ devices. APGEM uses policy-level indicators (quantum-state fidelity, policy entropy, cumulative reward, and approximation ratio) to choose the most suitable mitigation method and integrates it directly into the reinforcement learning loop. Evaluated on the Capacitated Vehicle Routing Problem under various NISQ noise models, APGEM outperforms static mitigation techniques, achieving about 94% of an oracle strategy’s utility, maintaining higher fidelity as noise increases, and producing more stable learning behavior.

By Bisma Majid, Shabir Ahmed Sofi, Mir Mohammad Yousuf
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 AI
Sep 17

APGEM: Adaptive Policy-Guided Error Mitigation for Quantum Reinforcement Learning on a Real-World CVRP Case Study

The paper introduces APGEM, an adaptive controller that dynamically selects among four error‑mitigation techniques—Zero‑Noise Extrapolation, Probabilistic Error Cancellation, Clifford Data Regression, and Readout Error Mitigation—based on a utility function and Q‑learning scores. Applied to a realistic Delhi‑based Capacitated Vehicle Routing Problem, the adaptive approach improves the quantum reinforcement learning agent’s approximation ratios from 0.84‑0.87 to 0.92‑0.94 under high noise, outperforming constructive heuristics and approaching metaheuristics. The controller’s strategy shifts from a Clifford‑data‑regression‑heavy regime early in training to a balanced use of all techniques as training progresses, demonstrating regime‑dependent selection.

By Shabir Ahmad Sofi, Bisma Majid, Mir Mohammad Yousuf
arXiv Machine Learning
Sep 2

A hybrid quantum-classical neural network for learning to route

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.

By Marcus Rolf Peter Ritt, Alexsandro Santos da Rosa J\'unior, Marcos Vinicius Reballo, Cesar Augusto do Amaral, Fernando Augusto Caletti de Barros
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