REVIEW 8 cited by
Expressivity of Quantum Reservoir Computers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Expressivity of Quantum Reservoir Computers
read the original abstract
Using Hamiltonian encoding to inject an input into parameterized quantum circuits (PQCs), the output of the PQC can be written as truncated Fourier series. In recent years, the expressivity of PQCs was established as the number of frequencies contained in this Fourier series. While this concept has also been applied to other quantum machine learning (QML) paradigms, a clear notion of expressivity for temporal information processing with quantum systems is still lacking. Here, we introduce such a notion to the field of quantum reservoir computing (QRC). We analytically derive an expression for the readouts showing that the output of a QRC can be interpreted as a multi-dimensional Fourier series. We give a formula for the growth of expressivity induced by the sequential information injection, which we corroborate with numerical simulations, calculating explicitly the number of multi-dimensional output functions which can be generated from the readouts. Our results show that the specific interplay between system size, input encoding, and memory time gives rise to a boundary on the system size beyond which it is obstructive to further increase the reservoir size in extreme scrambling systems. We propose a recipe for determining this maximal system size for a given QRC setup.
Forward citations
Cited by 8 Pith papers
-
Fisher-Orthogonal Memory in Quantum Reservoir Computing
Clifford-routed quantum reservoirs that store each past input along a distinct Pauli direction have diagonal Fisher memory matrices and outperform optimized random Ising reservoirs in simulated finite-shot delay tasks.
-
Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs
A tunable partial-SWAP mechanism enables direct control of memory dissipation rates in quantum reservoir networks on gate-based quantum processors.
-
Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs
A hardware-realizable tunable partial-SWAP is introduced to control the rate of memory dissipation in recurrent quantum reservoir computing architectures, validated via simulation and IBM QPUs.
-
Multivariate quantum reservoir computing with discrete and continuous variable systems
Quantum reservoirs handle multivariate time series best with task-specific encodings that leverage non-classical effects.
-
Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach
A Pauli-transfer-matrix analysis of QELMs reveals the full set of nonlinear Pauli features generated by encoding and transformed by quantum channels, producing an interpretable classical nonlinear vector autoregressio...
-
Susceptible Reservoir Architectures for Regime-Conditional Volatility Forecasting
Susceptible reservoir architectures, using open-vs-ring response contrasts and regime-conditioned experts, match GARCH on most assets, beat it on IWM/XLP, and stack with HARQ for a small QLIKE gain.
-
Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs
Introduces tunable partial-SWAP for controllable memory capacity in quantum reservoir networks, modeled as controlled amplitude-damping and validated via STMC and NARMA-5 benchmarks on simulators and IBM QPUs.
-
Quantum Reservoir Computing: Recent Advances and Future Directions
A comprehensive survey of quantum reservoir computing that proposes a common system model, a memory-architecture taxonomy, and resource-accounting standards, concluding that no broad quantum advantage is currently dem...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.