Gaussian states of continuous-variable quantum systems provide universal and versatile reservoir computing

• URL: http://arxiv.org/abs/2006.04821v3
• Date: Wed, 31 Mar 2021 17:37:16 GMT
• Title: Gaussian states of continuous-variable quantum systems provide universal and versatile reservoir computing
• Authors: Johannes Nokkala, Rodrigo Mart\'inez-Pe\~na, Gian Luca Giorgi, Valentina Parigi, Miguel C. Soriano and Roberta Zambrini
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We establish the potential of continuous-variable Gaussian states of linear dynamical systems for machine learning tasks. Specifically, we consider reservoir computing, an efficient framework for online time series processing. As a reservoir we consider a quantum harmonic network modeling e.g. linear quantum optical systems. We prove that unlike universal quantum computing, universal reservoir computing can be achieved without non-Gaussian resources. 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. We further show that the full potential of the proposed model can be reached by encoding to quantum fluctuations, such as squeezed vacuum, instead of classical intense fields or thermal fluctuations. Our results introduce a new research paradigm for reservoir computing harnessing the dynamics of a quantum system and the engineering of Gaussian quantum states, pushing both fields into a new direction.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• Scalable and programmable quantum computing platform for optical non-Gaussian input states [0.0]
  We develop a programmable optical quantum computing platform for non-Gaussian input states. We verify the deterministic, programmable, and repeatable quantum gates on a typical non-Gaussian state. This platform is compatible with other non-Gaussian states and realizes large-scale universal quantum computing.
  arXiv  Detail & Related papers  (2024-03-18T01:27:01Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Simulating non-unitary dynamics using quantum signal processing with unitary block encoding [0.0]
  We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
  arXiv  Detail & Related papers  (2023-03-10T19:00:33Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [59.07246314484875]
  TeD-Q is an open-source software framework for quantum machine learning. It seamlessly integrates classical machine learning libraries with quantum simulators. It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• 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)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Generalized Quantum Assisted Simulator [0.0]
  We introduce the notion of the hybrid density matrix, which allows us to disentangle the different steps of our algorithm. Our algorithm has potential applications in solving the Navier-Stokes equation, plasma hydrodynamics, quantum Boltzmann training, quantum signal processing and linear systems.
  arXiv  Detail & Related papers  (2020-11-30T12:40:17Z)
• Towards quantum simulation of spin systems using continuous variable quantum devices [0.0]
  We decompose the time evolution of spin systems into a sequence of continuous variable logical gates and analyze their structure. We provide an estimation of quantum circuit scaling with the size of the spin lattice system.
  arXiv  Detail & Related papers  (2020-09-20T15:22:44Z)
• 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.