Fisher-Orthogonal Memory in Quantum Reservoir Computing

Abstract

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.

39 pages,9 figures