{
  "annotation_id": "d252d170-53b8-461b-9840-127e178b3a0a",
  "date_created": "2026-03-02T18:02:24.194000Z",
  "date_modified": "2026-03-02T18:02:24.194000Z",
  "file_hash": "80b05960716943d3e1c0576389218a2b4125c14979800702a76719a97202a82c",
  "private": false,
  "record": {
    "abstract": "It is proven that recently introduced states with perfectly secure bits of\ncryptographic key (private states representing secure bit) [K. Horodecki et\nal., Phys. Rev. Lett. 94, 160502 (2005)] as well as its multipartite and higher\ndimension generalizations always represent distillable entanglement. The\ncorresponding lower bounds on distillable entanglement are provided. We also\npresent a simple alternative proof that for any bipartite quantum state\nentanglement cost is an upper bound on distillable cryptographic key in\nbipartite scenario.",
    "arxiv_id": "quant-ph/0602176",
    "authors": [
      "Pawel Horodecki",
      "Remigiusz Augusiak"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.010302",
    "journal_ref": "Physical Review A 74, 010302(R) (2006)",
    "title": "Quantum states representing perfectly secure bits are always distillable",
    "url": "https://arxiv.org/abs/quant-ph/0602176"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ea785448-89f6-4746-8038-66fe728ba0c5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}