{
  "annotation_id": "e60851a4-e377-4487-a6ba-da88747683e2",
  "date_created": "2026-03-02T18:02:45.027000Z",
  "date_modified": "2026-03-02T18:02:45.027000Z",
  "file_hash": "01a108dc8cb4833e5dad1d3835e97a7e0a5ff1d81cd5bb0dc40a436388d57875",
  "private": false,
  "record": {
    "abstract": "We want to find a marked element out of a black box containing N elements.\nWhen the number of marked elements is known this can be done elegantly with\nGrover\u0027s algorithm, a variant of which even gives a correct result with\ncertainty. On the other hand, when the number of marked elements is not known\nthe problem becomes more difficult. For every prescribed success probability I\ngive an algorithm consisting of several runs of Grover\u0027s algorithm that matches\na recent bound by Buhrman and de Wolf on the order of the number of queries to\nthe black box. The improvement in the order over a previously known algorithm\nis small and the number of queries can clearly still be reduced by a constant\nfactor.",
    "arxiv_id": "quant-ph/9902049",
    "authors": [
      "Christof Zalka"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Grover-based quantum search of optimal order for an unknown number of   marked elements",
    "url": "https://arxiv.org/abs/quant-ph/9902049"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fccf6aff-bb91-4b41-a61b-a80b85ed5794",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}