Parameter-Efficient Quantum-Inspired Fast Weight Programmers for Traffic-Matrix Forecasting
Summary
This paper proposes quantum-inspired recurrent models (QKAN-FWPs) for traffic-matrix forecasting, demonstrating superior accuracy with fewer parameters compared to LSTM baselines.
View Cached Full Text
Cached at: 07/03/26, 07:56 PM
Paper page - Parameter-Efficient Quantum-Inspired Fast Weight Programmers for Traffic-Matrix Forecasting
Source: https://huggingface.co/papers/2606.27821
Abstract
Quantum-inspired recurrent models using gated QKAN-FWPs demonstrate superior forecasting accuracy with reduced computational requirements compared to traditional LSTM networks for traffic matrix prediction.
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. This paper investigates whether compactquantum-inspired recurrent modelscan provide effective TM forecasts without relying on dedicated graph, transformer, or diffusion modules. We adaptgated quantum-inspired Kolmogorov-Arnold network fast-weight programmers(QKAN-FWPs) to direct multi-step Abilene TM forecasting, where each model predicts the next 20 five-minute frames of a 144-channel origin-destination (OD) matrix from a two-hour history. We benchmark three QKAN placement variants against a matched-sizelong short-term memory(LSTM) network, a largerLSTM, and aclassical gated fast-weight programmerunder a shared fixed-budget training protocol. Among the evaluated recurrent models, G-QKANFWP achieves the best pooledroot-mean-square error(RMSE), while using only 22.4% of the largerLSTM. It also outperforms both the matched-sizeLSTMand the classical G-FWP baseline, indicating that the gain is not due to gated fast-weight framework alone. Convergence and channel-wise analyses further show that the quantum-inspired variants obtain lower validation-loss area under the learning curve (AULC) than matched-size recurrent baselines, while G-QKANFWP and GQKAN-FWP achieve substantially more OD-channel wins. These results identify a classical slow programmer with a quantum-inspired fast programmer as a promising accuracy-efficiency design for resource-conscious network traffic-matrix forecasting.
View arXiv pageView PDFAdd to collection
Get this paper in your agent:
hf papers read 2606\.27821
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2606.27821 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2606.27821 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2606.27821 in a Space README.md to link it from this page.
Collections including this paper1
Similar Articles
Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning
# Paper page - Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning Source: [https://huggingface.co/papers/2605.06734](https://huggingface.co/papers/2605.06734) Authors: , , , , , , , , , , , , , , , , , ## Abstract Quantum\-inspired fast\-weight programming framework using single\-qubit circuits achieves superior forecasting performance with reduced parameters compared to classical recurrent models while maintaining NISQ device compatibility\. [Fast Weight Programmers](https://huggingfac
Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning
This paper introduces Gated QKAN-FWP, a scalable quantum-inspired sequence learning framework that combines Fast Weight Programmers with Kolmogorov-Arnold Networks using single-qubit data re-uploading circuits.
QuantFlow: A Federated Mamba-Based Post-Transformer Foundation Model for Time-Series Forecasting
QuantFlow introduces a federated Mamba-based foundation model for time-series forecasting that combines inverted sequence embedding, bidirectional state-space decoders, and quantile regression to achieve strong results on benchmarks while preserving data privacy.
QuantFPFlow: Quantum Amplitude Estimation for Fokker--Planck Policy Optimisation in Continuous Reinforcement Learning
Introduces QuantFPFlow, a reinforcement learning framework that uses quantum amplitude estimation to achieve a quadratic speedup in estimating the Fokker-Planck partition function for continuous control, improving exploration and avoiding local optima.
A Quantum Inspired Variational Kernel and Explainable AI Framework for Cross Region Solar and Wind Energy Forecasting
A research paper proposing a four-stage hybrid framework for solar and wind energy forecasting, utilizing a quantum-inspired variational kernel for residual correction and a generative AI layer for explainability.