Recurrent Quantum Feature Maps for Reservoir Computing

• URL: http://arxiv.org/abs/2604.03469v1
• Date: Fri, 03 Apr 2026 21:33:10 GMT
• Title: Recurrent Quantum Feature Maps for Reservoir Computing
• Abstract summary: We introduce a reservoir based on recurrent quantum feature maps where a fixed quantum circuit is reused to encode both current inputs and a classical feedback signal derived from previous outputs.<n>We evaluate the model on the Mackey-Glass time-series prediction task using our recently introduced CP feature map, and find that it achieves lower mean squared error than standard classical baselines.
• Score: 0.6299766708197881
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reservoir computing promises a fast method for handling large amounts of temporal data. This hinges on constructing a good reservoir--a dynamical system capable of transforming inputs into a high-dimensional representation while remembering properties of earlier data. In this work, we introduce a reservoir based on recurrent quantum feature maps where a fixed quantum circuit is reused to encode both current inputs and a classical feedback signal derived from previous outputs. We evaluate the model on the Mackey-Glass time-series prediction task using our recently introduced CP feature map, and find that it achieves lower mean squared error than standard classical baselines, including echo state networks and multilayer perceptrons, while maintaining compact circuit depth and qubit requirements. We further analyze memory capacity and show that the model effectively retains temporal information, consistent with its forecasting accuracy. Finally, we study the impact of realistic noise and find that performance is robust to several noise channels but remains sensitive to two-qubit gate errors, identifying a key limitation for near-term implementations.

Related papers

• Back from the Future: Key-Value Cache Management by Counter-Causal Surprise [67.1056509495879]
  Key-value (KV) cache management through compression and eviction strategies has emerged as an important research direction in recent years.<n>We propose a simple yet effective KV eviction scheme motivated by the insight that past tokens which can be well-predicted from more recent tokens are redundant.<n>We evaluate our strategy on various open-source LLMs and benchmark datasets showing competitive or improved performance over other state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-07-30T02:42:51Z)
• Digital Quantum Reservoir Computing for ATM Time Series Prediction [0.0]
  We investigate a digital quantum reservoir computing framework for multi-step forecasting of ATM cash demand time series.<n>The proposed approach uses parametrized four-qubit reservoirs with a fixed structure exploiting partial measurement and reset.<n>Experiments are performed with noiseless simulation, noise-aware emulation, and a real IQM Spark quantum processor.
  arXiv  Detail & Related papers  (2026-06-03T10:11:07Z)
• Quantum reservoir computing for predicting and characterizing chaotic maps [0.3966519779235704]
  Quantum reservoir computing has emerged as a promising paradigm for harnessing quantum systems to process temporal data efficiently.<n>We demonstrate the capability of this approach to predict and characterize chaotic dynamics in discrete nonlinear maps.<n>Results highlight quantum reservoir computing as a scalable and noise-resilient tool for modeling complex dynamical systems.
  arXiv  Detail & Related papers  (2025-09-15T15:55:59Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• Role of scrambling and noise in temporal information processing with quantum systems [1.3140209441982318]
  Scrambling quantum systems have attracted attention as effective substrates for temporal information processing.<n>We consider a quantum reservoir processing framework that captures a broad range of physical computing models with quantum systems.
  arXiv  Detail & Related papers  (2025-05-15T08:35:10Z)
• Enhancing Foundation Models for Time Series Forecasting via Wavelet-based Tokenization [74.3339999119713]
  We develop a wavelet-based tokenizer that allows models to learn complex representations directly in the space of time-localized frequencies.<n>Our method first scales and decomposes the input time series, then thresholds and quantizes the wavelet coefficients, and finally pre-trains an autoregressive model to forecast coefficients for the forecast horizon.
  arXiv  Detail & Related papers  (2024-12-06T18:22:59Z)
• WiNet: Wavelet-based Incremental Learning for Efficient Medical Image Registration [68.25711405944239]
  Deep image registration has demonstrated exceptional accuracy and fast inference. Recent advances have adopted either multiple cascades or pyramid architectures to estimate dense deformation fields in a coarse-to-fine manner. We introduce a model-driven WiNet that incrementally estimates scale-wise wavelet coefficients for the displacement/velocity field across various scales.
  arXiv  Detail & Related papers  (2024-07-18T11:51:01Z)
• Data-driven Quantum Dynamical Embedding Method for Long-term Prediction on Near-term Quantum Computers [6.1549556540537855]
  We introduce a data-driven method designed for time series prediction with quantum dynamical embedding (QDE)<n>Based on its independence of time series length, this method achieves depth-efficient quantum circuits.<n> Numerical simulations demonstrate the model's capability to predict not only wave signals but also more complex signals such as NARMA.
  arXiv  Detail & Related papers  (2023-05-25T12:12:49Z)
• CARD: Channel Aligned Robust Blend Transformer for Time Series Forecasting [50.23240107430597]
  We design a special Transformer, i.e., Channel Aligned Robust Blend Transformer (CARD for short), that addresses key shortcomings of CI type Transformer in time series forecasting. First, CARD introduces a channel-aligned attention structure that allows it to capture both temporal correlations among signals. Second, in order to efficiently utilize the multi-scale knowledge, we design a token blend module to generate tokens with different resolutions. Third, we introduce a robust loss function for time series forecasting to alleviate the potential overfitting issue.
  arXiv  Detail & Related papers  (2023-05-20T05:16:31Z)
• HiPPO: Recurrent Memory with Optimal Polynomial Projections [93.3537706398653]
  We introduce a general framework (HiPPO) for the online compression of continuous signals and discrete time series by projection onto bases. Given a measure that specifies the importance of each time step in the past, HiPPO produces an optimal solution to a natural online function approximation problem. This formal framework yields a new memory update mechanism (HiPPO-LegS) that scales through time to remember all history, avoiding priors on the timescale.
  arXiv  Detail & Related papers  (2020-08-17T23:39:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.