{
  "annotation_id": "ec71c498-fe1d-481b-8d37-55813dd0539d",
  "date_created": "2026-03-02T18:02:19.973000Z",
  "date_modified": "2026-03-02T18:02:19.973000Z",
  "file_hash": "b43efe2b325d3d193c460f9e7015121bc869d069855f8904392cb84418fb0238",
  "private": false,
  "record": {
    "abstract": "We present a hashing protocol for distilling multipartite CSS states by means\nof local Clifford operations, Pauli measurements and classical communication.\nIt is shown that this hashing protocol outperforms previous versions by\nexploiting information theory to a full extent an not only applying CNOTs as\nlocal Clifford operations. Using the information-theoretical notion of a\nstrongly typical set, we calculate the asymptotic yield of the protocol as the\nsolution of a linear programming problem.",
    "arxiv_id": "quant-ph/0510096",
    "authors": [
      "Erik Hostens",
      "Jeroen Dehaene",
      "Bart De Moor"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.73.042316",
    "journal_ref": "Phys. Rev. A 73, 042316 (2006)",
    "title": "Hashing protocol for distilling multipartite CSS states",
    "url": "https://arxiv.org/abs/quant-ph/0510096"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5ef58315-be07-4ac7-a0b1-e13013326b2f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}