pith. sign in

arxiv: 2205.06809 · v1 · pith:FQN3FA3Lnew · submitted 2022-05-13 · 🪐 quant-ph · cond-mat.dis-nn

Time Series Quantum Reservoir Computing with Weak and Projective Measurements

classification 🪐 quant-ph cond-mat.dis-nn
keywords quantummemoryreservoirprotocolsdatameasurementprocessingtime
0
0 comments X
read the original abstract

Quantum machine learning represents a promising avenue for data processing, also for purposes of sequential temporal data analysis, as recently proposed in quantum reservoir computing (QRC). The possibility to operate on several platforms and noise intermediate-scale quantum devices makes QRC a timely topic. A challenge that has not been addressed yet, however, is how to efficiently include quantum measurement in realistic protocols, while retaining the reservoir memory needed for sequential time series processing and preserving the quantum advantage offered by large Hilbert spaces. In this work, we propose different measurement protocols and assess their efficiency in terms of resources, through theoretical predictions and numerical analysis. We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance both for memory and forecasting tasks with two successful measurement protocols. One consists in rewinding part of the dynamics determined by the fading memory of the reservoir and storing the corresponding data of the input sequence, while the other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory. Our work establishes the conditions for efficient protocols, being the fading memory time a key factor, and demonstrates the possibility of performing genuine online time-series processing with quantum systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach

    quant-ph 2026-02 unverdicted novelty 7.0

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

  2. Evaluating quantum circuits in the reservoir computing paradigm

    quant-ph 2026-05 unverdicted novelty 5.0

    Brickwall quantum circuits with Haar-random, dual-unitary, and solvable two-qubit gates serve as effective reservoirs for temporal processing tasks, with performance correlated to circuit dynamics and validated on syn...

  3. Evaluating quantum circuits in the reservoir computing paradigm

    quant-ph 2026-05 unverdicted novelty 5.0

    Brickwall circuits from Haar-random, dual-unitary, and solvable two-qubit gates are tested as quantum reservoirs, showing effective fading memory and prediction accuracy on synthetic time-series data.