Recurrent Quantum Feature Maps for Reservoir Computing
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 34 references that are in the map. First posted on arXiv 3 Apr 2026.
Builds on
7 of 34 references.
References · 7
- 2018Supervised learning with quantum enhanced feature spacescited by 654
- 2018Echo state networks are universalcited by 86
- 2018Reservoir Computing Universality With Stochastic Inputscited by 48
- 2020Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spacescited by 44
- 2020Temporal Information Processing on Noisy Quantum Computerscited by 23
- 2025Feedback-driven recurrent quantum neural network universalitycited by 5
- 2025Iterative Quantum Feature Mapscited by 3
Built on by
Not cited yet.