{
  "annotation_id": "222072e9-b2ff-4232-9f58-5a44bccc9cad",
  "date_created": "2026-03-02T18:02:13.631000Z",
  "date_modified": "2026-03-02T18:02:13.631000Z",
  "file_hash": "aca17abdbcf59551cac611aa3a38378d5e567f2cb2c4f3a4306e3713b4b5d20c",
  "private": false,
  "record": {
    "abstract": "We numerically study quantum adiabatic algorithm for the propositional\nsatisfiability. A new class of previously unknown hard instances is identified\namong random problems. We numerically find that the running time for such\ninstances grows exponentially with their size. Worst case complexity of quantum\nadiabatic algorithm therefore seems to be exponential.",
    "arxiv_id": "quant-ph/0502077",
    "authors": [
      "Marko Znidaric"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.062305",
    "journal_ref": "Phys.Rev.A 71, 062305 (2005)",
    "title": "Scaling of running time of quantum adiabatic algorithm for propositional   satisfiability",
    "url": "https://arxiv.org/abs/quant-ph/0502077"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9d56aef8-3e48-43d3-9979-a6466651fc07",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}