Input-dependence in quantum reservoir computing

• URL: http://arxiv.org/abs/2412.08322v2
• Date: Mon, 21 Apr 2025 04:00:24 GMT
• Title: Input-dependence in quantum reservoir computing
• Authors: Rodrigo Martínez-Peña, Juan-Pablo Ortega,
• Abstract summary: Quantum reservoir computing is an emergent field in which quantum dynamical systems are exploited for temporal information processing.<n>In previous work, it was found a feature that makes a quantum reservoir valuable: contractive dynamics of the quantum reservoir channel toward input-dependent fixed points.<n>This work contributes to analyzing valuable quantum reservoirs in terms of their input dependence.
• Score: 4.903263899016404
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum reservoir computing is an emergent field in which quantum dynamical systems are exploited for temporal information processing. In previous work, it was found a feature that makes a quantum reservoir valuable: contractive dynamics of the quantum reservoir channel toward input-dependent fixed points. These results are enhanced in this paper by finding conditions that guarantee a crucial aspect of the reservoir's design: distinguishing between different input sequences to ensure a faithful representation of temporal input data. This is implemented by finding a condition that guarantees injectivity in reservoir computing filters, with a special emphasis on the quantum case. We provide several examples and focus on a family of quantum reservoirs that is much used in the literature; it consists of an input-encoding quantum channel followed by a strictly contractive channel that enforces the echo state and the fading memory properties. This work contributes to analyzing valuable quantum reservoirs in terms of their input dependence.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• 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)
• Dissipation-induced Quantum Homogenization for Temporal Information Processing [44.99833362998488]
  Quantum reservoirs have great potential as they utilize the complex real-time dissipative dynamics of quantum systems for information processing and target time-series generation without precise control or fine-tuning of the Hamiltonian parameters. We propose the disordered quantum homogenizer as an alternative platform, and prove it satisfies the necessary and sufficient conditions - stability and contractivity - of the reservoir dynamics. The results indicate that the quantum homogenization protocol, physically implementable as either nuclear magnetic resonance ensemble or a photonic system, can potentially function as a reservoir computer.
  arXiv  Detail & Related papers  (2024-12-13T09:05:41Z)
• Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
  We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework. Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-10-18T10:30:14Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Quantum reservoir probing: an inverse paradigm of quantum reservoir computing for exploring quantum many-body physics [0.0]
  This study proposes a reciprocal research direction: probing quantum systems themselves through their information processing performance. Building upon this concept, here we develop quantum reservoir probing (QRP), an inverse extension of the Quantum Reservoir Computing (QRC) paradigm. Unifying quantum information and quantum matter, the QRP holds great promise as a potent tool for exploring various aspects of quantum many-body physics.
  arXiv  Detail & Related papers  (2023-08-02T01:26:36Z)
• Exploring quantum mechanical advantage for reservoir computing [0.0]
  We establish a link between quantum properties of a quantum reservoir and its linear short-term memory performance. We find that a high degree of entanglement in the reservoir is a prerequisite for a more complex reservoir dynamics. We discuss the effect of dephasing in the performance of physical quantum reservoirs.
  arXiv  Detail & Related papers  (2023-02-07T17:07:28Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Quantum Reservoir Computing for Speckle-Disorder Potentials [0.0]
  Quantum reservoir computing is a machine-learning approach designed to exploit the dynamics of quantum systems with memory to process information. In this work, this technique is introduced with a quantum reservoir of spins and it is applied to find the ground-state energy of an additional quantum system. The performance of the task is analyzed with a focus on the observable quantities extracted from the reservoir and it shows to be enhanced when two-qubit correlations are employed.
  arXiv  Detail & Related papers  (2022-01-26T18:04:49Z)
• Natural quantum reservoir computing for temporal information processing [4.785845498722406]
  Reservoir computing is a temporal information processing system that exploits artificial or physical dissipative dynamics. This paper proposes the use of real superconducting quantum computing devices as the reservoir, where the dissipative property is served by the natural noise added to the quantum bits.
  arXiv  Detail & Related papers  (2021-07-13T01:58:57Z)
• Nonlinear input transformations are ubiquitous in quantum reservoir computing [0.0]
  We study the input encoding component of contemporary quantum reservoir computing schemes. We find that across the majority of schemes the input encoding implements a nonlinear transformation on the input data. Our findings will impact the design of future quantum reservoirs.
  arXiv  Detail & Related papers  (2021-06-30T23:08:21Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Quantum Non-equilibrium Many-Body Spin-Photon Systems [91.3755431537592]
  dissertation concerns the quantum dynamics of strongly-correlated quantum systems in out-of-equilibrium states. Our main results can be summarized in three parts: Signature of Critical Dynamics, Driven Dicke Model as a Test-bed of Ultra-Strong Coupling, and Beyond the Kibble-Zurek Mechanism.
  arXiv  Detail & Related papers  (2020-07-23T19:05:56Z)

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.