{
  "annotation_id": "cf8ca770-01fd-4d35-b274-12f1096a4eae",
  "date_created": "2026-03-02T18:02:30.922000Z",
  "date_modified": "2026-03-02T18:02:30.922000Z",
  "file_hash": "ce9217b0c0661da9acd8e69b4c4f382d04e88e7b98bdf1a18afcc598cfd469fc",
  "private": false,
  "record": {
    "abstract": "In the continuum limit (large number of qubits), adiabatic quantum algorithms\ndisplay a remarkable similarity to sweeps through quantum phase transitions. We\nfind that transitions of second or higher order are advantageous in comparison\nto those of first order. With this insight, we propose a novel adiabatic\nquantum algorithm for the solution of 3-satisfiability (3-SAT) problems (exact\ncover), which is significantly faster than previous proposals according to\nnumerical simulations (up to 20 qubits). These findings suggest that adiabatic\nquantum algorithms can solve NP-complete problems such as 3-SAT much faster\nthan the Grover search routine (yielding a quadratic enhancement), possibly\neven with an exponential speed-up. PACS: 03.67.-a, 03.67.Lx, 73.43.Nq,\n64.70.-p.",
    "arxiv_id": "quant-ph/0608017",
    "authors": [
      "Ralf Sch\u00fctzhold",
      "Gernot Schaller"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.060304",
    "title": "Adiabatic quantum algorithms as quantum phase transitions: first versus   second order",
    "url": "https://arxiv.org/abs/quant-ph/0608017"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b8c9ac4f-5d56-4344-b5d8-b81afe70034b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}