dorsal/arxiv
View SchemaQuantum Computer as a Probabilistic Inference Engine
| Authors | Robert R. Tucci |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0004028 |
| URL | https://arxiv.org/abs/quant-ph/0004028 |
Abstract
We propose a new class of quantum computing algorithms which generalize many standard ones. The goal of our algorithms is to estimate probability distributions. Such estimates are useful in, for example, applications of Decision Theory and Artificial Intelligence, where inferences are made based on uncertain knowledge. The class of algorithms that we propose is based on a construction method that generalizes a Fredkin-Toffoli (F-T) construction method used in the field of classical reversible computing. F-T showed how, given any binary deterministic circuit, one can construct another binary deterministic circuit which does the same calculations in a reversible manner. We show how, given any classical stochastic network (classical Bayesian net), one can construct a quantum network (quantum Bayesian net). By running this quantum Bayesian net on a quantum computer, one can calculate any conditional probability that one would be interested in calculating for the original classical Bayesian net. Thus, we generalize the F-T construction method so that it can be applied to any classical stochastic circuit, not just binary deterministic ones. We also show that, in certain situations, our class of algorithms can be combined with Grover's algorithm to great advantage.
{
"annotation_id": "19c7cdfd-8ccc-4306-a764-e9ebf119e14c",
"date_created": "2026-03-02T18:01:38.867000Z",
"date_modified": "2026-03-02T18:01:38.867000Z",
"file_hash": "25e538167835370a360fdb0540523805b05acd147354a486791eb7012fbc91f4",
"private": false,
"record": {
"abstract": "We propose a new class of quantum computing algorithms which generalize many\nstandard ones. The goal of our algorithms is to estimate probability\ndistributions. Such estimates are useful in, for example, applications of\nDecision Theory and Artificial Intelligence, where inferences are made based on\nuncertain knowledge. The class of algorithms that we propose is based on a\nconstruction method that generalizes a Fredkin-Toffoli (F-T) construction\nmethod used in the field of classical reversible computing. F-T showed how,\ngiven any binary deterministic circuit, one can construct another binary\ndeterministic circuit which does the same calculations in a reversible manner.\nWe show how, given any classical stochastic network (classical Bayesian net),\none can construct a quantum network (quantum Bayesian net). By running this\nquantum Bayesian net on a quantum computer, one can calculate any conditional\nprobability that one would be interested in calculating for the original\nclassical Bayesian net. Thus, we generalize the F-T construction method so that\nit can be applied to any classical stochastic circuit, not just binary\ndeterministic ones. We also show that, in certain situations, our class of\nalgorithms can be combined with Grover\u0027s algorithm to great advantage.",
"arxiv_id": "quant-ph/0004028",
"authors": [
"Robert R. Tucci"
],
"categories": [
"quant-ph"
],
"title": "Quantum Computer as a Probabilistic Inference Engine",
"url": "https://arxiv.org/abs/quant-ph/0004028"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8d27f61e-bbbf-415c-be13-78ad3a8fba74",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}