Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

📅 2026-05-07
📈 Citations: 0
Influential: 0
📄 PDF

career value

194K/year
🤖 AI Summary
This work addresses the poor scalability and high classical simulation cost of existing quantum fast weight programmers on noisy intermediate-scale quantum (NISQ) devices, which stem from their reliance on multi-qubit architectures. The authors propose a novel hybrid architecture that employs single-qubit data re-uploading circuits as learnable nonlinear activations (termed the DARUAN mechanism), integrated with a quantum-inspired Kolmogorov–Arnold network and a scalar-gated fast weight update rule. This design achieves adaptive memory kernels, geometric boundedness, and parallel gradient pathways. The approach substantially enhances NISQ compatibility and scalability, outperforming various classical recurrent models—despite using only 12.5k parameters compared to up to 13× more in baselines—on solar activity cycle forecasting (528-month input, 132-month prediction). It also attains near-ideal simulator accuracy on IonQ and IBM quantum processors, with relative mean squared error below 0.1%.
📝 Abstract
Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states. Quantum FWPs (QFWPs) extend this idea with variational quantum circuits (VQCs), but existing implementations rely on multi-qubit architectures that are difficult to scale on noisy intermediate-scale quantum (NISQ) devices and expensive to simulate classically. We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN) using single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN). We further introduce a scalar-gated fast-weight update rule that stabilizes parameter evolution, supported by a theoretical analysis of its adaptive memory kernel, geometric boundedness, and parallelizable gradient paths. We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result. In the long-horizon setting with 528-month input window and 132-month forecast horizon, our 12.5k-parameter model achieves lower scaled Mean Square Error (MSE), peak amplitude error, and peak timing error than a suite of classical recurrent baselines with up to 13x more parameters, including Long Short-Term Memory (LSTM) networks (25.9k-89.1k parameters), WaveNet-LSTM (167k), Vanilla recurrent neural network (11.5k), and a Modified Echo State Network (132k). To validate NISQ compatibility, we further deploy the trained fast programmer on IonQ and IBM Quantum processors, recovering forecasting accuracy within 0.1% relative MSE of the noiseless simulator at 1024 shots. These results position gated QKAN-FWP as a scalable, parameter-efficient, and NISQ-compatible approach to quantum-inspired sequence modeling.
Problem

Research questions and friction points this paper is trying to address.

Quantum Fast Weight Programmers
NISQ devices
scalability
sequence modeling
parameter efficiency
Innovation

Methods, ideas, or system contributions that make the work stand out.

Quantum-inspired learning
Fast Weight Programmer
Single-qubit re-uploading
Scalable sequence modeling
NISQ compatibility
🔎 Similar Papers
No similar papers found.
K
Kuo-Chung Peng
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan
Samuel Yen-Chi Chen
Samuel Yen-Chi Chen
Wells Fargo
quantum computationquantum informationmachine learningquantum machine learning
J
Jiun-Cheng Jiang
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan
Chen-Yu Liu
Chen-Yu Liu
Research Scientist at Quantinuum
Quantum ComputingQuantum many body physicsArtificial intelligenceGeneral relativity
E
En-Jui Kuo
Department of Electrophysics, National Yang Ming Chiao Tung University, Hsinchu, Taiwan
Y
Yun-Yuan Wang
NVIDIA AI Technology Center, NVIDIA Corp., Taipei, Taiwan
Prayag Tiwari
Prayag Tiwari
Associate Professor, Halmstad University, Sweden
Artificial IntelligenceMachine LearningDeep LearningMultimodal InteractionQuantum Computing
Andrea Ceschini
Andrea Ceschini
PhD candidate in QML, Sapienza University of Rome
Quantum Machine Learning
C
Chi-Sheng Chen
Beth Israel Deaconess Medical Center & Harvard Medical School, Boston, MA, USA
Y
Yu-Chao Hsu
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan
C
Chun-Hua Lin
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan
T
Tai-Yue Li
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan
A
Antonello Rosato
Department of Information Engineering, Electronics and Telecommunications (DIET), University of Rome “La Sapienza”, Rome, Italy
Massimo Panella
Massimo Panella
University of Rome "La Sapienza" (Dept. of Information Eng., Electronics and Telecom.)
Electrical EngineeringComputational IntelligenceCircuit TheoryMachine LearningQuantum Computing
Simon See
Simon See
nvidia
applied mathematicsAImachine learningHigh Performance ComputingSimulation
Saif Al-Kuwari
Saif Al-Kuwari
Hamd Bin Khalifa University
Quantum ComputingCryptographyAIComputational ForensicsPLS
K
Kuan-Cheng Chen
Qatar Center for Quantum Computing, College of Science and Engineering, Hamad Bin Khalifa University, Doha, Qatar
N
Nan-Yow Chen
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan
H
Hsi-Sheng Goan
Department of Physics and Center for Theoretical Physics, National Taiwan University, Taipei, Taiwan