Quantum reservoir computing processes temporal information through driven many-body dynamics, but its performance is ultimately limited by how accurately past inputs can be extracted from finite measurements. Here we formulate this limitation as a local multiparameter estimation problem and introduce a delay-space quantum Fisher information matrix to quantify the distinguishability of information stored at different delays. This perspective identifies Fisher-orthogonal memory as a measurement-efficient design principle: different delays should perturb the reservoir state along mutually Fisher-orthogonal directions. We first analyze the single-qubit limit using the Gill--Massar bound, revealing an optimal write-store-routing trade-off. Guided by this structure, we construct solvable multi-qubit reservoirs based on Clifford routing orbits and Singer-cycle Pauli algebra. The resulting dynamics yield diagonal delay-space QFIMs with analytically programmable fading profiles. Under finite-shot local Pauli readout, these reservoirs retain sharp memory windows that are absent in a validation-selected Ising baseline. Their product-task behavior is governed by second-order responses inherited from the same Pauli-routing algebra. Our results provide an analytically controlled route toward measurement-efficient quantum reservoir computing.
Quantum reservoir computing processes temporal information through driven many-body dynamics, but its performance is ultimately limited by how accurately past inputs can be extracted from finite measurements. Here we formulate this limitation as a local multiparameter estimation problem and introduce a delay-space quantum Fisher information matrix to quantify the distinguishability of information stored at different delays. This perspective identifies Fisher-orthogonal memory as a measurement-efficient design principle: different delays should perturb the reservoir state along mutually Fisher-orthogonal directions. We first analyze the single-qubit limit using the Gill--Massar bound, revealing an optimal write-store-routing trade-off. Guided by this structure, we construct solvable multi-qubit reservoirs based on Clifford routing orbits and Singer-cycle Pauli algebra. The resulting dynamics yield diagonal delay-space QFIMs with analytically programmable fading profiles. Under finite-shot local Pauli readout, these reservoirs retain sharp memory windows that are absent in a validation-selected Ising baseline. Their product-task behavior is governed by second-order responses inherited from the same Pauli-routing algebra. Our results provide an analytically controlled route toward measurement-efficient quantum reservoir computing.
Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order r. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.
Reservoir computing requires not only long memory, but also memory distributed over the timescales relevant to a given task. In most quantum reservoir computing architectures, however, the memory profile emerges from intrinsic dynamics and cannot be directly engineered. Here we introduce a waveguide-QED quantum reservoir in which coherent memory return is controlled by the coupling geometry. The reservoir consists of a driven Kerr-nonlinear resonator coupled to a one-dimensional waveguide at spatially separated points. An unmeasured propagating field carries information about past inputs and coherently returns it to the resonator after a finite propagation time, forming a non-Markovian feedback channel without intermediate measurement or classical reinjection. Delay-resolved memory benchmarks reveal two complementary functions: waveguide propagation determines when past information returns, whereas Kerr dynamics convert the returned field into nonlinear temporal features accessible through a linear readout. NARMA-n prediction shows that the optimal feedback delay shifts systematically with task order and approximately tracks the explicit input-product lag. These results establish coherent delayed feedback as a mechanism for engineering task-relevant memory in quantum reservoir computing.
The performance of a quantum reservoir computer in temporal processing tasks depends on how its driven quantum substrate retains information about past inputs, distributes it across physical degrees of freedom, and loses it through environmental dissipation and measurement feedback. We formulate these processes using a classical-quantum state obtained by restricting a reservoir process tensor to classical input encoding and single-time readout. Conditional subsystem Holevo quantities describe information about selected input histories and bound its accessibility to measurements on subsystems of the reservoir. In a six-qubit all-to-all transverse-field Ising reservoir, we find that the total stored information changes relatively little across Hamiltonian parameters, while its spatial distribution and temporal decay vary strongly. Effective diagnostics of these two behaviours identify different regions of high information-processing capacity for linear and higher-degree temporal tasks. Measurement-induced dephasing can improve noiseless task performance when it increases forgetting rates without strongly reducing information delocalisation. The framework separates storage from subsystem accessibility and provides a common description of information flow in driven quantum learning systems.
Quantum reservoir computing (QRC) harnesses driven quantum dynamics for time-series processing, yet the mechanisms behind the differing performance levels across its many implementations remain unclear. We show that apparently unrelated approaches-including memory restriction, weak measurements, operation near the edge of quantum chaos, and dissipative dynamics-are in fact governed by the same underlying principle, namely a tunable balance between memory retention and nonlinear response. Using the information processing capacity, a dynamical measure from nonlinear systems theory, we place these behaviors in a unified framework and identify the regimes in which quantum reservoirs surpass the standard protocol. Our results reveal a fundamental connection between memory and nonlinear response. This provides a general design principle for enhanced information processing and enables systematic analysis and optimization inspired by classical dynamical quantifiers.
Abstract We study quantum state-space models (QSSMs) as recurrent architectures for sequence pro cessing, with an emphasis on the interplay between quantum dynamics, measurement design, and readout expressivity. We consider a delayed XOR benchmark, a canonical task for probing long-range memory and parity-based dependencies, and implement a noiseless, statevector-based quantum reservoir driven by input-conditioned unitary evolution. Using expectation values of local Pauli observables as features, we find that quantum state space dynamics alone remain near chance level on the delayed XOR task, despite the high dimensional and nonlinear nature of the underlying quantum evolution. This result highlights a fundamental observability limitation: parity information is encoded in higher-order correlations that are not linearly accessible through simple expectation-value measurements. We then demonstrate that augmenting the quantum features with a minimal tapped-delay readout, including a bilinear interaction term between delayed inputs, restores perfect gener alization. This augmentation does not modify the quantum dynamics, but instead aligns the observation model with the algebraic structure of the task. Our findings clarify the respective roles of quantum dynamics and measurement interfaces in quantum recurrent models, and suggest that performance gains arise not solely from quantum evolution, but from the coherent integration of dynamics, observability, and readout design.
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.