The study evaluates quantum machine learning (QML) models for network intrusion detection against well-tuned classical baselines across four standard datasets, using a leakage-controlled protocol and noise simulation. It introduces a quantum-attribution audit to determine whether any performance gains are truly due to quantum effects. While most tuned classical models match or surpass QML, two quantum approaches— a quantum-kernel SVM and a small hybrid circuit—show statistically significant advantages on specific metrics and tasks.
By Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah, Asher Ali, Hamzah Siddiqui
arXiv:2606. 13422v2 Announce Type: replace-cross Abstract: We develop theoretical foundations for a practical quantum-advantage mechanism in quantum-informed machine learning for chaotic dynamical systems.
By Maida Wang, Xiao Xue, Minh Chung, Peter V. Coveney
arXiv:2607. 02755v1 Announce Type: cross Abstract: Training AIs to be risk-averse in resources could offer a failsafe in the event that AIs turn out misaligned.
By Kristina Zhang, Junior Chinomso Okoroafor, Benjamin Maltbie, Andrew Lin, Abhitej Bokka, Elliott Thornley
The paper introduces the Adaptive‑Shot Variational Quantum Circuit (AS‑VQC) policy for finite‑shot hybrid quantum anomaly detection in Tactile Internet security. Starting with 128 shots per record, the policy escalates to 256, 512, and 1024 shots only when the anomaly score is near a validation‑selected threshold, thereby reducing computational load while maintaining decision accuracy. Experiments on a 4,875‑record benchmark show that the AS‑VQC‑95 policy averages roughly 130–280 shots per record, saving 73–87% of the resources compared to a fixed 1024‑shot baseline, with decision disagreement below 1%.
whyItMatters":"The study demonstrates that adaptive quantum measurement allocation can significantly cut resource usage in security analytics without compromising reliability, offering a practical trade‑off for constrained Tactile Internet environments."
arXiv:2606. 18503v1 Announce Type: new Abstract: Remaining useful life (RUL) estimation is central to predictive maintenance, where an unplanned failure can cost far more than the asset itself.
By Manoranjan Gandhudi, Arunkumar V., G. R. Anil, Gangadharan G. R
arXiv:2607. 27859v1 Announce Type: cross Abstract: Incentive programs are central to user acquisition in decentralized finance, but many reward systems rely on raw volume, transaction count, and wallet count, making them vulnerable to bots and sybil operations.
By Girish G N, Ashutosh Sahoo, Ajay Bhat, Akshay SP, Gurukiran S, Parag Paul, Dhanashekar Kandaswamy
arXiv:2610.09717v1 Announce Type: cross
Abstract: Quantum kernel methods are leading candidates for a practical quantum advantage in machine learning, but assessing that potential requires two quanti...
By Boaz Micah, Nadia Milazzo, Maissa Beji, Borja Aizpurua, Lloren\c{c} Espinosa-Portal\'es, Esteban Payares, Ghada Ben Slama, Luc Andrea, Michel Kurek, Thomas Cope, Olivier Salomon
The paper proposes a method for routing requests to a fixed pool of quantized Mixture-of-Experts (MoE) instances, aiming to maximize throughput while respecting a quality‑degradation budget. It introduces Fragility‑Weighted Perplexity (FWP) as a request‑specific risk metric derived from prompt tokens, and uses a window‑level linear program to compute a reduced‑reward score that aligns with the LP optimum. Experiments on Qwen prompts show that FWP‑based allocation improves throughput by 2.5% over request‑agnostic mixing and static configurations.
By Zhenghong Huang, Hongfan Wu, Jiheng Zhang
arXiv:2608. 14319v1 Announce Type: new Abstract: We study quantum multi-armed bandits (QMAB) and quantum linear bandits (QLB) in the model of Wan et al.
By Maoli Liu, Zhuohua Li, John C. S. Lui
QART is a quantum‑classical hybrid architecture that augments a language model with quantum encoding, CIM‑based QUBO optimization, and quantum decoding to improve long‑horizon reasoning. The authors claim that, under certain assumptions, QART can maintain a non‑zero probability of recovering an optimal reasoning path while traditional autoregressive LLMs see their acceptance probability drop to zero as cumulative risk grows. Experiments on six benchmarks with three backbone models show that QART outperforms the baselines in 14 of 15 pairings, with relative gains up to 84.0% on SciCode.
By Lehao Lin, Yuheng Cheng, Guolong Liu, Yao Li, Xuning Tan, Xiyuan Zhou, Ruixi Zou, Shi Wang, Huan Zhao, Wenxuan Liu, Haifeng Wu, Junhua Zhao
The review examines how machine learning can adapt quantum combinatorial optimization workflows by learning decisions such as formulation, penalties, shot budgets, and backend selection. It categorizes the literature into three paradigms—AI for quantum optimization, quantum for AI-driven optimization, and AI‑quantum co‑optimization—and analyzes 119 papers, finding stronger evidence for AI assisting quantum methods than for quantum enhancing learned optimizers. The authors highlight limited experimental controls, introduce an M0‑M5 evidence hierarchy, and argue that scaling is a systems problem requiring careful allocation of classical and quantum resources.
By Hoong Chuin LAU
arXiv:2606. 06531v1 Announce Type: new Abstract: The critical question after a correct driving veto is not only whether a maneuver is unsafe, but whether the blocked interaction admits a lawful, auditable, and responsibility-bounded repair.
By Yifan Wang