Year: 2009
Type: preprint
Abstract: We present an algorithm for doing Gibbs sampling on a quantum computer. The algorithm combines phase estimation for a Szegedy operator, and Grover's algorithm. For any $ε>0$, the algorithm will sample a probability distribution in ${\cal O}(\frac{1}{\sqrtδ})$ steps with precision ${\cal O}(ε)$. Here $δ$ is the distance between the two largest eigenvalue magnitudes of the transition matrix of the Gibbs Markov chain used in the algorithm. It takes ${\cal O}(\frac{1}δ)$ steps to achieve the same precision if one does Gibbs sampling on a classical computer.
Source: arXiv (Cornell University)
Author: Tucci, Robert R.
Institution: Bedford Research Foundation
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1553685568