Expressive Limits of Quantum Reservoir Computing

• URL: http://arxiv.org/abs/2501.15528v1
• Date: Sun, 26 Jan 2025 13:43:03 GMT
• Title: Expressive Limits of Quantum Reservoir Computing
• Authors: Nils-Erik Schütte, Niclas Götting, Hauke Müntinga, Meike List, Christopher Gies,
• Abstract summary: We show that the expressive power of a quantum reservoir computer is limited by the way the input is injected. We find that, contrary to the intuitive expectation, increasing the complexity of the reservoir does not necessarily increase its expressivity.
• Score: 0.0
• License:
• Abstract: Using physical systems as the resource for computation in reservoir computing has two prominent reasons: the high dimensional state space and its intrinsic non-linear dynamics. Quantum systems specifically promise even further improvements to their classical pendants, offering an exponentially scaling state space with respect to the system size. How this scaling reflects in the actual performance of the quantum mechanical reservoir computer remains, however, unclear. Using methods from the field of parameterized quantum cirucits, we show that the expressive power of a quantum reservoir computer is limited by the way the input is injected. In particular, injecting the input via single qubit rotations, we give an upper bound for the maximum number of orthogonal functions the system can express. We find that, contrary to the intuitive expectation, increasing the complexity of the reservoir does not necessarily increase its expressivity.

Related papers

• Benchmarking the role of particle statistics in Quantum Reservoir Computing [0.0]
  We study the ability of bosons, fermions, and qubits to store information from past inputs by measuring linear and nonlinear memory capacity. For the simplest reservoir Hamiltonian choice, fermions provide the best reservoir due to their intrinsic nonlocal properties. A tailored input injection strategy allows the exploitation of the abundance of degrees of freedom of the Hilbert space for bosonic quantum reservoir computing.
  arXiv  Detail & Related papers  (2023-02-14T16:23:46Z)
• 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)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Simulating Open Quantum System Dynamics on NISQ Computers with Generalized Quantum Master Equations [0.0]
  We present a quantum algorithm based on the Generalized Quantum Master Equation (GQME) approach to simulate open quantum system dynamics. We show how the Sz.-Nagy dilation theorem can be employed to transform the non-unitary propagator into a unitary one in a higher-dimensional Hilbert space.
  arXiv  Detail & Related papers  (2022-09-11T22:53:16Z)
• 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)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Neuromorphic computing with a single qudit [0.0]
  Reservoir computing is an alternative to high-fidelity control of many-body quantum systems. Here, we consider a reservoir comprised of a single qudit ($d$-dimensional quantum system) We demonstrate a robust performance advantage compared to an analogous classical system.
  arXiv  Detail & Related papers  (2021-01-27T22:35:22Z)
• 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)
• Gaussian states of continuous-variable quantum systems provide universal and versatile reservoir computing [0.0]
  We consider reservoir computing, an efficient framework for online time series processing. We find that encoding the input time series into Gaussian states is both a source and a means to tune the nonlinearity of the overall input-output map.
  arXiv  Detail & Related papers  (2020-06-08T18:00:03Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.