A hidden bottleneck in classical and quantum linear reservoir computing

• URL: http://arxiv.org/abs/2605.29071v1
• Date: Wed, 27 May 2026 20:25:26 GMT
• Title: A hidden bottleneck in classical and quantum linear reservoir computing
• Abstract summary: We identify a hidden bottleneck in the information processing capacity of linear reservoir computers.<n>We show that the capacity available at any fixed delay is limited by what is already present in the preprocessed input.
• Score: 0.5161531917413708
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We identify a hidden bottleneck in the information processing capacity of linear reservoir computers. When the measured features evolve linearly in the reservoir and the output is formed by linear readout with bias, we show that the capacity available at any fixed delay is limited by what is already present in the preprocessed input. Linear reservoir dynamics can therefore redistribute features, but cannot create new fixed-delay expressive power on their own. This limitation is hidden by global capacity measures, since contributions from different delays can accumulate even when each individual delay is strongly constrained. As an experimentally important realization of this general result, we derive the corresponding Gaussian limit for covariance-based continuous-variable quantum reservoirs. Numerical experiments show that experimentally accessible single-photon operations surpass this limit, establishing them as a genuine resource for quantum reservoir computing. The resulting excess capacity also provides an operational witness of non-Gaussian processing in black-box continuous-variable systems under minimal assumptions.

Related papers

• Fisher-Orthogonal Memory in Quantum Reservoir Computing [4.441368215483203]
  We introduce a delay-space quantum Fisher information matrix to quantify the distinguishability of memory traces.<n>This perspective identifies Fisher-orthogonal memory as a measurement-efficient design principle.<n>We construct solvable multi-qubit reservoirs based on Clifford routing orbits and Singer-cycle Pauli algebra.
  arXiv  Detail & Related papers  (2026-07-31T09:44:18Z)
• Frequency-Based Reservoir computing [0.0]
  Reservoir computing is an efficient machine learning framework for predicting time generated by dynamical systems.<n>Here, we propose a frequency-based reservoir inspired by the brain's oscillatory dynamics and its hierarchy of timescales.<n>We find that units of the frequency-based reservoir amplify and store specific input frequencies, which are then used for prediction.
  arXiv  Detail & Related papers  (2026-07-27T13:33:13Z)
• Temporal processing of quantum states with hybrid quantum-classical reservoirs [0.5161531917413708]
  A quantum-classical hybrid architecture combines a qubit quantum reservoir with a classical echo state network (ESN)<n>We show that the hybrid system outperforms its standalone components in both linear and nonlinear tasks.<n>These results establish hybrid quantum-classical reservoir computing as a practical and scalable route for enhanced quantum machine learning on near-term qubit hardware.
  arXiv  Detail & Related papers  (2026-06-19T11:14:13Z)
• Capacity-Constrained Continual Learning [64.70016365121081]
  This paper studies how agents with limited capacity should allocate their resources for optimal performance.<n>We derive a solution to the capacity-constrained linear-quadratic-Gaussian sequential prediction problem.<n>For problems that can be decomposed into a set of sub-problems, we also demonstrate how to optimally allocate capacity across these sub-problems in the steady state.
  arXiv  Detail & Related papers  (2025-07-29T03:47:22Z)
• Exceeding the Parametric Drive Strength Threshold in Nonlinear Circuits [33.16766650698962]
  Superconducting quantum circuits rely on strong drives to implement fast gates, high-fidelity readout, and state stabilization.<n>We show that a nonlinear coupler undergoes ionization under strong parametric driving, leading to a breakdown of coherent control.<n>This insight establishes fundamental constraints on parametric control and offers design principles for mitigating drive-induced decoherence in next-generation quantum processors.
  arXiv  Detail & Related papers  (2025-06-03T23:39:10Z)
• 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)
• Weak coupling limit for quantum systems with unbounded weakly commuting system operators [50.24983453990065]
  This work is devoted to a rigorous analysis of the weak coupling limit (WCL) for the reduced dynamics of an open infinite-dimensional quantum system interacting with electromagnetic field or a reservoir formed by Fermi or Bose particles.<n>We derive in the weak coupling limit the reservoir statistics, which is determined by whose terms in the multi-point correlation functions of the reservoir are non-zero in the WCL.<n>We prove that the resulting reduced system dynamics converges to unitary dynamics with a modified Hamiltonian which can be interpreted as a Lamb shift to the original Hamiltonian.
  arXiv  Detail & Related papers  (2025-05-13T05:32:34Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Expressivity Limits of Quantum Reservoir Computing [0.0]
  We establish a formal connection to parametrized quantum circuit quantum machine learning (PQC-QML)<n>We analytically prove, and numerically corroborate, that in QRC the number of non-linear functions that can be generated from classical data is bounded linearly by the number of input encoding gates.<n>Our results challenge the common assumption that exponential Hilbert space scaling confers a corresponding computational advantage in QRC.
  arXiv  Detail & Related papers  (2025-01-26T13:43:03Z)
• Solving the time-complexity problem and tuning the performance of quantum reservoir computing by artificial memory restriction [0.0]
  The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model.
  arXiv  Detail & Related papers  (2023-06-22T13:37:34Z)
• Dissipation as a resource for Quantum Reservoir Computing [3.4078654008228924]
  We show the potential enhancement induced by dissipation in the field of quantum reservoir computing. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing.
  arXiv  Detail & Related papers  (2022-12-22T23:30:07Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Physical reservoir computing using finitely-sampled quantum systems [0.0]
  Reservoir computing exploits the nonlinear dynamics of a physical reservoir to perform complex time-series processing tasks. Here we describe a framework for reservoir computing with nonlinear quantum reservoirs under continuous measurement.
  arXiv  Detail & Related papers  (2021-10-26T16:46:14Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)

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.