{
  "annotation_id": "29597430-a5bd-4525-9f46-213290382442",
  "date_created": "2026-03-02T18:02:16.425000Z",
  "date_modified": "2026-03-02T18:02:16.425000Z",
  "file_hash": "ede581ec0c2250f42a6c7d3acc43b5b50521b3c77a02edbdee16826fbb94e023",
  "private": false,
  "record": {
    "abstract": "It is proven that the logarithmic negativity does not increase on average\nunder positive partial transpose preserving (PPT) operation including\nsubselection (a set of operations that incorporate local operations and\nclassical communication (LOCC) as a subset) and, in the process, a further\nproof is provided that the negativity does not increase on average under the\nsame set of operations. Given that the logarithmic negativity is obtained from\nthe negativity applying a concave function and is itself not a convex quantity\nthis result is surprising as convexity is generally considered as describing\nthe local physical process of losing information. The role of convexity and in\nparticular its relation (or lack thereof) to physical processes is discussed in\nthis context.",
    "arxiv_id": "quant-ph/0505071",
    "authors": [
      "M. B. Plenio"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.95.090503",
    "journal_ref": "Phys. Rev. Lett. 95, 090503 (2005)",
    "title": "The logarithmic negativity: A full entanglement monotone that is not   convex",
    "url": "https://arxiv.org/abs/quant-ph/0505071"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4da7261f-265a-466c-92c5-8f54febbe7f0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}