Storage, Scrambling, and Loss of Information in the Quantum Reservoir Computing Paradigm

• URL: http://arxiv.org/abs/2608.07677v2
• Date: Tue, 11 Aug 2026 15:50:57 GMT
• Title: Storage, Scrambling, and Loss of Information in the Quantum Reservoir Computing Paradigm
• Abstract summary: We introduce a classical-quantum state derived from the process tensor representing the dynamical part of this process.<n>We numerically investigate information saturation in the substrate, fading memory of past inputs, and the local accessibility of injected information for a commonly used QRC platform.
• Score: 0.5801044612920815
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The suitability of a quantum reservoir computing (QRC) platform for a given time-series processing task is closely tied to the dynamical properties of its computational substrate and design. Information is injected into, processed by, and read from this substrate, and finally passed to a linear readout layer which is trained to perform a specific task. In this work we introduce a classical-quantum state derived from the process tensor representing the dynamical part of this process for typical QRC protocols found in the literature. Using this object, mutual informations between physical subsystems and subsets of past inputs can be written as Holevo quantities, which we then use to numerically investigate information saturation in the substrate, fading memory of past inputs, and the local accessibility of injected information for a commonly used QRC platform. We then extract two diagnostics that characterise the nonlocal scrambling of information within, and loss of information from the substrate, and compare these to QRC performance across Hamiltonian parameters and measurement strengths. Finally, we comment on future directions that the framework introduced here opens up for the study and extension of the QRC program.

Related papers

• Coherent Floquet quantum reservoirs for molecular property prediction [11.126126867103522]
  Quantum reservoir computing (QRC) uses quantum dynamics to represent input histories for prediction through a trained classical readout.<n>We construct a DTC-based reservoir architecture to predict molecular properties from structural and dynamical observations.
  arXiv  Detail & Related papers  (2026-09-10T04:27:01Z)
• Q-GAIN: A Python Package for Machine Learning and Physically Informed Analysis Applications [0.249833418215628]
  We describe the quantum gas analysis and inference (Q-GAIN) Python package.<n>Q-GAIN enables rapid deployment of machine learning (ML) and physics-informed analysis techniques for cold-atom experiments.
  arXiv  Detail & Related papers  (2026-07-02T16:45:34Z)
• QRC-Lab: An Educational Toolbox for Quantum Reservoir Computing [0.0]
  Quantum Reservoir Computing (QRC) has emerged as a strong pa- radigm for Noisy Intermediate-Scale Quantum (NISQ) machine learning.<n>This paper introduces QRC-Lab, an open-source, modular Python framework designed to bridge the gap between theoretical quantum dynamics and applied machine learning work- flows.
  arXiv  Detail & Related papers  (2026-02-03T13:38:56Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• Feedback-driven quantum reservoir computing for time-series analysis [1.1920094285063136]
  Quantum reservoir computing (QRC) is a promising computational paradigm that leverages quantum systems as a computational resource for nonlinear information processing. We propose a feedback-driven QRC framework for time-series analysis. We demonstrate that our QRC successfully acquires the fading-memory property through the feedback connections.
  arXiv  Detail & Related papers  (2024-06-22T08:28:08Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Tracing Information Flow from Open Quantum Systems [52.77024349608834]
  We use photons in a waveguide array to implement a quantum simulation of the coupling of a qubit with a low-dimensional discrete environment. Using the trace distance between quantum states as a measure of information, we analyze different types of information transfer.
  arXiv  Detail & Related papers  (2021-03-22T16:38:31Z)
• Information Processing Capacity of Spin-Based Quantum Reservoir Computing Systems [0.0]
  Quantum reservoir computing (QRC) with Ising spin networks was introduced as a quantum version of classical reservoir computing. We characterize the performance of the spin-based QRC model with the Information Processing Capacity (IPC) This work establishes a clear picture of the computational capabilities of a quantum network of spins for reservoir computing.
  arXiv  Detail & Related papers  (2020-10-13T13:26:34Z)
• Characterizing the loss landscape of variational quantum circuits [77.34726150561087]
  We introduce a way to compute the Hessian of the loss function of VQCs. We show how this information can be interpreted and compared to classical neural networks.
  arXiv  Detail & Related papers  (2020-08-06T17:48:12Z)
• Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observations [143.3053365553897]
  We describe a procedure for removing dependency on a cohort of training data from a trained deep network. We introduce a new bound on how much information can be extracted per query about the forgotten cohort. We exploit the connections between the activation and weight dynamics of a DNN inspired by Neural Tangent Kernels to compute the information in the activations.
  arXiv  Detail & Related papers  (2020-03-05T23:17:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.