Skip to content

Quantum gated recurrent neural networks for continuous dynamic temporal decision-making

Aug 2026 · Physica Scripta · Vol 101, pp. 346001 · 0 citations · 43 references
Physics

TL;DR

A novel policy network, quantum gated recurrent neural network (QGRNN), which incorporates quantum superposition encoding and cyclic entanglement structures to achieve more efficient state-space exploration and employs a quantum–classical hybrid residual design that effectively integrates quantum measurement outcomes with classical inputs, thereby strengthening the representational capacity for temporal decision-making features.

Abstract

Performance breakthroughs in dynamic temporal decision-making tasks have long been a core research objective in reinforcement learning. Yet traditional policy networks, including long short-term memory (LSTM) networks, gated recurrent unit (GRU) and feedforward neural network (FNN), have long been hampered by inherent bottlenecks: low reward efficiency and training instability, which renders them less capable of meeting the high-precision decision-making demands of complex scenarios. This paper introduces a novel policy network, quantum gated recurrent neural network (QGRNN), which incorporates quantum superposition encoding and cyclic entanglement structures to achieve more efficient state-space exploration. Furthermore, the network employs a quantum–classical hybrid residual design that effectively integrates quantum measurement outcomes with classical inputs, thereby strengthening the representational capacity for temporal decision-making features. Trained over 800 episodes via proximal policy optimization in CartPole-v1, the QGRNN achieves an average reward of 380.3 ± 128.6 in the last 100 episodes-significantly outperforming GRU (275.9 ± 140.7), LSTM (239.7 ± 131.8), and FNN (219.2 ± 109.5). As a 4-qubit proof-of-concept, it achieves 45% high-performance episodes (rewards >450) and demonstrates low-resource, high-performance characteristics for temporal decision-making.

Read PDF

Similar papers

#artificial intelligence Preprint Oct 2026

Does Learning Recurrent Networks Matter in Partially Observable RL?

Surprisingly, frozen recurrent networks support recall over hundreds of steps and achieve competitive control performance across diverse POMDPs, while using less than half the number of trainable parameters required by their fully trainable counterparts.

Ze-Kang Wang, Zhe He, Gao-Jie Jin · 0 citations
#machine learning Preprint Sep 2026

Reinforcement Learning with Complex (valued) Memories

Partially observable environments pose a fundamental challenge in deep reinforcement learning, requiring agents to compress temporal information from observations and maintain a memory to make effective decisions. While there exist many approaches ranging from gated recurrence to attention mechanisms and model-based RL...

Sathya Kamesh Bhethanabhotla, Efstratios Gavves, André Biedenkapp · 0 citations
#machine learning Preprint Oct 2026

Learning infinite context windows in recurrent architectures via spatial neural computing

Recurrent neural networks (RNNs) offer linear-time scaling with sequence length while requiring only constant memory, yet they struggle to capture long-range dependencies due to vanishing gradients and limited receptive fields. To address these limitations, we introduce a second-order recurrent model in which the stand...

Aleix Salvador-Pomarol, A. Montanari, E. K. Miller et al. · 0 citations
Preprint Sep 2026

Modeling quantum neural network gradient with reinforcement learning

Training quantum neural networks (QNNs) on near-term hardware remains hampered by two compounding difficulties: the exponential vanishing of gradient variance known as the barren plateau, and the $\mathcal{O}(L \cdot 2^n)$ time and memory cost of differentiating through an $n$-qubit, $L$-layer circuit. We propose RLQ-G...

N. T. Luu, D. T. Luu, N. Pham et al. · 0 citations
Open access Aug 2026

Task-Parametrized dynamics: Representation of time and decisions in recurrent neural networks.

Training RNNs on delayed decision-making tasks with progressively increasing temporal demands shows that temporal and decision-related computations can emerge through multiple dynamical regimes, while maintaining structured low-dimensional representations and comparable behavioural performance, mirroring biological pri...

C. Jarne, Ryeongkyung Yoon, Tahra L. Eissa et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.