{
  "annotation_id": "608315df-c213-411d-983e-cab840b3a49f",
  "date_created": "2026-03-02T18:02:27.050000Z",
  "date_modified": "2026-03-02T18:02:27.050000Z",
  "file_hash": "511e9c20dd929778ee373b0760154d802e5df79359ad7cab78ca077cf7e7bed9",
  "private": false,
  "record": {
    "abstract": "The goal of this paper is to study the effect of entanglement on the running\ntime of a quantum computation. Adiabatic quantum computation is suited to this\nkind of study, since it allows us to explicitly calculate the time evolution of\nthe entanglement throughout the calculation. On the other hand however, the\nadiabatic formalism makes it impossible to study the roles of entanglement and\nfidelity separately, which means that results have to be interpreted carefully.\nWe study two algorithms: the search algorithm and the Deutsch-Jozsa algorithm.\nWe find some evidence that entanglement can be considered a resource in quantum\ncomputation.",
    "arxiv_id": "quant-ph/0605040",
    "authors": [
      "K. Choy",
      "G. Passante",
      "D. Ahrensmeier",
      "M. E. Carrington",
      "T. Fugleberg",
      "R. Kobes",
      "G. Kunstatter"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1139/P07-084",
    "title": "The Dynamics of Entanglement in the Adiabatic Search and Deutsch   Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0605040"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7bc0e693-1467-4b18-a70a-82ace3698863",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}