{
  "annotation_id": "12dae191-d35a-4711-a486-5918717144ca",
  "date_created": "2026-03-02T18:01:49.389000Z",
  "date_modified": "2026-03-02T18:01:49.389000Z",
  "file_hash": "19f837af7cadf94bab2a39be909c07b5997e55da75676b36423d761c679efacc",
  "private": false,
  "record": {
    "abstract": "In a previous paper a straight forward construction method for quantum error\ncorrecting codes, based on graphs, has been presented. These graph codes are\ndirectly related to cluster states which have been introduced by Briegel and\nRaussendorf. We show that the preparation of a cluster state as well as the\ncoding operation for a graph code, can be implemented by a logical network.\nConcerning the qubit case each vertex corresponds to an Hadamard gate and each\nedge corresponds to a controlled not gate.",
    "arxiv_id": "quant-ph/0202007",
    "authors": [
      "Dirk Schlingemann"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Logical network implementation for cluster states and graph codes",
    "url": "https://arxiv.org/abs/quant-ph/0202007"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4a161a45-bcfe-4eaa-98eb-ae1c6aa9ca21",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}