{
  "annotation_id": "f54ff53a-fb7f-4e8b-819a-eed99d061e7b",
  "date_created": "2026-03-02T18:01:48.478000Z",
  "date_modified": "2026-03-02T18:01:48.478000Z",
  "file_hash": "cde02347f06f31d64014dd567f06fe450781f33e6c8a829bc2594cc216cdbc25",
  "private": false,
  "record": {
    "abstract": "We present a general technique for hiding a classical bit in multipartite\nquantum states. The hidden bit, encoded in the choice of one of two possible\ndensity operators, cannot be recovered by local operations and classical\ncommunication without quantum communication. The scheme remains secure if\nquantum communication is allowed between certain partners, and can be designed\nfor any choice of quantum communication patterns to be secure, but to allow\nnear perfect recovery for all other patterns. The maximal probability of\nunwanted recovery of the hidden bit, as well as the maximal error for allowed\nrecovery operations can be chosen to be arbitrarily small, given sufficiently\nhigh dimensional systems at each site. No entanglement is needed since the\nhiding states can be chosen to be separable. A single ebit of prior\nentanglement is not sufficient to break the scheme.",
    "arxiv_id": "quant-ph/0203004",
    "authors": [
      "T. Eggeling",
      "R. F. Werner"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.89.097905",
    "title": "Hiding classical data in multi-partite quantum states",
    "url": "https://arxiv.org/abs/quant-ph/0203004"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9fdc4064-ba62-46c0-b0fb-278fb1b8ec6a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}