arXiv AI

Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

arXiv:2605. 06734v2 Announce Type: replace-cross Abstract: Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states.

arXiv Machine Learning
Jul 31

Complementary Matrix-Gated QKAN Fast-Weight Programmers for Quantum Dynamics Forecasting

arXiv:2607. 27945v1 Announce Type: cross Abstract: Sequence models must decide what to write into memory and what to retain.

By Kuo-Chung Peng, Samuel Yen-Chi Chen, Jiun-Cheng Jiang, Chen-Yu Liu, En-Jui Kuo, Yun-Yuan Wang, Tzung-Chi Huang, Prayag Tiwari, Chi-Sheng Chen, Chun-Hua Lin, Yu-Chao Hsu, Tai-Yue Li, Saif Al-Kuwari, Simon See, Kuan-Cheng Chen, Nan-Yow Chen, Hsi-Sheng Goan
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
Jul 3

Stable Self-Modulating Quantum Fast-Weight Programmers with Bounded Memory Gates

arXiv:2607. 02363v1 Announce Type: cross Abstract: Quantum Fast-Weight Programmers (QFWPs) store temporal information in dynamically programmed variational-circuit parameters rather than in nonlinear recurrent hidden states, offering a practical route to quantum sequence modeling.

By Kuo-Chung Peng, Jiun-Cheng Jiang, Chun-Hua Lin, Yifeng Peng, Junghoon Justin Park, Huan-Hsin Tseng, Hsin-Yi Lin, Kuan-Cheng Chen, Chen-Yu Liu, Shinjae Yoo, Samuel Yen-Chi Chen
arXiv Machine Learning
Sep 18

Recursive Quantum Long Short-Term Memory for Stable Short-Horizon Temperature Forecasting

The paper introduces a recursive quantum long short-term memory (QLSTM) architecture and compares it to a standard QLSTM for one-step-ahead daily temperature forecasting. Using Toronto weather data and identical training settings, the recursive model consistently reaches near-optimal test loss earlier, achieves lower mean absolute error and root mean squared error, and shows a smaller generalization gap across input windows of 8, 16, and 32 days over 20 random seeds. These findings suggest that recursive quantum feature transformations can enhance stability and out-of-sample performance in compact hybrid quantum–classical temporal models.

By Mu-En Lee, Yen-Ku Liu, Samuel Yen-Chi Chen, Yun-Cheng Tsai
arXiv Machine Learning
Sep 14

Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization

The paper introduces a hybrid quantum–classical regression framework that uses a lightweight classical embedding as a learnable geometric preconditioner to improve the conditioning of a downstream variational quantum circuit. It further incorporates a curriculum optimization protocol that gradually increases circuit depth and switches from SPSA-based exploration to Adam-based fine‑tuning. Experiments on PDE‑informed and standard regression datasets show that this approach consistently outperforms pure QNN baselines, yielding more stable convergence and reduced structured errors, especially in data‑limited regimes.

By Qingyu Meng, Yangshuai Wang
arXiv Machine Learning
Sep 17

Learning to Program Adaptive Non-Local Observables for Machine Learning

The paper introduces QFWP-ANO, a quantum neural network architecture that uses a classical hypernetwork to program variational quantum circuit parameters and non‑local observables conditioned on each input. Unlike existing adaptive non‑local observable (ANO) methods that learn a single static observable, QFWP-ANO dynamically adapts to each input. Experiments on multivariate time‑series forecasting and reinforcement learning tasks show that QFWP-ANO outperforms traditional ANO‑based VQCs and other strong baselines, achieving the lowest mean‑squared error in most settings.

By Yu-Ting Lee, Samuel Yen-Chi Chen, Huan-Hsin Tseng