{
  "annotation_id": "4a76165c-eac8-4c84-8537-0b75d04e265c",
  "date_created": "2026-03-02T18:01:59.925000Z",
  "date_modified": "2026-03-02T18:01:59.925000Z",
  "file_hash": "7d7a29201b6692192c7481c3461eeabd63f21f7f567b7bbb8e2d01c83c719a57",
  "private": false,
  "record": {
    "abstract": "The study of quantum computation has been motivated by the hope of finding\nefficient quantum algorithms for solving classically hard problems. In this\ncontext, quantum algorithms by local adiabatic evolution have been shown to\nsolve an unstructured search problem with a quadratic speed-up over a classical\nsearch, just as Grover\u0027s algorithm. In this paper, we study how the structure\nof the search problem may be exploited to further improve the efficiency of\nthese quantum adiabatic algorithms. We show that by nesting a partial search\nover a reduced set of variables into a global search, it is possible to devise\nquantum adiabatic algorithms with a complexity that, although still\nexponential, grows with a reduced order in the problem size.",
    "arxiv_id": "quant-ph/0304039",
    "authors": [
      "J\u00e9r\u00e9mie Roland",
      "Nicolas J. Cerf"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.062312",
    "journal_ref": "Phys. Rev. A 68, 062312 (2003).",
    "title": "Adiabatic quantum search algorithm for structured problems",
    "url": "https://arxiv.org/abs/quant-ph/0304039"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a3270551-69c6-4ab7-a357-48eb57b92692",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}