Quantum reservoir computing using Jaynes-Cummings model
Sreetama Das, Gian Luca Giorgi, Roberta Zambrini
TL;DR
This work addresses time-series processing with quantum substrates by evaluating JaynesCummings and dispersive JaynesCummings reservoirs. It employs driving-mediated input encoding and reads out higher order bosonic observables, training a fixed reservoir with Ridge regression. The key findings show an unusual dominance of nonlinear memory over linear memory and competitive Mackey-Glass forecasting in both JC and DJC regimes, with performance enhanced by time multiplexing and higher bosonic excitations. The study demonstrates a viable route to tunable, higher capacity quantum machine learning units and paves the way for scalable quantum reservoir architectures in circuit QED and related platforms.
Abstract
We investigate quantum reservoir computing (QRC) using a hybrid qubit-boson system described by the Jaynes-Cummings (JC) Hamiltonian and its dispersive limit (DJC). These models provide high-dimensional Hilbert spaces and intrinsic nonlinear dynamics, making them powerful substrates for temporal information processing. We systematically benchmark both reservoirs through linear and nonlinear memory tasks, demonstrating that they exhibit an unusual superior nonlinear over linear memory capacity. We further test their predictive performance on the Mackey-Glass time series, a widely used benchmark for chaotic dynamics and show comparable forecasting ability. We also investigate how memory and prediction accuracy vary with reservoir parameters, and show the role of higher-order bosonic observables and time multiplexing in enhancing expressivity, even in minimal spin-boson configurations. Our results establish JC- and DJC-based reservoirs as versatile platforms for time-series processing and as elementary units that overcome the setting of equivalent qubit pairs and offer pathways towards tunable, high-performance quantum machine learning architectures.
