{
  "annotation_id": "24f3cb26-ee5e-47b9-86ec-7a1e496874c0",
  "date_created": "2026-03-02T18:02:12.973000Z",
  "date_modified": "2026-03-02T18:02:12.973000Z",
  "file_hash": "c47d099e09cd44005e1aaa1fc60ad0e17cde50c2232a68b36b404b988ebe414e",
  "private": false,
  "record": {
    "abstract": "Hypothesis elimination is a special case of Bayesian updating, where each\npiece of new data rules out a set of prior hypotheses. We describe how to use\nGrover\u0027s algorithm to perform hypothesis elimination for a class of probability\ndistributions encoded on a register of qubits, and establish a lower bound on\nthe required computational resources.",
    "arxiv_id": "quant-ph/0412025",
    "authors": [
      "Andrei N. Soklakov",
      "Ruediger Schack"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1063/1.1834403",
    "title": "Hypothesis elimination on a quantum computer",
    "url": "https://arxiv.org/abs/quant-ph/0412025"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7d5c938e-e10c-43b8-a6d6-c787c1a6450b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}