{
  "annotation_id": "d44ae725-3859-4e6f-9a77-8843ed4a70a6",
  "date_created": "2026-03-02T18:01:55.799000Z",
  "date_modified": "2026-03-02T18:01:55.799000Z",
  "file_hash": "5569c82d6c2baf9d8df487265909e8f0a2650928a22b96ff97e1c3ae066e3973",
  "private": false,
  "record": {
    "abstract": "The computable cross norm (CCN) criterion is a new powerful analytical and\ncomputable separability criterion for bipartite quantum states, that is also\nknown to systematically detect bound entanglement. In certain aspects this\ncriterion complements the well-known Peres positive partial transpose (PPT)\ncriterion. In the present paper we study important analytical properties of the\nCCN criterion. We show that in contrast to the PPT criterion it is not\nsufficient in dimension 2 x 2. In higher dimensions we prove theorems\nconnecting the fidelity of a quantum state with the CCN criterion. We also\nanalyze the behaviour of the CCN criterion under local operations and identify\nthe operations that leave it invariant. It turns out that the CCN criterion is\nin general not invariant under local operations.",
    "arxiv_id": "quant-ph/0212047",
    "authors": [
      "Oliver Rudolph"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.67.032312",
    "journal_ref": "Physical Review A 67, 032312 (2003)",
    "title": "Some Properties of the Computable Cross Norm Criterion for Separability",
    "url": "https://arxiv.org/abs/quant-ph/0212047"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "27673297-234a-4f71-9ef7-041268bf77be",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}