{
  "annotation_id": "f9a8099e-ce39-4c81-a391-ac66191ace3a",
  "date_created": "2026-03-02T18:02:09.944000Z",
  "date_modified": "2026-03-02T18:02:09.944000Z",
  "file_hash": "d933400608567fe1d77bedee80d39e43a98ff525b4ae9d752f75fef955ba7c95",
  "private": false,
  "record": {
    "abstract": "We extend the definition of concurrence into a family of entanglement\nmonotones, which we call concurrence monotones. We discuss their properties and\nadvantages as computational manageable measures of entanglement, and show that\nfor pure bipartite states all measures of entanglement can be written as\nfunctions of the concurrence monotones. We then show that the concurrence\nmonotones provide bounds on quantum information tasks. As an example, we\ndiscuss their applications to remote entanglement distributions (RED) such as\nentanglement swapping and remote preparation of bipartite entangled states\n(RPBES). We prove a powerful theorem which states what kind of (possibly mixed)\nbipartite states or distributions of bipartite states can not be remotely\nprepared. The theorem establishes an upper bound on the amount of\n$G$-concurrence (one member in the concurrence family) that can be created\nbetween two single-qudit nodes of quantum networks by means of tripartite RED.\nFor pure bipartite states the bound on the $G$-concurrence can always be\nsaturated by RPBES.",
    "arxiv_id": "quant-ph/0410148",
    "authors": [
      "Gilad Gour"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.012318",
    "journal_ref": "Physical Review A 71, 012318 (2005)",
    "title": "Family of Concurrence Monotones and its Applications",
    "url": "https://arxiv.org/abs/quant-ph/0410148"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "260a691e-b1c0-45e0-b255-41e6d19a73c6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}