{
  "annotation_id": "47a8afb8-b9a8-47c0-afd5-56ed13469a65",
  "date_created": "2026-03-02T18:02:23.904000Z",
  "date_modified": "2026-03-02T18:02:23.904000Z",
  "file_hash": "dde61c31b9404e0ea829a053d48d18cc6621910a57060fe644da058ccd237d21",
  "private": false,
  "record": {
    "abstract": "Consider a quantum system with $m$ subsystems with $n$ qubits each, and\nsuppose the state of the system is living in the symmetric subspace. It is\nknown that, in the limit of $m\\to\\infty$, entanglement between any two\nsubsystems vanishes.\n  In this paper we study asymptotic behavior of the entanglement as $m$ and $n$\ngrows. Our conjecture is that if $m$ is a polynomially bounded function in $n$,\nthen the entanglement decreases polynomially.\n  The motivation of this study is a study of quantum Merlin-Arthur game. If\nthis conjecture is ture, we can prove that bipartite separable certificate does\nnot increase the computational power of the proof system. protocol.\n  In the paper, we provide two evidences which support the conjecture. First,\nif $m$ is an exponential function, then entanglement decreases exponentially\nfast. Second, in case of a maximally entangled state, our conjecture is true.",
    "arxiv_id": "quant-ph/0511240",
    "authors": [
      "Keiji Matsumoto"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Can entanglement efficiently be weakend by symmetrization?",
    "url": "https://arxiv.org/abs/quant-ph/0511240"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "81116909-f25a-40cb-9d53-e26f635414c0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}