From quantum reservoirs to quantum extreme learning machines through a nearest-neighbor spin chain with tunable quantum memory

• URL: http://arxiv.org/abs/2608.28440v1
• Date: Fri, 28 Aug 2026 15:27:38 GMT
• Title: From quantum reservoirs to quantum extreme learning machines through a nearest-neighbor spin chain with tunable quantum memory
• Abstract summary: We show that the two limits of a single architecture, connected by the input-encoding length, are the number of qubits overwritten with fresh data at each step.<n>We find that recurrent quantum memory is essential when a task must reach far into the past, and dispensable when the relevant history is short.<n>For every task the best reservoirs operate at the edge of chaos, where they perform as well as a densely connected reservoir with random all-to-all couplings of the same size.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Reservoir Computing (QRC) processes temporal data by retaining a memory of past inputs in the recurrent state of a quantum system, whereas a Quantum Extreme-Learning Machine (QELM) discards that memory, resetting the system at every step so that only the most recent input shapes the response. The two are usually treated as separate computational paradigms. We show that they are the two limits of a single architecture, connected by the input-encoding length, that is, the number of qubits overwritten with fresh data at each step. When a single qubit is re-encoded the system operates as a standard QRC, when the whole register is re-encoded it operates as a QELM, and intermediate lengths interpolate between them. The overwritten qubits hold the recent past in an explicit register, while the remaining qubits are never reset and carry older inputs forward in their evolving quantum state, so the encoding length redistributes memory between explicit and recurrent storage at fixed system size. Tuning the reservoir Hamiltonian and the evolution time with Bayesian optimization at each encoding length, we find that recurrent quantum memory is essential when a task must reach far into the past, and dispensable when the relevant history is short, where the memoryless reset limit already suffices. For every task the best reservoirs operate at the edge of chaos, where they perform as well as a densely connected reservoir with random all-to-all couplings of the same size, indicating that what temporal processing requires is the dynamical regime rather than the connectivity.

Related papers

• MARCH: Scaling Recurrent Memory with Content-Routed State Anchors [41.39470291507015]
  Transformers owe much of their strong long-context retrieval capability to a token-level memory that grows with context length.<n>Recurrent alternatives offer efficient decoding by compressing the entire history into a fixed-size state.<n>We introduce Memory-Anchor Routing across Context History (MARCH), a network architecture that effectively scales state-space models beyond a fixed-size dimension.
  arXiv  Detail & Related papers  (2026-08-12T13:45:01Z)
• Quantum Reservoir Computing: Recent Advances and Future Directions [34.77938621771246]
  Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features.<n>Its computational power is often attributed to the exponentially large Hilbert space of the quantum system.<n>On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables.
  arXiv  Detail & Related papers  (2026-07-20T22:38:49Z)
• Quantum Dynamic Time Warping for Multivariate Time Series Classification [41.99844472131922]
  We propose a hybrid Quantum Dynamic Time Warping architecture, replacing the classical distance metric with the parameterized geometry of a quantum Hilbert space.<n>We demonstrate this architecture allows untrained quantum kernels to act as highly expressive baselines, while parameterized training effectively untangles deeply overlapping hyper-dimensional data.
  arXiv  Detail & Related papers  (2026-06-26T07:58:37Z)
• QLAM: A Quantum Long-Attention Memory Approach to Long-Sequence Token Modeling [14.229084182282607]
  We introduce one of the first studies to leverage the superposition property of quantum systems to enhance state-based sequence modeling.<n>QLAM represents the hidden state as a quantum state whose amplitudes encode a superposition of historical information.<n>We evaluate QLAM on sequential variants of standard image classification benchmarks, including sMNIST, sFashion-MNIST, and sCIFAR-10.
  arXiv  Detail & Related papers  (2026-05-13T17:56:20Z)
• Variational Quantum Dimension Reduction for Recurrent Quantum Models [3.112711246449628]
  Recurrent quantum models (RQMs) realize sequential quantum processes through repeated application of a unitary operation on a memory system.<n>Here, we introduce a textitvariational quantum dimension reduction framework that identifies and removes irrelevant memory degrees of freedom.<n>Our framework achieves up to three orders of magnitude smaller QFDR compared to variational matrix product state truncation.
  arXiv  Detail & Related papers  (2026-03-10T12:12:16Z)
• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• It's-A-Me, Quantum Mario: Scalable Quantum Reinforcement Learning with Multi-Chip Ensembles [29.944281778572876]
  Quantum reinforcement learning (QRL) promises compact function approximators with access to vast Hilbert spaces.<n>We introduce a multi-chip ensemble framework using multiple small Quantum Convolutional Neural Networks (QCNNs) to overcome constraints.<n>Our approach partitions complex, high-dimensional observations from the Super Mario Bros environment across independent quantum circuits.
  arXiv  Detail & Related papers  (2025-08-31T06:15:55Z)
• Quantum reservoir computing induced by controllable damping [0.9374652839580183]
  We propose an algorithm for inducing damping by applying a controlled rotation to each qubit in a quantum reservoir.<n>It enables tunable, circuit-level amplitude amplification of the zero state.<n>We show that quantum correlations between qubits provide an improvement in terms of memory retention.
  arXiv  Detail & Related papers  (2025-08-20T11:18:57Z)
• Guess, SWAP, Repeat : Capturing Quantum Snapshots in Classical Memory [2.089191490381739]
  We introduce a novel technique that enables observation of quantum states without direct measurement, preserving them for reuse.<n>Our method allows multiple quantum states to be observed at different points within a single circuit, one at a time, and saved into classical memory without destruction.<n>We propose a hardware-agnostic, machine learning-driven framework to capture non-destructive estimates, or "snapshots," of quantum states at arbitrary points within a circuit.
  arXiv  Detail & Related papers  (2025-04-20T02:39:30Z)
• Memory-Augmented Hybrid Quantum Reservoir Computing [0.0]
  We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array.
  arXiv  Detail & Related papers  (2024-09-15T22:44:09Z)
• Optimization of the Memory Reset Rate of a Quantum Echo-State Network for Time Sequential Tasks [0.0]
  Quantum reservoir computing is a class of quantum machine learning algorithms involving a reservoir of an echo state network based on a register of qubits. We investigate the relation between the memory of the network and the reset rate of the evolution of the quantum reservoir.
  arXiv  Detail & Related papers  (2022-10-03T16:08:06Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.