{
  "annotation_id": "a0fb5b32-faba-4ba3-b1cb-7ec5983dc2e4",
  "date_created": "2026-03-02T18:02:17.134000Z",
  "date_modified": "2026-03-02T18:02:17.134000Z",
  "file_hash": "8b843ee02709ca3a4c86cf24ed2dc436e179c5dfeeb0a17c9b53ec3b337cfab3",
  "private": false,
  "record": {
    "abstract": "Grover\u0027s search algorithm searches a database of $N$ unsorted items in\n$O(\\sqrt{N/M})$ steps where $M$ represents the number of solutions to the\nsearch problem. This paper proposes a scheme for searching a database of $N$\nunsorted items in $O(logN)$ steps, provided the value of $M$ is known. It is\nalso shown that when $M$ is unknown but if we can estimate an upper bound of\npossible values of $M$, then an improvement in the time complexity of\nconventional Grover\u0027s algorithm is possible. In that case, the present scheme\nreduces the time complexity to $O(MlogN)$.",
    "arxiv_id": "quant-ph/0506105",
    "authors": [
      "A. S. Gupta",
      "M. Gupta",
      "A. Pathak"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Modified Grover\u0027s search algorithm for the cases where the number of   solutions is known",
    "url": "https://arxiv.org/abs/quant-ph/0506105"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "95452b37-0406-46fe-a0a7-c0e57e8ba737",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}