Sign inGet started
Paper · arXiv

Recurrent Quantum Feature Maps for Reservoir Computing

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...

AuthorsUtkarsh Singh, Aaron Z. Goldberg, Christoph Simon et al.
Primary categoryquant-ph
Published3 April 2026
Last updated at source3 April 2026
quant-phcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/b598a8c6-ddee-4b82-893d-8bea63c40f42" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.