{
  "annotation_id": "dc03f4b3-d59c-494c-98bc-c46aa4c3708a",
  "date_created": "2026-03-02T18:02:10.052000Z",
  "date_modified": "2026-03-02T18:02:10.052000Z",
  "file_hash": "672a6b5640da9e686374ba9517e7064b71b0db963a8d220a557ca87e48df8adc",
  "private": false,
  "record": {
    "abstract": "This paper explores several aspects of the adiabatic quantum computation\nmodel. We first show a way that directly maps any arbitrary circuit in the\nstandard quantum computing model to an adiabatic algorithm of the same depth.\nSpecifically, we look for a smooth time-dependent Hamiltonian whose unique\nground state slowly changes from the initial state of the circuit to its final\nstate. Since this construction requires in general an n-local Hamiltonian, we\nwill study whether approximation is possible using previous results on ground\nstate entanglement and perturbation theory. Finally we will point out how the\nadiabatic model can be relaxed in various ways to allow for 2-local partially\nadiabatic algorithms as well as 2-local holonomic quantum algorithms.",
    "arxiv_id": "quant-ph/0409024",
    "authors": [
      "M. Stewart Siu"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.062314",
    "title": "From quantum circuits to adiabatic algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0409024"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "326fd5ba-2b8c-44d3-87f4-88c87ddb93dc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}