{
  "annotation_id": "e174567a-54c5-4fa6-9f4b-52e978534a97",
  "date_created": "2026-03-02T18:02:27.444000Z",
  "date_modified": "2026-03-02T18:02:27.444000Z",
  "file_hash": "b645370500b38987d7e7e40f89e7314176b683a562fbbe105fa73014396b8060",
  "private": false,
  "record": {
    "abstract": "Quantum adiabatic computation is a novel paradigm for the design of quantum\nalgorithms, which is usually used to find the minimum of a classical function.\nIn this paper, we show that if the initial hamiltonian of a quantum adiabatic\nevolution with a interpolation path is too simple, the minimal gap between the\nground state and the first excited state of this quantum adiabatic evolution is\nan inverse exponential distance. Thus quantum adiabatic evolutions of this kind\ncan\u0027t be used to design efficient quantum algorithms. Similarly, we show that a\nquantum adiabatic evolution with a simple final hamiltonian also has a long\nrunning time, which suggests that some functions can\u0027t be minimized efficiently\nby any quantum adiabatic evolution with a interpolation path.",
    "arxiv_id": "quant-ph/0604077",
    "authors": [
      "Zhaohui Wei",
      "Mingsheng Ying"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum adiabatic evolutions that can\u0027t be used to design efficient   algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0604077"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "43575b66-7b0e-4170-8f67-08c27a4cf0ce",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}