{
  "annotation_id": "3b7c7785-ff2d-4f6c-8adf-b53739de6015",
  "date_created": "2026-03-02T18:01:59.757000Z",
  "date_modified": "2026-03-02T18:01:59.757000Z",
  "file_hash": "a0735aff5de3fcabdf9b931062bc7af11b51addc81778f4f6d3ea351d82494de",
  "private": false,
  "record": {
    "abstract": "For realizing a quantum memory we suggest to first encode quantum information\nvia a quantum error correcting code and then concatenate combined decoding and\nre-encoding operations. This requires that the encoding and the decoding\noperation can be performed faster than the typical decoherence time of the\nunderlying system. The computational model underlying the one-way quantum\ncomputer, which has been introduced by Hans Briegel and Robert Raussendorf,\nprovides a suitable concept for a fast implementation of quantum error\ncorrecting codes. It is shown explicitly in this article is how encoding and\ndecoding operations for stabilizer codes can be realized on a one-way quantum\ncomputer. This is based on the graph code representation for stabilizer codes,\non the one hand, and the relation between cluster states and graph codes, on\nthe other hand.",
    "arxiv_id": "quant-ph/0308022",
    "authors": [
      "Dirk Schlingemann"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum error correcting codes and one-way quantum computing: Towards a   quantum memory",
    "url": "https://arxiv.org/abs/quant-ph/0308022"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fa2a9fd5-64c7-49cf-8939-1da2884bf016",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}