{
  "annotation_id": "b79d7cee-feb9-45ad-8d55-e4cdfabecd58",
  "date_created": "2026-03-02T18:02:23.620000Z",
  "date_modified": "2026-03-02T18:02:23.620000Z",
  "file_hash": "9cf787b28f048b32c83f676ae9eaebbccfb3bc4340a58575c749c0a2881853b1",
  "private": false,
  "record": {
    "abstract": "The continuous variable quantum key distribution has been considered to have\nthe potential to provide high secret key rate. However, in present experimental\ndemonstrations, the secret key can be distilled only under very small loss\nrates. Here, by calculating explicitly the computational complexity with the\nchannel transmission, we show that under high loss rate it is hard to distill\nthe secret key in present continuous variable scheme and one of its advantages,\nthe potential of providing high secret key rate, may therefore be limited.",
    "arxiv_id": "quant-ph/0602019",
    "authors": [
      "Yi-Bo Zhao",
      "You-Zhen Gui",
      "Jin-Jian Chen",
      "Zheng-Fu Han",
      "Guang-Can Guo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1109/TIT.2008.921889",
    "journal_ref": "IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2803--2807, Jun.\n  2008",
    "title": "Computational Complexity of Continuous Variable Quantum Key Distribution",
    "url": "https://arxiv.org/abs/quant-ph/0602019"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "89d106e9-c4df-4973-8c19-922307fa5692",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}