{
  "annotation_id": "6f642fb2-3e27-4330-9d8c-ee9c6bc9fdf5",
  "date_created": "2026-03-02T18:02:41.698000Z",
  "date_modified": "2026-03-02T18:02:41.698000Z",
  "file_hash": "e339e3ee44cbf167d1972bd578579324080c412ade404217bafa8fb84d06c510",
  "private": false,
  "record": {
    "abstract": "We show how to express the information contained in a Quantum Bayesian (QB)\nnet as a product of unitary matrices. If each of these unitary matrices is\nexpressed as a sequence of elementary operations (operations such as\ncontrolled-nots and qubit rotations), then the result is a sequence of\noperations that can be used to run a quantum computer. QB nets have been run\nentirely on a classical computer, but one expects them to run faster on a\nquantum computer.",
    "arxiv_id": "quant-ph/9805016",
    "authors": [
      "Robert R. Tucci"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "How to Compile A Quantum Bayesian Net",
    "url": "https://arxiv.org/abs/quant-ph/9805016"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c98486e9-39f2-4010-8672-5b4ea100b7f4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}