Continuous-Time Quantum Reservoirs

This paper studies temporal learning with quantum reservoirs driven by continuous-time dynamics. Our goal is to model long-range dependencies under irregular sampling while avoiding backpropagation through time and repeated numerical ODE integration. We formulate a Continuous-time Quantum Reservoir (CQR) framework in which an input-modulated Hamiltonian drives Schrödinger evolution, and a classical linear readout is fitted from sampled quantum features. We analyze three variants: (i) CQR-unitary, which uses expectation values of Hermitian observables; (ii) CQR-measurement, which uses projective-measurement probabilities; and (iii) CQR-trainable, which additionally tunes input-coupling Hamiltonian parameters via parameter-shift updates. Experiments on Lorenz forecasting, human-activity classification, and two regression benchmarks show competitive accuracy, improved memory capacity, and clear compute-accuracy trade-offs across variants. We also provide a Stone-Weierstrass-based universality result for the induced feature algebra and discuss practical design limitations.

Authors

Publication Details

Journal
Repository@Nottingham (University of Nottingham)
Published
2026-01-21
Primary Topic
Neural Networks and Reservoir Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Continuous-Time Quantum Reservoirs

Anthony Siming Chen, Kyriakos G. Vamvoudakis
Repository@Nottingham (University of Nottingham)
Neural Networks and Reservoir Computing
article

Continuous-Time Quantum Reservoirs

Anthony Siming Chen, Kyriakos G. Vamvoudakis
article en

Abstract

This paper studies temporal learning with quantum reservoirs driven by continuous-time dynamics. Our goal is to model long-range dependencies under irregular sampling while avoiding backpropagation through time and repeated numerical ODE integration. We formulate a Continuous-time Quantum Reservoir (CQR) framework in which an input-modulated Hamiltonian drives Schrödinger evolution, and a classical linear readout is fitted from sampled quantum features. We analyze three variants: (i) CQR-unitary, which uses expectation values of Hermitian observables; (ii) CQR-measurement, which uses projective-measurement probabilities; and (iii) CQR-trainable, which additionally tunes input-coupling Hamiltonian parameters via parameter-shift updates. Experiments on Lorenz forecasting, human-activity classification, and two regression benchmarks show competitive accuracy, improved memory capacity, and clear compute-accuracy trade-offs across variants. We also provide a Stone-Weierstrass-based universality result for the induced feature algebra and discuss practical design limitations.

Repository@Nottingham (University of Nottingham)
Openalex Percentile: Top 15%
Neural Networks and Reservoir Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.