{
  "annotation_id": "67f8e250-3e8d-401a-b490-ab4741f38a9c",
  "date_created": "2026-03-02T18:02:41.641000Z",
  "date_modified": "2026-03-02T18:02:41.641000Z",
  "file_hash": "6ca2802fdcfc4b2708d29f97a841b93d8a5f9b9b3b3615f44bec17e35e194dbf",
  "private": false,
  "record": {
    "abstract": "A framework is presented for the design and analysis of quantum mechanical\nalgorithms, the sqrt(N) step quantum search algorithm is an immediate\nconsequence of this framework. It leads to several other search-type\napplications - several examples are presented. Also, it leads to quantum\nmechanical algorithms for problems not immediately connected with search - two\nsuch algorithms are presented for estimating the mean and median of statistical\ndistributions. Both algorithms require fewer steps than the fastest possible\nclassical algorithms; also both are considerably simpler and faster than\nexisting quantum mechanical algorithms for the respective problems.",
    "arxiv_id": "quant-ph/9711043",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A framework for fast quantum mechanical algorithms",
    "url": "https://arxiv.org/abs/quant-ph/9711043"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a0ac0826-0584-4f28-9f9b-eb7533692c46",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}