{
  "annotation_id": "385a6f43-5cb2-486e-8df7-84369ba2e0a3",
  "date_created": "2026-03-02T18:02:27.557000Z",
  "date_modified": "2026-03-02T18:02:27.557000Z",
  "file_hash": "ee21a20104060ee39adcddc265b4c2a8563cd7584ae55896723c77e044b5855e",
  "private": false,
  "record": {
    "abstract": "We introduce a constructive method to calculate the achievable secret key\nrate for a generic class of quantum key distribution protocols, when only a\nfinite number n of signals is given. Our approach is applicable to all\nscenarios in which the quantum state shared by Alice and Bob is known. In\nparticular, we consider the six state protocol with symmetric eavesdropping\nattacks, and show that for a small number of signals, i.e. below the order of\n10^4, the finite key rate differs significantly from the asymptotic value for n\napproaching infinity. However, for larger n, a good approximation of the\nasymptotic value is found. We also study secret key rates for protocols using\nhigher-dimensional quantum systems.",
    "arxiv_id": "quant-ph/0607141",
    "authors": [
      "Tim Meyer",
      "Hermann Kampermann",
      "Matthias Kleinmann",
      "Dagmar Bruss"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.042340",
    "journal_ref": "Phys. Rev. A 74, 042340 (2006)",
    "title": "Finite key analysis for symmetric attacks in quantum key distribution",
    "url": "https://arxiv.org/abs/quant-ph/0607141"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8b42770a-479e-4f95-ad02-1c076b716876",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}