{
  "annotation_id": "da95549a-6a0c-4156-befa-9a0f206ecfa8",
  "date_created": "2026-03-02T18:02:34.310000Z",
  "date_modified": "2026-03-02T18:02:34.310000Z",
  "file_hash": "d6091aa68d9f50245c6bb4d5f82cb5cd91d852d05f1c27d13cc0c9b12c1b614e",
  "private": false,
  "record": {
    "abstract": "We analyse the relationship between the full additivity of the entanglement\ncost and its full monotonicity under local operations and classical\ncommunication. We show that the two properties are equivalent for the\nentanglement cost. The proof works for the regularization of any convex,\nsubadditive, and asymptotically continuous entanglement monotone, and hence\nalso applies to the asymptotic relative entropy of entanglement.",
    "arxiv_id": "quant-ph/0702136",
    "authors": [
      "Fernando G. S. L. Brandao",
      "Michal Horodecki",
      "Martin B. Plenio",
      "Shashank Virmani"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s11080-007-9056-0",
    "journal_ref": "Open Sys. Inf. Dyn., 14, page 333 (2007)",
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Remarks on the equivalence of full additivity and monotonicity for the   entanglement cost",
    "url": "https://arxiv.org/abs/quant-ph/0702136"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "55986cbd-a209-4853-9041-9a31d8030f2a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}