{
  "annotation_id": "6ddbc68d-7e40-4b09-babc-8c1380da34a5",
  "date_created": "2026-03-02T18:01:59.937000Z",
  "date_modified": "2026-03-02T18:01:59.937000Z",
  "file_hash": "44e31b98c86b8d566efe382951f9c3187b5b8e9ebfdd64d8ccc85bf2428a7f20",
  "private": false,
  "record": {
    "abstract": "We shed new light on entanglement measures in multipartite quantum systems by\ntaking a computational-complexity approach toward quantifying quantum\nentanglement with two familiar notions--approximability and distinguishability.\nBuilt upon the formal treatment of partial separability, we measure the\ncomplexity of an entangled quantum state by determining (i) how hard to\napproximate it from a fixed classical state and (ii) how hard to distinguish it\nfrom all partially separable states. We further consider the\nKolmogorovian-style descriptive complexity of approximation and distinction of\npartial entanglement.",
    "arxiv_id": "quant-ph/0308072",
    "authors": [
      "Tomoyuki Yamakami"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "journal_ref": "Proc. 14th ISAAC. Springer\u0027s LNCS, Vol.2906, pp.117-128, 2003",
    "title": "Computational Complexity Measures of Multipartite Quantum Entanglement",
    "url": "https://arxiv.org/abs/quant-ph/0308072"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fcf05ee5-fa74-4b18-9fcd-3c8aee58a80d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}