Skip to content
Preprint

Quantum magic and non-commutativity as computational resources in quantum reservoir computing

Jul 2026 · 3 citations · 51 references
Physics

TL;DR

A theoretical framework in Pauli-Liouville space is developed that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources and shows that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic.

Abstract

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.

View source

Similar papers

Preprint Jul 2026

Robust Quantum Learning through Hamiltonian Reservoir Computing

It is found 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.

Youya Xu, Chengyong Yu, Sanjib Ghosh · 0 citations
Aug 2026

Non-Hermitian quantum reservoir computing

Quantum reservoir computing (QRC) offers a powerful approach to exploit the rich dynamics of quantum systems for information processing. However, the computational performance of conventional Hermitian reservoirs is inherently constrained by their nonlinearity and information-spreading ability. In this work, we propose a non-Hermitian QRC in which non-Hermitian dynamics are employed as a tunable resource to significantly enhance the QRC performance. By incorporating an imaginary interaction term into the one-dimensional XY spin model, the reservoir's information propagation extends beyond the Lieb-Robinson bound, resulting in accelerated information scrambling. Through spectral analysis and memory evaluation, we demonstrate that the non-Hermitian reservoir can be tuned toward the edge of chaos by varying a single parameter that controls the non-Hermitian strength. This tuning optimizes both memory and computational capacities, which are crucial for processing temporal sequences. For applications, we evaluate the predictive performance of both classical and quantum chaotic time series. Our results demonstrate superior performance compared with the Hermitian counterpart, with particularly notable advantages in predicting signals generated by the Sachdev-Ye-Kitaev model.

Yusen Wu, Chuan Wang, Lufan Zhang et al. · 0 citations
Review Jul 2026

Quantum Reservoir Computing: Recent Advances and Future Directions

A common system model is developed that connects QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations and specifies the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.

Shehbaz Tariq, M. Talha, Arshid Ali et al. · 0 citations
Preprint Jul 2026

A Reservoir Computing Approach to Quantum Gate Synthesis

Group Reservoir Computing is introduced, an efficient machine-learning paradigm for learning temporal dynamics whose training reduces to a single linear regression, to reduce the resources required.

F. Caravelli, Roberto Menta, Antonio Sannia · 0 citations
Preprint Jul 2026

General theory of monitored Quantum Reservoir Computing

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.

Oriol Morguí-Sancho, Gonzalo Manzano, G. Giorgi et al. · 2 citations
Preprint Jul 2026

Fisher-Orthogonal Memory in 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.

Ce Wang, Xingze Qiu · 0 citations