{
  "annotation_id": "674f3ddb-40c1-483c-9db8-eba2cf68f1be",
  "date_created": "2026-03-02T18:02:27.507000Z",
  "date_modified": "2026-03-02T18:02:27.507000Z",
  "file_hash": "a07deb93de08213040b5ba59d48d04ac94a4372e0e506e8fb318489fddcae175",
  "private": false,
  "record": {
    "abstract": "We present multiparty entanglement purification protocols that are capable of\npurifying arbitrary graph states directly. We develop recurrence and breeding\nprotocols and compare our methods with strategies based on bipartite\nentanglement purification in static and communication scenarios. We find that\ndirect multiparty purification is of advantage with respect to achievable\nyields and minimal required fidelity in static scenarios, and with respect to\nobtainable fidelity in the case of noisy operations in both scenarios.",
    "arxiv_id": "quant-ph/0606090",
    "authors": [
      "Caroline Kruszynska",
      "Akimasa Miyake",
      "Hans J. Briegel",
      "Wolfgang D\u00fcr"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.052316",
    "journal_ref": "Phys. Rev. A 74, 052316 (2006)",
    "title": "Entanglement purification protocols for all graph states",
    "url": "https://arxiv.org/abs/quant-ph/0606090"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8cf6c032-7776-4e4a-a2d7-0a0926f75482",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}