Benchmarking memory and nonlinear processing capacity of quantum recurrent neural networks for time series prediction

José Daniel Viqueira, Andrés Gómez, David MeraarXiv 2026 · arXiv

TL;DR

This paper presents a rigorous benchmarking framework for Variational Quantum Recurrent Neural Networks (QRNNs), evaluating their memory and nonlinear processing capabilities against classical baselines like LSTMs and GRUs. The study reveals that while specific quantum architectures can match or even slightly exceed classical performance at small scales, they face significant hurdles in scaling and are highly sensitive to parameter initialization.

What Problem Does This Paper Address?

Time series prediction—predicting future values based on past data—is a cornerstone of modern AI, traditionally dominated by classical architectures like LSTMs and Transformers. Quantum machine learning (QML) offers a potential alternative, but most research has focused on "Quantum Reservoir Computing," where the quantum part remains fixed and only a classical readout is trained.

Variational QRNNs, where the quantum circuit itself is trained, remain understudied because they are notoriously difficult to optimize. The authors address the lack of standardized, fair comparisons between these emerging quantum models and established classical baselines. They specifically want to know: Can quantum models exploit their exponentially large Hilbert space to store more "memory" than classical vectors of the same size?

Methods

The authors define a QRNN family based on a bipartite system: an Exchange (E) register for input encoding and measurement, and a Memory (M) register that carries information across timesteps.

QRNN architecture showing the flow of encoding, evolution, and measurement across timesteps.

Key methodological innovations include:

  • Quantum Mutual Information (QMI) Analysis: Used to identify the "transitory phase"—the number of timesteps required for the quantum system to reach a stationary state and "forget" its initial conditions before valid predictions can be made.
  • Capacity Metric ($\tau_c$): A task-driven measure that defines a model's capacity as the maximum time-lag ($\tau$) at which it can maintain a high prediction accuracy (specifically, an $R^2 \geq 0.9$).
  • Variational Ansatze: They tested four quantum variants (EMCX1, EMCZ2, EMCZ3, and Hybrid) with varying levels of entanglement and parameter density.

Datasets

The models were evaluated on three distinct tasks designed to probe different capabilities:

  1. Short-Term Memory (STM): A pure memory task where the model must reproduce an input delayed by $\tau$ timesteps.
  2. NARMA: A standard benchmark that requires both memory and complex nonlinear processing.
  3. Mackey-Glass (MG): A synthetic dataset describing a chaotic system, used to test long-term forecasting in a dynamic environment.
Summary of the massive experimental battery, totaling over 13,000 training runs.

Key Insights and Ideas

  • The Initialization Trap: Quantum models show a high "upper tail" in performance distributions. This means that with the right random start, a QRNN can be exceptionally capable. However, as the model size (number of qubits) increases, the probability of finding that "good" initialization drops significantly.
  • The "Sweet Spot" Architecture: The EMCZ2 model (which uses $U_2$ gates and linear entanglement) emerged as the most balanced quantum architecture. It was the only quantum model competitive with classical baselines across the full range of memory sizes studied.
  • Memory Scaling Paradox: Theoretically, $n$ qubits can represent $2^n$ dimensions. However, the study found that classical models (where memory scales linearly with vector size) actually scaled better in practice within the studied range (up to 7 qubits). The "quantum advantage" in memory density is currently offset by training difficulties like vanishing gradients.

Key Results

  • Comparable Performance: At small memory sizes, QRNNs achieve performance comparable to Vanilla RNNs and LSTMs.
  • NARMA Advantage: In the NARMA task, the EMCZ2 variant showed a higher average capacity than classical counterparts at certain memory sizes, suggesting quantum circuits may have an edge in specific types of nonlinear mapping.
  • Classical Scaling: For the chaotic Mackey-Glass task, LSTMs and GRUs significantly outperformed all quantum models as the memory size increased, likely due to their sophisticated gating mechanisms that better manage long-term dependencies.

Limitations and Future Work

The primary limitation identified is trainability. The authors noted that while quantum models can represent complex patterns, the optimization landscape becomes increasingly rugged as qubits are added.

Future research directions suggested include:

  • Developing data-agnostic initialization strategies (similar to Glorot/Xavier initialization in classical DL) specifically for recurrent quantum structures.
  • Exploring more sophisticated gating mechanisms within the quantum circuit to mimic the success of LSTMs.
  • Testing these models on actual quantum hardware to assess the impact of noise and decoherence, which were not modeled in this high-performance simulation study.

Summary updated

Abstract

Quantum machine learning has emerged as a promising approach to time series prediction. While quantum reservoir computing has been widely explored for this setting, variational quantum models tailored to sequential data remain comparatively understudied, largely because they are difficult to train. In this work, we present a rigorous benchmark of variational quantum recurrent neural networks (QRNNs) on time series prediction tasks, focusing on two key capabilities: memory and nonlinear processing. We introduce a task-driven methodology that quantifies model capacity, enabling an intuitive and fair comparison across architectures, including classical recurrent baselines. We evaluate the proposed framework on two generic benchmark tasks and on a synthetic dataset describing a chaotic system. Overall, the quantum models achieve performance comparable to their classical counterparts, but classical models scale better with the memory size within the range studied. Notably, one QRNN variant shows higher average capacity on the task designed to jointly probe memory and nonlinear capacity. Moreover, our results show that quantum models offer better capacity when we are able to find a good parameter initialization. However, the increasing sensitivity to initialization leads to a lower probability of finding good solutions as the model size increases. These results provide a principled starting point for designing richer quantum recurrent architectures and for assessing where they may offer practical benefits.
BibTeX
@misc{viqueira2026benchmarking,
  author = {José Daniel Viqueira and Andrés Gómez and David Mera},
  title = {{Benchmarking memory and nonlinear processing capacity of quantum recurrent neural networks for time series prediction}},
  year = {2026},
  eprint = {2611.21552},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.21552},
}
Figure