pith. sign in

arxiv: 2006.11775 · v1 · pith:EJ5GG6VTnew · submitted 2020-06-21 · 🪐 quant-ph

On Sampling and Inference using Quantum Algorithms

classification 🪐 quant-ph
keywords quantumsamplinginferencealgorithmalgorithmsannealingapartapproximate
0
0 comments X
read the original abstract

Quantum computers are projected to handle the Gibbs sampling and the related inference on Markov networks effectively. Apart from noting the background information useful for those starting the explorations in this important thread of Quantum Machine Learning, we capture some results and observations obtained through extensive simulations with two popular paradigms of sampling based on Quantum Annealing and Quantum Approximate Optimization Algorithm.

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.