The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this within the framework of quantum reservoir computing by introducing a tunable N -qubit random circuit model, where a fraction p of Clifford gates are probabilistically substituted with nonstabilizing conditional- T ̂ gates. We establish a direct correspondence between the reservoir's performance on temporal processing tasks and its entanglement-spectrum statistics and long-range nonstabilizer resource content. To assess scalability, we study the scaling of the antiflatness of states in the large- N limit at a fixed circuit depth ratio d / N ∼ O ( 1 ) . This is taken as a witness to the concentration of measures, a known impediment to learning in thermalizing systems. We demonstrate that the learnability and scalability of the reservoir can be continuously controlled by the parameter p , allowing us to navigate from classically tractable to maximally expressive quantum dynamics. These architecture-agnostic results provide a general strategy for designing tunable and expressive quantum reservoirs, highlighting how certain nonclassical properties control average-case intrinsic learnability and functionality.
The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this within the framework of quantum reservoir computing by introducing a tunable N -qubit random circuit model, where a fraction p of Clifford gates are probabilistically substituted with nonstabilizing conditional- T ̂ gates. We establish a direct correspondence between the reservoir's performance on temporal processing tasks and its entanglement-spectrum statistics and long-range nonstabilizer resource content. To assess scalability, we study the scaling of the antiflatness of states in the large- N limit at a fixed circuit depth ratio d / N ∼ O ( 1 ) . This is taken as a witness to the concentration of measures, a known impediment to learning in thermalizing systems. We demonstrate that the learnability and scalability of the reservoir can be continuously controlled by the parameter p , allowing us to navigate from classically tractable to maximally expressive quantum dynamics. These architecture-agnostic results provide a general strategy for designing tunable and expressive quantum reservoirs, highlighting how certain nonclassical properties control average-case intrinsic learnability and functionality.
Quantum resource theory has sharpened our understanding of the intrinsic complexity of quantum systems, particularly their classical simulability. However, it remains unclear which quantum resource governs the classical learnability of quantum circuits, especially beyond the regime of efficient classical simulation. Here we close this knowledge gap by studying the expectation-value functions of families of tunable quantum circuits, with many applications in digital quantum simulation, quantum metrology, and quantum-system characterization. Specifically, we introduce a new resource measure, the dynamical stabilizer entropy (\DSE), which quantifies how broadly an expectation-value function is distributed across its frequency modes. By relating \DSE to operator stabilizer entropy, we establish a computational phase diagram that compares classical simulators with quantum-data-assisted classical surrogates. We first determine the \DSE-dependent learnability boundary of this diagram by deriving bounds on the sample complexity and runtime of classical surrogates, and by developing a \DSE-guided surrogate. We then complete the diagram by proving, under standard complexity-theoretic assumptions, the existence of circuit families that can be efficiently learned by this surrogate but cannot be efficiently emulated from their circuit descriptions alone. Numerical experiments on random and structured circuits with up to 80 qubits support the predicted \DSE-dependent computational landscape. These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning, motivate resource measures linking quantum resources to learnability, and guide the design of learning-based algorithms for scalable quantum systems beyond the reach of direct classical simulation.
Reservoir computing is a framework which is primarily used for temporal information processing, using the intrinsic dynamics of an underlying physical system. The framework, in a quantum setup, is implemented using ergodic dynamics associated with Hamiltonian models. The computational power of the reservoir is closely tied to this underlying dynamical nature, and to probe this further, we study the effectiveness of a reservoir that is made using structured brickwall circuits built from two-qubit gates. Here, the global ergodic nature of the circuit model results from the said arrangement, which has an important role in extracting useful performance with a minimal setup that is independent of an associated Hamiltonian. We focus on the nature of the gates used in this setup and evaluate the resulting reservoir performance, correlating the same with known results on the dynamical nature of the circuit in question. As a baseline, we analyse brickwall circuits composed of Haar-random two-qubit gates, before moving on to dual-unitaries, where tunable ergodic properties allow us to systematically investigate its relationship with reservoir performance. We further consider a class of non-random two-qubit gates obeying a specific solvability condition, wherein the associated dynamics surpasses the equivalent circuit made up of two qubit Haar random unitaries in terms of randomness. Finally, we consider examples of Krylov space analytics, which allow for a reliable prediction of effective circuit reservoirs for sufficient task performance. Using the introduced metrics we validate the reservoir for time-series prediction using standard synthetic data sets to evaluate the fading memory capacity and accuracy for prediction tasks. Our results indicate that structured quantum circuits would serve as effective models that yield better and efficient task performance in reservoir computing applications.
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.
Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it exploits the large computational capacity of qubits without suffering from typical issues arising when training variational quantum circuits. In particular, quantum gate-based echo state networks have proven effective when the evolution of the reservoir circuit is non-unital. Nonetheless, a method for ensuring a tunable and stable non-unital circuit evolution was lacking. We propose an algorithm that induces damping by applying a controlled rotation to each qubit in the reservoir. It enables tunable, circuit-level amplitude amplification of the zero state, maintaining the system away from the maximally mixed state and preventing information loss caused by repeated mid-circuit measurements. The algorithm is inherently stable over time, as it can process arbitrarily long input sequences, beyond the coherence time of individual qubits, by inducing arbitrary damping on each qubit. Moreover, we show that quantum correlations between qubits improve memory retention, underscoring the potential utility of a quantum system as a computational reservoir. We demonstrate, through standard reservoir computing benchmarks, that this algorithm enables robust and scalable quantum random computing on fault-tolerant quantum hardware.
Quantum reservoirs offer a hardware-friendly route to quantum machine learning, replacing trainable circuits with fixed random dynamics and a classical readout. Because the reservoir is not optimized, performance depends entirely on the choice of reservoir family, yet existing diagnostics demand resources that grow exponentially with system size. We introduce a scalable, hardware-agnostic framework built on two complementary quantities. The first is a task-independent order-statistics (ORS) expressivity score, which compares only the largest output probabilities of a reservoir ensemble against an analytical Haar baseline. It never reconstructs the full output distribution, is cost-independent of Hilbert-space dimension, and admits a closed-form depolarizing noise correction, making it directly usable on hardware. The second is the task-dependent effective rank Reff of the feature matrix, which measures how much input-dependent information reaches the readout. We validate the ORS score against established complexity diagnostics and confirm it remains informative under simulated noise and on IBM quantum hardware. Across synthetic and real quantum extreme learning machine and quantum reservoir computing benchmarks, ORS captures the intrinsic expressivity hierarchy of reservoir families while Reff determines when that expressivity becomes usable predictive information.
A distinctive feature of Quantum Reservoir Computing (QRC) is the ability to directly embed quantum input states into the reservoir dynamics. However, the resulting output is fundamentally linear for a single input state, preventing QRC from naturally computing nonlinear functionals such as purity or entropy. We overcome this limitation with a quantum-classical hybrid architecture combining a qubit quantum reservoir with a classical echo state network (ESN), allowing both nonlinear functional approximation and effective temporal processing. We systematically study performance under two information regimes: full-tomography and partial information (single-axis measurements), with the latter demonstrating that the hybrid system outperforms its standalone components in both linear and nonlinear tasks due to the enhanced information retrieval provided by the quantum reservoir. Building on these results, we apply an online monitoring protocol that explicitly accounts for measurement back-action and finite measurement ensembles, enabling a realistic assessment of performance under experimental conditions. These results establish hybrid quantum-classical reservoir computing (HRC) architectures as a practical and scalable route for enhanced quantum machine learning on near-term qubit hardware.