Use of a Quantum Computer to do Importance and Metropolis-Hastings Sampling of a Classical Bayesian Network

Simple item page
dc.creatorTucci, Robert R.
dc.date2008-11-12
dc.date.accessioned2026-07-07T10:17:39Z
dc.date.available2026-07-07T10:17:39Z
dc.descriptionImportance sampling and Metropolis-Hastings sampling (of which Gibbs sampling is a special case) are two methods commonly used to sample multi-variate probability distributions (that is, Bayesian networks). Heretofore, the sampling of Bayesian networks has been done on a conventional "classical computer". In this paper, we propose methods for doing importance sampling and Metropolis-Hastings sampling of a classical Bayesian network on a quantum computer.
dc.description41 pages (files: 1.tex, 3.sty, 8.eps)
dc.identifierhttps://arxiv.org/abs/0811.1792
dc.identifierhttp://arxiv.org/abs/0811.1792
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173923
dc.subjectQuantum Physics
dc.titleUse of a Quantum Computer to do Importance and Metropolis-Hastings Sampling of a Classical Bayesian Network
dc.typetext

Files

Collections

arXiv