{
  "annotation_id": "3e58fad4-f9bf-4acb-9a9a-3612ef4af719",
  "date_created": "2026-03-02T18:01:51.778000Z",
  "date_modified": "2026-03-02T18:01:51.778000Z",
  "file_hash": "404cc6f500805b2543ff6b050803e5a58cc100d09c2952bc5f6c56d496eb6118",
  "private": false,
  "record": {
    "abstract": "A secret key shared through quantum key distribution between two cooperative\nplayers is secure against any eavesdropping attack allowed by the laws of\nphysics. Yet, such a key can be established only when the quantum channel error\nrate due to eavesdropping or imperfect apparatus is low. Here, I report a\npractical quantum key distribution scheme making use of an adaptive privacy\namplification procedure with two-way classical communication. Then, I prove\nthat the scheme generates a secret key whenever the bit error rate of the\nquantum channel is less than $0.5-0.1\\sqrt{5} \\approx 27.6%$, thereby making it\nthe most error resistant scheme known to date.",
    "arxiv_id": "quant-ph/0205060",
    "authors": [
      "H. F. Chau"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Practical Scheme To Share A Secret Key Through An Up To 27.6% Bit Error   Rate Quantum Channel",
    "url": "https://arxiv.org/abs/quant-ph/0205060"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f8be06ed-518f-4c3c-a356-e3878e3bf7aa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}