The paper investigates quantum reservoir computing using highly scrambling quantum systems modeled by high‑order unitary designs. It shows that in noiseless settings, measurement readouts become exponentially concentrated as the reservoir size grows, but this concentration does not worsen with repeated iterations, while memory of early inputs decays exponentially with both reservoir size and iterations. In noisy environments, memory also decays exponentially over time for local noisy channels, and the study introduces new proof techniques for bounding concentration in temporal quantum models. Numerical results indicate that even physical reservoirs, such as an Ising model in a quantum‑chaotic phase, can exhibit exponential concentration, whereas reservoirs in a many‑body localized phase or at the edge of chaos do not.
arXiv:2607. 18552v1 Announce Type: cross Abstract: 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.
Quantum reservoir computing uses a fixed quantum circuit as a feature generator and trains only a simple linear readout on top of it. This makes it cheap to train and free of the optimisation problems that affect many quantum machine-learning models.
The paper introduces the Quantum Scrambling Born Machine, a quantum generative model that uses a fixed entangling unitary—acting as a scrambling reservoir—to generate multi‑qubit entanglement while only optimizing single‑qubit rotations. Three types of entanglers are examined: a Haar random unitary, a finite‑depth brickwork random circuit, and analog time evolution under nearest‑neighbor spin‑chain Hamiltonians. The study finds that once the entangler achieves near‑Haar‑typical entanglement, the model can learn benchmark distributions with little sensitivity to the specific scrambler, and that making the Hamiltonian couplings trainable turns the task into a variational Hamiltonian problem with performance competitive with classical generative models at comparable parameter counts.
arXiv:2607. 07978v1 Announce Type: cross Abstract: Quantum reservoir computing uses a fixed quantum circuit as a feature generator and trains only a simple linear readout on top of it.
arXiv:2605. 12713v3 Announce Type: replace-cross Abstract: In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed.
arXiv:2501. 08640v2 Announce Type: replace Abstract: We propose a way to bound the generalisation errors of several classes of quantum reservoirs using the Rademacher complexity.
arXiv:2602.22061v3 Announce Type: replace-cross Abstract: Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum phys...
arXiv:2607. 16281v1 Announce Type: cross Abstract: The analysis of highly non-linear stochastic data within non-equilibrium dynamical systems requires computational frameworks capable of detecting latent phase transitions before systemic structural breakdowns occur.
arXiv:2610. 02068v1 Announce Type: cross Abstract: How complex can the responses of a quantum device become as it runs longer with a fixed internal memory?
The paper introduces task‑resolved Fisher spectroscopy for quantum reservoir computing, defining orthonormal score coordinates from prediction targets that reweight labeled histories to produce an affine family of reservoir states and measurement outcomes. It establishes a Fisher‑information hierarchy linking state quantum Fisher information, measurement record Fisher information, and moment matrices up to many‑body order, providing a quadratic form that equals the stationary capacity of the optimal linear readout. The method requires only stationary labeled records and measured outcomes, enabling predictions of held‑out capacities, necessary feature order, and measurement‑budget dependence, and demonstrates how optimizing local measurement axes can recover hidden task information in a five‑spin open reservoir.
arXiv:2607. 09905v1 Announce Type: cross Abstract: Can a small quantum computer forecast a changing signal better than an ordinary classical method?
arXiv:2305. 06177v1 Announce Type: cross Abstract: We present a thermodynamic analysis of a quantum engine that uses a single quantum particle as its working fluid, inspired by Szilard's classical single-particle engine.