{
  "annotation_id": "d577e3f6-f13d-41b0-8dec-30eccea87c79",
  "date_created": "2026-03-02T18:01:49.080000Z",
  "date_modified": "2026-03-02T18:01:49.080000Z",
  "file_hash": "0d0ff2143d0483745703ceb02d01ce5d97e7ed9b83b98c13c53b6056a9c1e501",
  "private": false,
  "record": {
    "abstract": "Quantum search is a quantum mechanical technique for searching N\npossibilities in only sqrt(N) steps. This has been proved to be the best\npossible algorithm for the exhuastive search problem in the sense the number of\nqueries it requires cannot be reduced. However, as this paper shows, the number\nof non-query operations, and thus the total number of operations, can be\nreduced. The number of non-query unitary operations can be reduced by a factor\nof log N/alpha*log(log N) while increasing the number of queries by a factor of\nonly (1+(log N)^{-alpha}). Various choices of alpha yield different variants of\nthe algorithm. For example, by choosing alpha to be O(log N/log(log N)), the\nnumber of non-query unitary operations can be reduced by 40% while increasing\nthe number of queries by just two.",
    "arxiv_id": "quant-ph/0201152",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.66.052314",
    "title": "Tradeoffs in the Quantum Search Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0201152"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1b5daeeb-10d3-4179-9b46-941dcc00ae71",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}