{
  "annotation_id": "7b846544-72cb-4019-82ba-0fad899378cc",
  "date_created": "2026-03-02T18:02:03.470000Z",
  "date_modified": "2026-03-02T18:02:03.470000Z",
  "file_hash": "44f86f50a29f7832bce93b0fbfbff82e54fff071b1af1460d00830c8f84efca5",
  "private": false,
  "record": {
    "abstract": "We report on a detailed analysis of generalization of the local adiabatic\nsearch algorithm. Instead of evolving directly from an initial ground state\nHamiltonian to a solution Hamiltonian a different evolution path is introduced\nand is shown that the time required to find an item in a database of size $N$\ncan be made to be independent of the size of the database by modifying the\nHamiltonian used to evolve the system.",
    "arxiv_id": "quant-ph/0309201",
    "authors": [
      "Recep Eryigit",
      "Yigit Gunduc",
      "Resul Eryigit"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Local adiabatic quantum search with different paths",
    "url": "https://arxiv.org/abs/quant-ph/0309201"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7a816aa6-b30b-428a-b9db-1ed40bd496c9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}