Quantum Reservoir Autoencoder: Conditions, Protocol, and Noise Resilience
Hikaru Wakaura, Taiki Tanimae

TL;DR
This paper introduces a quantum reservoir autoencoder that enables bidirectional data transformation, demonstrating high accuracy under ideal conditions and analyzing noise effects, with implications for quantum machine learning.
Contribution
The paper presents the first quantum reservoir autoencoder protocol with empirical validation, addressing noise resilience and revealing the importance of iterative processing over feature dimension.
Findings
Achieves mean-squared error of ~10^{-17} under ideal conditions.
Degradation of MSE to 10^{-3}--10^{-1} under realistic noise.
Iterative protocol structure is the main noise bottleneck.
Abstract
Quantum reservoir computing exploits fixed quantum dynamics and a trainable linear readout to process temporal data, yet reversing the transformation -- reconstructing the input from the reservoir output -- has been considered intractable due to the recursive nonlinearity of sequential quantum state evolution. We introduce the quantum reservoir autoencoder, a four-equation encode--decode protocol with cross-key pairing, and constructively empirically demonstrate that satisfying reservoir--key combinations can be found using a full XYZ Hamiltonian reservoir (10~data qubits, feature dimension~76, 16~random Hamiltonian realizations). Under ideal conditions the mean-squared error (MSE) reaches for data lengths up to 30; under shot noise (1\,000~shots) and depolarizing noise (), the MSE degrades to --. Asymmetric resource allocation -- 10~shots…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
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 · Advanced Memory and Neural Computing
