{
  "annotation_id": "934bc58d-5489-4a4f-abc3-8091d39ad8d6",
  "date_created": "2026-03-02T18:02:47.937000Z",
  "date_modified": "2026-03-02T18:02:47.937000Z",
  "file_hash": "729d049a756a68b90e353ec20c827da438fbbbf9969f2e021c9d2e651d3db596",
  "private": false,
  "record": {
    "abstract": "It is found that Grover\u0027s quantum search algorithm is not robust against\nphase inversion and Hadmard transformation inaccuracies. Imperfect phase\ninversions and Hadmard-Walsh transformations in Grover\u0027s quantum search\nalgorithm lead to reductions in the maximum probability of the marked state and\naffect the efficiency of the algorithm. even in the absence of decoherence.\nGiven the degrees of inaccuracies, we find that to guarantee half rate of\nsuccess, the size of the database should be in the order of $O({1 \\over\n\\delta^2})$, where $\\delta$ is the uncertainty.",
    "arxiv_id": "quant-ph/9910076",
    "authors": [
      "Gui Lu Long",
      "Yan Song Li",
      "Wei Lin Zhang",
      "Chang Cun Tu"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "An intrinsic limitation on the size of quantum database",
    "url": "https://arxiv.org/abs/quant-ph/9910076"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "37867f5d-5b58-4607-b79a-93b350bd56b9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}