{
  "annotation_id": "b496943b-c00e-4470-af57-24df33ede1dc",
  "date_created": "2026-03-02T18:02:03.473000Z",
  "date_modified": "2026-03-02T18:02:03.473000Z",
  "file_hash": "18311d93382d0edad4daa87c9c475a84bfaa0e2bae13ef40eebd9db19ff954ca",
  "private": false,
  "record": {
    "abstract": "Bi-partite entanglement in multi-qubit systems cannot be shared freely. The\nrules of quantum mechanics impose bounds on how multi-qubit systems can be\ncorrelated. In this paper we utilize a concept of entangled graphs with\nweighted edges in order to analyze pure quantum states of multi-qubit systems.\nHere qubits are represented by vertexes of the graph while the presence of\nbi-partite entanglement is represented by an edge between corresponding\nvertexes. The weight of each edge is defined to be the entanglement between the\ntwo qubits connected by the edge, as measured by the concurrence. We prove that\neach entangled graph with entanglement bounded by a specific value of the\nconcurrence can be represented by a pure multi-qubit state. In addition we\npresent a logic network with O(N2) elementary gates that can be used for\npreparation of the weighted entangled graphs of N qubits.",
    "arxiv_id": "quant-ph/0311069",
    "authors": [
      "Martin Plesch",
      "Jaroslav Novotny",
      "Zuzana Dzurakova",
      "Vladimir Buzek"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0305-4470/37/5/025",
    "journal_ref": "J. Phys. A: Math. Gen. 37 (2004), 1843-1859",
    "title": "Controlling bi-partite entanglement in multi-qubit systems",
    "url": "https://arxiv.org/abs/quant-ph/0311069"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "eb45e4ec-0ad5-4837-804e-588b9a6ea7df",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}