{
  "annotation_id": "5d335d8f-4d8a-4af4-ac6c-9d3e00b7bb34",
  "date_created": "2026-03-02T18:02:27.105000Z",
  "date_modified": "2026-03-02T18:02:27.105000Z",
  "file_hash": "be29f0a0690ccf863bf474129db9b8a3371c9fdf252d1d4b47073602183eeb96",
  "private": false,
  "record": {
    "abstract": "We describe novel purification protocols for bicolorable graph states. The\nprotocols scale efficiently for large graph states. We introduce a method of\nanalysis that allows us to derive simple recursion relations characterizing\ntheir behavior as well as analytical expressions for their thresholds and fixed\npoint behavior. We introduce two purification protocols with high threshold.\nThey can, for graph degree four, tolerate 1% (3%) gate error or 20% (30%) local\nerror.",
    "arxiv_id": "quant-ph/0605228",
    "authors": [
      "Kovid Goyal",
      "Alex McCauley",
      "Robert Raussendorf"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.032318",
    "journal_ref": "Phys. Rev. A 74, 032318 (2006)",
    "title": "Purification of large bicolorable graph states",
    "url": "https://arxiv.org/abs/quant-ph/0605228"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f0a21796-4c67-49ce-94a2-1feba1974882",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}