{
  "annotation_id": "e2f78716-97df-4310-8652-496fb496369a",
  "date_created": "2026-03-02T18:02:15.900000Z",
  "date_modified": "2026-03-02T18:02:15.900000Z",
  "file_hash": "0848d014d473cd2b1985b568039ecfbb028e48f8f400054a996d2992675154e3",
  "private": false,
  "record": {
    "abstract": "The quantum search algorithm consists of an alternating sequence of selective\ninversions and diffusion type operations, as a result of which it can find a\ntarget state in an unsorted database of size N in only sqrt(N) queries. This\npaper shows that by replacing the selective inversions by selective phase\nshifts of Pi/3, the algorithm gets transformed into something similar to a\nclassical search algorithm. Just like classical search algorithms this\nalgorithm has a fixed point in state-space toward which it preferentially\nconverges. In contrast, the original quantum search algorithm moves uniformly\nin a two-dimensional state space. This feature leads to robust search\nalgorithms and also to conceptually new schemes for error correction.",
    "arxiv_id": "quant-ph/0503205",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.95.150501",
    "title": "A different kind of quantum search",
    "url": "https://arxiv.org/abs/quant-ph/0503205"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7d403536-3db5-4d1b-b013-b1342fa16fcf",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}