{
  "annotation_id": "51ac7991-ea1a-4a00-82fc-716aedc29f28",
  "date_created": "2026-03-02T18:02:30.147000Z",
  "date_modified": "2026-03-02T18:02:30.147000Z",
  "file_hash": "36d01c22eb4e9fdc9f1119ffe52ee1d314039a6eac406e45b55c4ff0b51c4d14",
  "private": false,
  "record": {
    "abstract": "We exactly evaluate a number of multipartite entanglement measures for a\nclass of graph states, including d-dimensional cluster states (d = 1,2,3), the\nGreenberger-Horne-Zeilinger states, and some related mixed states. The\nentanglement measures that we consider are continuous, `distance from separable\nstates\u0027 measures, including the relative entropy, the so-called geometric\nmeasure, and robustness of entanglement. We also show that for our class of\ngraph states these entanglement values give an operational interpretation as\nthe maximal number of graph states distinguishable by local operations and\nclassical communication (LOCC), as well as supplying a tight bound on the fixed\nletter classical capacity under LOCC decoding.",
    "arxiv_id": "quant-ph/0609102",
    "authors": [
      "Damian Markham",
      "Akimasa Miyake",
      "Shashank Virmani"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/9/6/194",
    "journal_ref": "New J. Phys. 9, 194 (2007)",
    "title": "Entanglement and local information access for graph states",
    "url": "https://arxiv.org/abs/quant-ph/0609102"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "672998f2-bf14-4fb0-af9b-bfa77e6c0923",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}