{
  "annotation_id": "9a5c5e57-eed6-441d-ae6e-486b083c5862",
  "date_created": "2026-03-02T18:02:20.410000Z",
  "date_modified": "2026-03-02T18:02:20.410000Z",
  "file_hash": "1e789093c35d40b725710984cee1cc95d7c05fc21259a8c62e259377abc0624b",
  "private": false,
  "record": {
    "abstract": "Quantum branching programs (quantum binary decision diagrams, respectively)\nare a convenient tool for examining quantum computations using only a\nlogarithmic amount of space. Recently several types of restricted quantum\nbranching programs have been considered, e. g. read--once quantum branching\nprograms. This paper considers quantum ordered binary decision diagrams\n(QOBDDs) and answers the question: How does the computational power of QOBDDs\nincrease, if we allow repeated tests. Additionally it is described how to\nsynthesize QOBDDs according to Boolean operations.",
    "arxiv_id": "quant-ph/0507258",
    "authors": [
      "Matthias Homeister",
      "Stephan Waack"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Ordered Binary Decision Diagrams with Repeated Tests",
    "url": "https://arxiv.org/abs/quant-ph/0507258"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0a2f77e3-c028-44a3-a9ad-a4b204233ecc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}