{
  "annotation_id": "ebe77037-32af-4d52-98b3-6e0f1116b2aa",
  "date_created": "2026-03-02T18:02:41.154000Z",
  "date_modified": "2026-03-02T18:02:41.154000Z",
  "file_hash": "af23fe5531989596235683c91bf08dd166669727dd1ff00623fdeb5bd2cced7c",
  "private": false,
  "record": {
    "abstract": "This paper shows that a quantum mechanical algorithm that can query\ninformation relating to multiple items of the database, can search a database\nin a single query (a query is defined as any question to the database to which\nthe database has to return a (YES/NO) answer). A classical algorithm will be\nlimited to the information theoretic bound of at least O(log N) queries (which\nit would achieve by using a binary search).",
    "arxiv_id": "quant-ph/9706005",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.79.4709",
    "title": "Quantum computers can search arbitrarily large databases by a single   query",
    "url": "https://arxiv.org/abs/quant-ph/9706005"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7d3d56da-a0ac-472f-a716-a0ef1af76a28",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}