{
  "annotation_id": "358aa19e-bc8d-4cff-ab0b-e007367d377b",
  "date_created": "2026-03-02T18:02:34.259000Z",
  "date_modified": "2026-03-02T18:02:34.259000Z",
  "file_hash": "da8b05bf9e2dbf6da3f3ae565619f87f4132000484fdb5e6b7c2d5a34f680535",
  "private": false,
  "record": {
    "abstract": "The speed-up provided by quantum algorithms with respect to their classical\ncounterparts is at the origin of scientific interest in quantum computation.\nHowever, the fundamental reasons for such a speed-up are not yet completely\nunderstood and deserve further attention. In this context, the classical\nsimulation of quantum algorithms is a useful tool that can help us in gaining\ninsight. Starting from the study of general conditions for classical\nsimulation, we highlight several important differences between two\nnon-equivalent classes of quantum algorithms. We investigate their performance\nunder realistic conditions by quantitatively studying their resilience with\nrespect to static noise. This latter refers to errors affecting the inital\npreparation of the register used to run an algorithm. We also compare the\nevolution of the entanglement involved in the different computational\nprocesses.",
    "arxiv_id": "quant-ph/0701199",
    "authors": [
      "C. Di Franco",
      "M. Paternostro",
      "M. S. Kim"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.75.052316",
    "journal_ref": "Phys. Rev. A 75, 052316 (2007)",
    "title": "Noise resilience and entanglement evolution in two non-equivalent   classes of quantum algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0701199"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ae2ab716-479b-4e32-bd0a-ba0a8ff7d42e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}