{
  "annotation_id": "df92a2d9-9d15-41bd-a461-3145981f8633",
  "date_created": "2026-03-02T18:01:59.609000Z",
  "date_modified": "2026-03-02T18:01:59.609000Z",
  "file_hash": "571788e15ab587a5e40f60ba6246bd9145dad99ffdf56a7c0b43b6e444ceacec",
  "private": false,
  "record": {
    "abstract": "Adiabatic limit is the presumption of the adiabatic geometric quantum\ncomputation and of the adiabatic quantum algorithm. But in reality, the\nvariation speed of the Hamiltonian is finite. Here we develop a general\nformulation of adiabatic quantum computing, which accurately describes the\nevolution of the quantum state in a perturbative way, in which the adiabatic\nlimit is the zeroth-order approximation. As an application of this formulation,\nnon-adiabatic correction or error is estimated for several physical\nimplementations of the adiabatic geometric gates. A quantum computing process\nconsisting of many adiabatic gate operations is considered, for which the total\nnon-adiabatic error is found to be about the sum of those of all the gates.\nThis is a useful constraint on the computational power. The formalism is also\nbriefly applied to the adiabatic quantum algorithm.",
    "arxiv_id": "quant-ph/0304130",
    "authors": [
      "Yu Shi",
      "Yong-Shi Wu"
    ],
    "categories": [
      "quant-ph",
      "cond-mat"
    ],
    "doi": "10.1103/PhysRevA.69.024301",
    "journal_ref": "Phy. Rev. A 69, 024301 (2004)",
    "title": "Perturbative Formulation and Non-adiabatic Corrections in Adiabatic   Quantum Computing Schemes",
    "url": "https://arxiv.org/abs/quant-ph/0304130"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5ed6e4a5-5065-4cb7-8bf9-7e629164370e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}