Pith. sign in

REVIEW 1 cited by

Time Series Quantum Reservoir Computing with Weak and Projective Measurements

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

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

classification quant-phcond-mat.dis-nn
keywords quantummemoryreservoirprotocolsdatameasurementprocessingtime
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Robust quantum reservoir computers for forecasting chaotic dynamics: generalized synchronization and stability

    quant-ph 2025-06 conditional novelty 6.0 of 10

    Recurrence-free quantum reservoir computers have a constant, contractive Jacobian, which guarantees the echo state property and enables accurate inference of Lyapunov spectra and attractor dimensions.

Pith tools