Quantum reservoir computing induced by controllable damping

• URL: http://arxiv.org/abs/2508.14621v1
• Date: Wed, 20 Aug 2025 11:18:57 GMT
• Title: Quantum reservoir computing induced by controllable damping
• Authors: Emanuele Ricci, Francesco Monzani, Luca Nigro, Enrico Prati,
• Abstract summary: 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.
• Score: 0.9374652839580183
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it allows for exploiting the large computational capacity of the qubits without suffering from typical issues that occur when training a variational quantum circuit. In particular, quantum gate-based echo state networks have proven effective for learning when the evolution of the reservoir circuit is non-unital. Nonetheless, a method for ensuring a tunable and stable non-unital evolution of the circuit was still lacking. We propose an algorithm for inducing 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, in principle, process arbitrarily long input sequences, well beyond the coherence time of individual qubits, by inducing an arbitrary damping on each qubit. Moreover, we show that quantum correlations between qubits provide an improvement in terms of memory retention, underscoring the potential utility of employing a quantum system as a computational reservoir. We demonstrate, through typical benchmarks for reservoir computing, that such an algorithm enables robust and scalable quantum random computing on fault-tolerant quantum hardware.

Related papers

• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Optimal quantum learning in proximity to universality [0.0]
  boundary between classically simulable and computationally superior quantum systems is fundamental to identifying true quantum advantage.<n>We introduce a tunable $N$-qubit random circuit model, where a fraction $p$ of Clifford gates are probabilistically substituted with nonstabilizing conditional-$hatT$ gates.<n>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.
  arXiv  Detail & Related papers  (2025-10-21T13:27:41Z)
• Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning [8.505960463791139]
  We introduce a mechanism termed the weakly-driven quantum walk'' to mitigate the demand for high-quality quantum memory.<n>Our algorithm lowers the quantum memory overhead to a constant order while preserving the exponential advantage in measurement complexity.
  arXiv  Detail & Related papers  (2025-09-09T13:09:48Z)
• Towards Efficient Verification of Computation in Quantum Devices [12.146871607856037]
  Traditional methods of comprehensively verifying quantum devices, such as quantum process tomography, face significant limitations because of the exponential growth in computational resources.<n>In this paper, we investigate the structure of computations on the hardware, focusing on the layered interruptible quantum circuit model.<n>Our method completely reconstructs the circuits within a time complexity of $O(d2 t log (n/delta))$, guaranteeing success with a probability of at least $1-delta$.<n>Our approach significantly reduces execution time for completely verifying computations in quantum devices, achieving double logarithmic scaling in the problem size.
  arXiv  Detail & Related papers  (2025-08-01T02:10:06Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Optimizing quantum noise-induced reservoir computing for nonlinear and chaotic time series prediction [2.5427629797261297]
  We make advancements to the quantum noise-induced reservoir, in which reservoir noise is used as a resource to generate expressive, nonlinear signals. We show that with only a single noise model and small memory capacities, excellent simulation results were obtained on nonlinear benchmarks.
  arXiv  Detail & Related papers  (2023-03-09T18:40:03Z)
• Error Mitigation in Quantum Computers through Instruction Scheduling [7.0230815242347475]
  Current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. This paper presents TimeStitch, a framework that pinpoints the optimum execution schedules for single-qubit gates within quantum circuits.
  arXiv  Detail & Related papers  (2021-05-04T20:58:58Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Temporal Information Processing on Noisy Quantum Computers [3.4180402210147243]
  We propose quantum reservoir computing that harnesses complex dissipative quantum dynamics. Proof-of-principle experiments on remotely accessed cloud-based superconducting quantum computers demonstrate that small and noisy quantum reservoirs can tackle high-order nonlinear temporal tasks. Our results pave the path for attractive temporal processing applications of near-term gate-model quantum computers of increasing fidelity but without quantum error correction.
  arXiv  Detail & Related papers  (2020-01-26T19:00:03Z)

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.