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.
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:2607. 27945v1 Announce Type: cross Abstract: Sequence models must decide what to write into memory and what to retain.
arXiv:2606. 24933v1 Announce Type: cross Abstract: Recent advances in quantum machine learning have motivated efficient models for sequential data processing.
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:2605. 12713v3 Announce Type: replace-cross Abstract: In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed.
arXiv:2607. 16358v1 Announce Type: cross Abstract: This paper presents a unified quantum-classical hybrid framework for multi-horizon time-series forecasting, introducing two model variants Quantum Reservoir Forecaster (QRC-F) and Variational Quantum Forecaster (VQF-F).
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.
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.
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.
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.
arXiv:2608. 07363v1 Announce Type: new Abstract: Forecasting non-stationary time series remains difficult due to long-range dependencies, local volatility bursts, structural shifts, and nonlinear oscillatory behaviors.
arXiv:2605. 18333v2 Announce Type: replace-cross Abstract: Accurate and efficient time-series forecasting remains a challenging problem for both classical and quantum neural architectures, particularly in multivariate environmental settings.
arXiv:2504. 20823v3 Announce Type: replace Abstract: Accurate remaining useful life (RUL) estimation underpins safe operation and cost-effective maintenance of aerospace propulsion systems.