{
  "annotation_id": "5f17fe3d-bd59-4445-a5e3-88351017de86",
  "date_created": "2026-03-02T18:01:48.941000Z",
  "date_modified": "2026-03-02T18:01:48.941000Z",
  "file_hash": "62e4a956e95e837bf1d0670145bd10e6cf61b745bb33d845da3aa8ccc1c620bd",
  "private": false,
  "record": {
    "abstract": "We present the results of a detailed analysis of a general, unstructured\nadiabatic quantum search of a data base of $N$ items. In particular we examine\nthe effects on the computation time of adding energy to the system. We find\nthat by increasing the lowest eigenvalue of the time dependent Hamiltonian {\\it\ntemporarily} to a maximum of $\\propto \\sqrt{N}$, it is possible to do the\ncalculation in constant time. This leads us to derive the general theorem which\nprovides the adiabatic analogue of the $\\sqrt{N}$ bound of conventional quantum\nsearches. The result suggests that the action associated with the oracle term\nin the time dependent Hamiltonian is a direct measure of the resources required\nby the adiabatic quantum search.",
    "arxiv_id": "quant-ph/0204044",
    "authors": [
      "Saurya Das",
      "Randy Kobes",
      "Gabor Kunstatter"
    ],
    "categories": [
      "quant-ph",
      "hep-th"
    ],
    "doi": "10.1088/0305-4470/36/11/313",
    "journal_ref": "J. Phys. A: Math. Gen. 36 (2003) 1-7",
    "title": "Energy and Efficiency of Adiabatic Quantum Search Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0204044"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0f3b5f37-9b11-47d2-ac8b-2941d4bf4a89",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}