pith. machine review for the scientific record. sign in

arxiv: 1905.09902 · v1 · submitted 2019-05-23 · 🪐 quant-ph · cs.LG

Recognition: unknown

Generative training of quantum Boltzmann machines with hidden units

Authors on Pith no claims yet
classification 🪐 quant-ph cs.LG
keywords quantumboltzmannmethodsentropyhiddenmachinesrelativeunits
0
0 comments X
read the original abstract

In this article we provide a method for fully quantum generative training of quantum Boltzmann machines with both visible and hidden units while using quantum relative entropy as an objective. This is significant because prior methods were not able to do so due to mathematical challenges posed by the gradient evaluation. We present two novel methods for solving this problem. The first proposal addresses it, for a class of restricted quantum Boltzmann machines with mutually commuting Hamiltonians on the hidden units, by using a variational upper bound on the quantum relative entropy. The second one uses high-order divided difference methods and linear-combinations of unitaries to approximate the exact gradient of the relative entropy for a generic quantum Boltzmann machine. Both methods are efficient under the assumption that Gibbs state preparation is efficient and that the Hamiltonian are given by a sparse row-computable matrix.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Breaking QAOA's Fixed Target Hamiltonian Barrier: A Fully Connected Quantum Boltzmann Machine via Bilevel Optimization

    quant-ph 2026-05 unverdicted novelty 7.0

    A bilevel optimization method turns QAOA into a fully connected QBM that achieves 0.9559 target state probability noiseless and retains top probability under realistic noise levels.

  2. Non-unitary extension of Grover's search algorithm

    quant-ph 2026-04 unverdicted novelty 5.0

    A non-unitary extension of Grover's algorithm achieves O(sqrt(N)) query complexity matching the optimal bound by using a single large rotation via block encoding and Chebyshev approximation, at the cost of one additio...