Feedback-driven recurrent quantum neural network universality
Lukas Gonon, Rodrigo Mart\'inez-Pe\~na, Juan-Pablo Ortega

TL;DR
This paper demonstrates that feedback-driven quantum recurrent neural networks are universal function approximators with efficient qubit scaling, enabling practical real-time quantum reservoir computing.
Contribution
It proves the universality of quantum recurrent neural networks with linear readouts and analyzes their approximation capabilities without the curse of dimensionality.
Findings
Quantum RNNs can approximate regular state-space systems efficiently.
Number of qubits grows logarithmically with inverse accuracy.
Quantum RNNs are universal with linear readouts.
Abstract
Quantum reservoir computing uses the dynamics of quantum systems to process temporal data, making it particularly well-suited for machine learning with noisy intermediate-scale quantum devices. Recent developments have introduced feedback-based quantum reservoir systems, which process temporal information with comparatively fewer components and enable real-time computation while preserving the input history. Motivated by their promising empirical performance, in this work, we study the approximation capabilities of feedback-based quantum reservoir computing. More specifically, we are concerned with recurrent quantum neural networks, which are quantum analogues of classical recurrent neural networks. Our results show that regular state-space systems can be approximated using quantum recurrent neural networks without the curse of dimensionality and with the number of qubits only growing…
Peer Reviews
Decision·ICLR 2026 Poster
1. IMHO, this work is the first to establish quantitative universal approximation bounds for recurrent quantum neural networks. Prior to this, the literature lacked error guarantees for quantum recurrent models. The paper fills that gap by providing rigorous theorems (with proofs) that demonstrate RQNNs’ ability to approximate a broad class of time-dependent functions to arbitrary accuracy. 2. Also, it shows that RQNNs can achieve universality without the need for high-degree polynomial readout
1. Thm 4.6 relies on the requirement that the state transition function lies in the Barron function class and has bounded first derivatives (plus contractivity $\lambda<1$), which means the results apply primarily to “well-behaved” systems (smooth, band-limited, and not too chaotic). Real-world temporal processes might violate these conditions (e.g., non-smooth or highly non-contractive dynamics). 2. Minor weakness: the paper does not include any experimental or numerical simulation results to
The derivations in the study seem mathematically rigorous. The authors also provide useful background on filters and functionals, and a helpful review of existing literature in the related works and appendix sections.
The study is not self-contained enough: references in many places to previous work Gonon and Jacquier (2025). This makes it harder to follow. In particular, this issue appears when the authors aim to introduce the unitary matrix V, which seems to be important for the recurrent quantum neural network architecture. But all details are relayed to the previous publication. The study needs to better work out the novelty: As often mentioned many times throughout the manuscript, the work largely follo
- Relevant theoretetical contribution - Excellent technical depth and rigor - Clear positioning in literature and in particular w.r.t recent literature
- Lack of empirical validation. Theoretical findings are strong. However, no numerical or experimental results are a limitation for this paper. - Some assumption (e.g., Barron-type integrability) may restrict practical applicability - A comparison between the proposed approach and classical RNNs or RC models for large n
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Reservoir Computing · Quantum Computing Algorithms and Architecture · Quantum many-body systems
