Modeling the response of driven many-body quantum systems from input--output data is difficult: the dynamics are nonlinear, history dependent, and expensive to simulate as system size grows. A paradigmatic case is High-Harmonic Generation~(HHG), where a strong field drives a medium to emit radiation that is highly sensitive to the drive and encodes long-range temporal correlations. We introduce a dissipative quantum reservoir computing~(DQRC) framework that builds a digital twin of such a system, learning its input--output map directly from data while the reservoir---itself a small open quantum system---stays fixed and only a classical readout is trained. We show that a minimal single-qubit reservoir reproduces the HHG response of a substantially larger Ising spin chain, and on a representative benchmark matches and on several metrics surpasses previously reported temporal convolutional and Kolmogorov--Arnold-network models, while using a simpler, physically realizable system. A single fixed reservoir further generalizes across a broad range of drives, indicating that it learns a shared physical response structure rather than memorizing trajectories. These results establish dissipative quantum reservoirs as compact, physically grounded digital twins for nonlinear, memory-dependent quantum dynamics.
Code is available at \href{https://github.com/AI-and-Quantum-Computing/DQuRC}{https://github.com/AI-and-Quantum-Computing/DQuRC}.
Modeling the response of driven many-body quantum systems from input--output data is difficult: the dynamics are nonlinear, history dependent, and expensive to simulate as system size grows. A paradigmatic case is High-Harmonic Generation~(HHG), where a strong field drives a medium to emit radiation that is highly sensitive to the drive and encodes long-range temporal correlations. We introduce a dissipative quantum reservoir computing~(DQRC) framework that builds a digital twin of such a system, learning its input--output map directly from data while the reservoir---itself a small open quantum system---stays fixed and only a classical readout is trained. We show that a minimal single-qubit reservoir reproduces the HHG response of a substantially larger Ising spin chain, and on a representative benchmark matches and on several metrics surpasses previously reported temporal convolutional and Kolmogorov--Arnold-network models, while using a simpler, physically realizable system. A single fixed reservoir further generalizes across a broad range of drives, indicating that it learns a shared physical response structure rather than memorizing trajectories. These results establish dissipative quantum reservoirs as compact, physically grounded digital twins for nonlinear, memory-dependent quantum dynamics.
Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.
In quantum reservoir computing, a fixed quantum system transforms an input signal, while learning reduces to training a simple linear readout on its measured outputs. Since the quantum dynamics themselves are never optimized, the method is well suited to today's hardware. Yet these dynamics must still be chosen carefully, because their settings remain fixed throughout training and inference. It therefore remains open whether useful dynamics occupy a task-transferable region of control space and whether that region can be found without target-task tuning. We address this question for a dissipative reservoir by mapping performance over three central physical controls: the strength of the input drive, the coupling between neighboring qubits, and the rate of dissipation. Good performance concentrates in a well-defined operating band of this control space. This region transfers across tasks and reservoir initializations, and the same regime persists under an architectural change. It is also mechanistically grounded, since it disappears whenever any of the mechanisms that create it is removed. Finally, the region can be located cheaply before any task is run, using a simple memory diagnostic.
[eng] Quantum technologies are rapidly evolving toward regimes where controllable quantum dynamics can be exploited for information processing, simulation, and machine learning. Within this landscape, quantum reservoir computing (QRC) has emerged as an appealing paradigm: it harnesses the high-dimensional dynamics of quantum systems to perform temporal tasks with minimal training overhead, making it particularly well suited for current noisy intermediate-scale quantum devices. In parallel, modern perspectives on quantum many-body systems reveal that tools such as complex-network theory and spectral methods can uncover structures in quantum states and dynamics that remain hidden to conventional approaches. This thesis brings these threads together. It explores how quantum statistics, many-body correlations, chaoticity, and metastability shape information processing in QRC. Furthermore, we have also demonstrated how network-theoretic methods can reveal new features of strongly correlated phases. This thesis contributes to the emerging field of quantum reservoir computing by examining how different physical models shape the learning capabilities of quantum reservoirs. Each article investigates a distinct class of systems: simple hopping networks governed by particle statistics, interacting atomic lattices described by the Bose–Hubbard model, driven-dissipative oscillators exhibiting metastability. Through these diverse settings, a central goal is to identify which physical ingredients enhance the performance of QRC. To address these questions, we combine analytical insights with a broad range of numerical techniques, including exact diagonalization, tensor-network simulations, and open-system dynamics. Together, these approaches provide a unified framework for understanding how quantum dynamics can be exploited for computation. The main findings of the thesis on QRC and complex networks can be summarized as follows. (i) Particle statistics fundamentally shape computational power: fermions exhibit superior information spreading due to their algebra, while bosons can outperform all other substrates when input encoding is optimized. (ii) Metastability constitutes a computational resource: long-lived metastable states enhance memory capacity and allow a fast-injection protocol. (iii) In atomic lattices described by the Bose–Hubbard model, QRC performance is governed by the interplay between interactions and tunneling, with optimal regimes appearing both in the weakly interacting limit and near the onset of quantum chaos; importantly, disorder is not required to achieve high performance. (iv) Complex-network analysis reveals hidden features of the Kitaev chain: network observables sharply detect the topological transition in the Kitaev chain and uncover a previously unnoticed fully connected, perfectly clustered regime linked to ground-state factorization observed in the Ising spin chain.
Quantum learning provides a versatile paradigm for information processing by exploiting the intrinsic representational capacity of high-dimensional Hilbert spaces. Here, we investigate a Hamiltonian-encoding framework for quantum reservoir computing that simultaneously addresses three key challenges in quantum learning: trainability, hardware efficiency, and information stability. In this framework, input data are directly mapped onto a fixed Hamiltonian and transformed into expressive nonlinear features through quantum dynamical evolution. By employing the reservoir-computing paradigm, the approach naturally circumvents the barren plateau problem in quantum learning landscapes. We validate the framework across two complementary platforms: an analog superconducting array processor and a digital gate-based quantum circuit implementation. Despite their fundamentally different realizations, both platforms exhibit comparable representational power and achieve competitive learning performance, establishing a unified framework for cross-platform quantum learning. While both implementations achieve comparable performance, the analog processor may offer a more hardware-efficient realization by bypassing the temporal overhead of gate-based decomposition and thereby making more effective use of finite coherence times, albeit at the expense of universality. Furthermore, we find that finite dissipation suppresses quantum-scrambling-induced instabilities at long evolution times and can enhance learning performance, revealing a constructive role for environmental coupling in stabilizing quantum learning dynamics. Collectively, these results establish Hamiltonian-encoded reservoir computing as a compact, expressive, and hardware-efficient paradigm for quantum learning on current-generation quantum platforms.
Quantum reservoir computing is a machine-learning framework that offers ease of training compared to other quantum neural networks, as it does not rely on gradient-based optimization. Learning is performed in a single step on the output features measured from the quantum system. Various implementations of quantum reservoir computing have been explored in simulations, with different measured features. Although simulations have shown that quantum reservoirs present advantages in performance compared to classical reservoirs, experimental implementations have remained scarce. This is due to the challenge of obtaining a large number of output features that are nonlinear transformations of the input data. In this work, we show that even with a circuit quantum electrodynamics system as simple as a single transmon coupled to a readout resonator, we can implement a proof-of-concept realization of quantum reservoir computing. We obtain a large number of nonlinear features from a single physical system by encoding the input data in the amplitude of a coherent drive and measuring the cavity state in the Fock basis. We demonstrate classification of two classical tasks with significantly smaller hardware resources and fewer measured features compared to classical neural networks. Our experimental results are supported by numerical simulations that show additional Kerr nonlinearity is beneficial to reservoir performance. Our work demonstrates a hardware-efficient quantum neural-network implementation that can be further scaled up and generalized to other quantum machine-learning models.
Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.