arXiv AI

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.

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 16

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.

By Kuo-Chung Peng, Samuel Yen-Chi Chen, Jiun-Cheng Jiang, Chen-Yu Liu, En-Jui Kuo, Yun-Yuan Wang, Prayag Tiwari, Andrea Ceschini, Chi-Sheng Chen, Yu-Chao Hsu, Chun-Hua Lin, Tai-Yue Li, Antonello Rosato, Massimo Panella, Simon See, Saif Al-Kuwari, Kuan-Cheng Chen, Nan-Yow Chen, Hsi-Sheng Goan
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 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 Machine Learning
Jun 25

Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptation

arXiv:2606. 24932v1 Announce Type: cross Abstract: Recent advances in quantum computing and machine learning have motivated the development of quantum models for sequential data processing.

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

A Quantum Variational Approach to Prototypical Recurrent Unit

The paper presents a lightweight Quantum Prototypical Recurrent Unit (QPRU) that uses far fewer parameters than classical recurrent models like LSTM and GRU, as well as quantum variants such as QLSTM and QGRU. Despite its compactness, the QPRU matches state‑of‑the‑art forecasting performance. It offers structural and practical benefits, notably improved scalability and a reduced parameter count.

By Mahyar Sadeghi Garjan, Tommaso Cesari, Michel Barbeau