Quantum reservoir computing is an emergent field in which quantum dynamical systems are exploited for temporal information processing. Previous work found a feature that makes a quantum reservoir valuable: contractive dynamics of the quantum reservoir channel toward input-dependent fixed points. These results are enhanced in this paper by finding conditions that guarantee a crucial aspect of the reservoir's design: distinguishing between different input sequences to ensure a faithful representation of temporal input data. This is implemented by finding a condition that guarantees injectivity in reservoir computing filters, with a special emphasis on the quantum case. We provide several examples and focus on a family of quantum reservoirs that is much used in the literature; it consists of an input-encoding quantum channel followed by a strictly contractive channel that enforces the echo state and the fading memory properties. This work contributes to analyzing valuable quantum reservoirs in terms of their input-dependence.
Quantum reservoir computing is an emergent field in which quantum dynamical systems are exploited for temporal information processing. Previous work found a feature that makes a quantum reservoir valuable: contractive dynamics of the quantum reservoir channel toward input-dependent fixed points. These results are enhanced in this paper by finding conditions that guarantee a crucial aspect of the reservoir's design: distinguishing between different input sequences to ensure a faithful representation of temporal input data. This is implemented by finding a condition that guarantees injectivity in reservoir computing filters, with a special emphasis on the quantum case. We provide several examples and focus on a family of quantum reservoirs that is much used in the literature; it consists of an input-encoding quantum channel followed by a strictly contractive channel that enforces the echo state and the fading memory properties. This work contributes to analyzing valuable quantum reservoirs in terms of their input-dependence.
Most existing results in the analysis of quantum reservoir computing (QRC) systems with classical inputs have been obtained using the density matrix formalism. This paper shows that alternative representations can provide better insight when dealing with design and assessment questions. More explicitly, system isomorphisms are established that unify the density matrix approach to QRC with the representation in the space of observables using Bloch vectors associated with Gell-Mann bases. It is shown that these vector representations yield state-affine systems previously introduced in the classical reservoir computing literature and for which numerous theoretical results have been established. This connection is used to show that various statements in relation to the fading memory property (FMP) and the echo state property (ESP) are independent of the representation and also to shed some light on fundamental questions in QRC theory in finite dimensions. In particular, a necessary and sufficient condition for the ESP and FMP to hold is formulated using standard hypotheses, and contractive quantum channels that have exclusively trivial semi-infinite solutions are characterized in terms of the existence of input-independent fixed points.
Quantum reservoir computing (QRC) provides a powerful framework for processing temporal data using quantum dynamics, but incorporating measurements into the reservoir remains a fundamental challenge and distinctive feature with respect to classical settings. The induced back-action can vary from a source of disturbance to a computational resource, as measurement deeply modifies the dynamics underlying temporal processing. Existing approaches have treated specific monitoring schemes independently, missing the common physical principles governing online quantum reservoirs. Here we develop a general theory of monitored quantum reservoir computing based on indirect quantum measurements, which unifies projective, weak, partial, and dissipative monitoring protocols within a single operational framework. Measurement back-action can serve as a controllable resource, providing the effective dissipation and non-unital dynamics required for successful QRC, even when the underlying unmonitored evolution is unsuitable. We derive general criteria under which monitored dynamics satisfy the echo-state property, fading memory, and input separability, including a necessary and sufficient condition for emergent strict contractivity. By comparing different monitoring schemes under a common reference dynamics, we show that these protocols are not interchangeable parameterizations to be optimized for peak performance, but rather constitute qualitatively distinct routes to computational capability, each enabled by the interplay between information extraction and measurement-induced disturbance -- a trade-off that can be further shaped through time multiplexing. Our results provide a unified theoretical foundation for online monitored quantum reservoir computing and establish quantum measurement engineering as a systematic approach for designing reservoir architectures across different quantum platforms.
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.
Quantum reservoir computing (QRC) provides a hardware-efficient paradigm for temporal information processing on near-term quantum devices. Despite rapid experimental progress, a rigorous understanding of the structural conditions required for its scalable quantum-enhanced performance remains lacking. Here, we develop a theoretical framework in Pauli-Liouville space that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources. We first analyze the widely used qubit-resetting scheme and establish that quantum magic generated by reservoir dynamics is a necessary condition for effective computation, a requirement more fundamental than ESP. However, we prove that this architecture faces inherent expressivity limitations: all nonlinear processing originates exclusively from the classical encoding map, imposing an unavoidable trade-off between nonlinearity and memory capacity. To circumvent this structural bottleneck, we rigorously analyze Hamiltonian encoding, in which temporal inputs are embedded directly into the continuous dynamics generator. We show that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic. Crucially, for any non-trivial drive Hamiltonian, the discrete-time update map exhibits a transcendental, infinite-order nonlinear dependence on the instantaneous input. Moreover, the intrinsic non-commutativity of the open-system generators governs the temporal coupling of these nonlinearities, producing highly non-separable processing of the input history. Our results establish a rigorous theoretical hierarchy of QRC architectures and provide prescriptive design principles for experiments targeting genuine quantum advantages in temporal processing.
The intersection of quantum information processing and machine learning has recently at-tracted considerable interest within the physics and artificial intelligence communities. From a physical perspective, quantum computing offers fundamentally new modes of information processing, enabled by superposition, interference, and entanglement, which can lead to ad-vantages in computational speed and resource efficiency over classical approaches. These developments have motivated the exploration of machine learning paradigms that lever-age quantum dynamics as a computational resource. In parallel, reservoir computing—a non–von Neumann and neuromorphic computing framework—has gained attention due to its reliance on high-dimensional dynamical systems, in-memory computation, and low en-ergy consumption. Quantum reservoir computing extends this paradigm by exploiting the intrinsic dynamics of quantum many-body systems, such as spin networks, to process tem-poral information. Despite growing interest in quantum reservoir architectures, the role of genuinely quantum resources, in particular entanglement, in determining their information-processing capabilities remains incompletely understood. In this thesis, we study a distributed spin-network reservoir in which two independent time series are injected into separate qubits. Using short-term memory capacity as an opera-tional measure, we analyze how information introduced at distinct sites propagates through the network and how different entanglement structures contribute to storing and combining past inputs. Focusing on bilinear memory tasks, which require reconstructing the product of the two inputs at various delays, we probe temporal memory. Due to the computational cost associated with simulating open quantum many-body dynamics, the present study focuses on a minimal spin-network architecture consisting of four qubits, with two qubits serving as input nodes that receive independent time series. Even for such moderate system sizes, the numerical integration of the open-system dynamics are computationally demanding. Nevertheless, this minimal setting already captures the essential mechanisms of distributed information processing in quantum reservoirs. By computing the logarithmic negativity across different bipartitions of the reservoir, we investigate how memory performance relates to the underlying entanglement structure. We find that the short-term memory capacity is maximized at relatively weak coupling strengths, where entanglement is present but remains moderate. Among the various bipar-titions, the entanglement between the two input qubits consistently plays the most promi-nent role in learning performance. In this optimal regime, the reservoir exhibits long-lived memory, while a characteristic reduction in performance at zero delay, observed across all frequencies, reflects the finite time required for information to propagate through the sys-tem. Taken together, these results indicate that effective learning in distributed quantum reservoir computing is enabled by moderate, well-structured entanglement, rather than by maximal correlations.
Quantum reservoir computing is an unconventional computing approach that exploits the quantumness of physical systems used as reservoirs to process information, combined with an easy training strategy. An overview is presented about a range of possibilities including quantum inputs, quantum physical substrates and quantum tasks. Recently, the framework of quantum reservoir computing has been proposed using Gaussian quantum states that can be realized e.g. in linear quantum optical systems. The universality and versatility of the system makes it particularly interesting for optical implementations. In particular, full potential of the proposed model can be reached even by encoding into quantum fluctuations, such as squeezed vacuum, instead of classical intense fields or thermal fluctuations. Some examples of the performance of this linear quantum reservoir in temporal tasks are reported.