Back to News
quantum-computing

Recurrent Quantum Feature Maps for Reservoir Computing

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers introduced a novel quantum reservoir computing model using recurrent quantum feature maps, where a fixed quantum circuit processes both current inputs and classical feedback from prior outputs. The approach outperformed classical baselines like echo state networks and multilayer perceptrons on the Mackey-Glass time-series prediction task, achieving lower mean squared error with minimal qubit and circuit depth requirements. Memory capacity analysis confirmed the model’s ability to retain temporal information, aligning with its strong forecasting accuracy in handling sequential data. Noise resilience tests revealed robustness against common quantum noise channels but identified two-qubit gate errors as a critical vulnerability for near-term hardware implementations. The study bridges quantum computing and reservoir computing, offering a scalable, noise-aware framework for temporal data processing with potential near-term applications.
Recurrent Quantum Feature Maps for Reservoir Computing

Summarize this article with:

Quantum Physics arXiv:2604.03469 (quant-ph) [Submitted on 3 Apr 2026] Title:Recurrent Quantum Feature Maps for Reservoir Computing Authors:Utkarsh Singh, Aaron Z. Goldberg, Christoph Simon, Khabat Heshami View a PDF of the paper titled Recurrent Quantum Feature Maps for Reservoir Computing, by Utkarsh Singh and 2 other authors View PDF HTML (experimental) 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. Comments: 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 arXiv-issued DOI via DataCite Submission history From: Utkarsh Singh [view email] [v1] Fri, 3 Apr 2026 21:33:10 UTC (289 KB) Full-text links: Access Paper: View a PDF of the paper titled Recurrent Quantum Feature Maps for Reservoir Computing, by Utkarsh Singh and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-04 Change to browse by: cs cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: 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 Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-machine-learning
government-funding
quantum-hardware
partnership

Source Information

Source: arXiv Quantum Physics