{
  "annotation_id": "12612136-02ed-43a6-9c36-d91564b0f101",
  "date_created": "2026-03-02T18:02:10.463000Z",
  "date_modified": "2026-03-02T18:02:10.463000Z",
  "file_hash": "812aef5404e9c452eb8826a9a483a1c7bb5ced3d18771237b0a2ba403afe19ee",
  "private": false,
  "record": {
    "abstract": "In quantum key distribution(QKD), one can use a classical CSS code to distill\nthe final key. However, there is a constraint for the two codes in CSS code and\nso far it is unknown how to construct a large CSS code efficiently. Here we\nshow that the BDSW method given by Bennett et al can be modified and the error\ncorrection and privacy amplification can be done separately with two\nINDEPENDENT parity matrices. With such a modification, BDSW method can be used\nto distill the final key without any classical computational complexity. We\nalso apply the method to the case of imperfect source where a small fraction of\nsignals are tagged by Eve.",
    "arxiv_id": "quant-ph/0409099",
    "authors": [
      "Xiang-Bin Wang"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "BDSW protocol revisited: an efficient method for the key distillation   without classical computational complexity",
    "url": "https://arxiv.org/abs/quant-ph/0409099"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6a3ed897-20d4-43a3-b854-d80355fe8cf8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}