{
  "annotation_id": "7c4aca79-b5e1-4042-9c8c-1d677e9774ee",
  "date_created": "2026-03-02T18:02:12.981000Z",
  "date_modified": "2026-03-02T18:02:12.981000Z",
  "file_hash": "4958108b63de58f576512614c841ecfbb893894e95b8fd19027c6a12a8005934",
  "private": false,
  "record": {
    "abstract": "Grover\u0027s algorithm is one of the most important quantum algorithms, which\nperforms the task of searching an unsorted database without a priori\nprobability. Recently the adiabatic evolution has been used to design and\nreproduce quantum algorithms, including Grover\u0027s algorithm. In this paper, we\nshow that quantum search algorithm by adiabatic evolution has two properties\nthat conventional quantum search algorithm doesn\u0027t have. Firstly, we show that\nin the initial state of the algorithm only the amplitude of the basis state\ncorresponding to the solution affects the running time of the algorithm, while\nother amplitudes do not. Using this property, if we know a priori probability\nabout the location of the solution before search, we can modify the adiabatic\nevolution to make the algorithm faster. Secondly, we show that by a factor for\nthe initial and finial Hamiltonians we can reduce the running time of the\nalgorithm arbitrarily. Especially, we can reduce the running time of adiabatic\nsearch algorithm to a constant time independent of the size of the database.\nThe second property can be extended to other adiabatic algorithms.",
    "arxiv_id": "quant-ph/0412117",
    "authors": [
      "Zhaohui Wei",
      "Mingsheng Ying"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum search algorithm by adiabatic evolution under a priori   probability",
    "url": "https://arxiv.org/abs/quant-ph/0412117"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "12b121d0-aafd-4e1e-874c-d4f0f7db9f08",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}