Recurrent Quantum Feature Maps for Reservoir Computing
arXiv QuantumArchived Apr 07, 2026✓ Full text saved
arXiv:2604.03469v1 Announce Type: new 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 de
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 3 Apr 2026]
Recurrent Quantum Feature Maps for Reservoir Computing
Utkarsh Singh, Aaron Z. Goldberg, Christoph Simon, Khabat Heshami
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.
Comments: 11 pages, 13 figures
Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG)
Cite as: arXiv:2604.03469 [quant-ph]
(or arXiv:2604.03469v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2604.03469
Focus to learn more
Submission history
From: Utkarsh Singh [view email]
[v1] Fri, 3 Apr 2026 21:33:10 UTC (289 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-04
Change to browse by:
cs
cs.LG
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)