Probabilistic Modeling with Matrix Product States

02/19/2019
by   James Stokes, et al.
0

Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The gradient-free algorithm, presented as a sequence of exactly solvable effective models, is a modification of the density matrix renormalization group procedure adapted for learning a probability distribution. The conclusion that circuit-based models offer a useful inductive bias for classical datasets is supported by experimental results on the parity learning problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2018

Differentiable Learning of Quantum Circuit Born Machine

Quantum circuit Born machines are generative models which represent the ...
research
09/06/2017

Unsupervised Generative Modeling Using Matrix Product States

Generative modeling, which learns joint probability distribution from tr...
research
05/28/2022

Introducing Non-Linearity into Quantum Generative Models

The evolution of an isolated quantum system is linear, and hence quantum...
research
01/20/2021

Enhancing Generative Models via Quantum Correlations

Generative modeling using samples drawn from the probability distributio...
research
10/11/2021

Learnability of the output distributions of local quantum circuits

There is currently a large interest in understanding the potential advan...
research
03/29/2021

Dual-Parameterized Quantum Circuit GAN Model in High Energy Physics

Generative models, and Generative Adversarial Networks (GAN) in particul...
research
10/16/2019

Modeling Sequences with Quantum States: A Look Under the Hood

Classical probability distributions on sets of sequences can be modeled ...

Please sign up or login with your details

Forgot password? Click here to reset