{
  "annotation_id": "91b0e033-681e-474f-bdfc-d6b334154c7a",
  "date_created": "2026-03-02T18:02:41.533000Z",
  "date_modified": "2026-03-02T18:02:41.533000Z",
  "file_hash": "f04df547abdd6b100510cc4229fd502c230895e6d5c3d2e7ae5e4283439b0bf7",
  "private": false,
  "record": {
    "abstract": "Quantum key distribution is widely thought to offer unconditional security in\ncommunication between two users. Unfortunately, a widely accepted proof of its\nsecurity in the presence of source, device and channel noises has been missing.\nThis long-standing problem is solved here by showing that, given fault-tolerant\nquantum computers, quantum key distribution over an arbitrarily long distance\nof a realistic noisy channel can be made unconditionally secure. The proof is\nreduced from a noisy quantum scheme to a noiseless quantum scheme and then from\na noiseless quantum scheme to a noiseless classical scheme, which can then be\ntackled by classical probability theory.",
    "arxiv_id": "quant-ph/9803006",
    "authors": [
      "Hoi-Kwong Lo",
      "H. F. Chau"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1126/science.283.5410.2050",
    "journal_ref": "Science 283 (1999) 2050-2056",
    "title": "Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long   Distances",
    "url": "https://arxiv.org/abs/quant-ph/9803006"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fb4f027f-f096-46fa-b2d1-2526b3b771e8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}