{
  "annotation_id": "96643292-ee8c-4286-9465-732ff1d4e6fd",
  "date_created": "2026-03-02T18:02:02.864000Z",
  "date_modified": "2026-03-02T18:02:02.864000Z",
  "file_hash": "2d9557879e721fdaa088f3df5b4712af0c4726072df36c7f1f3ded49c612ccb5",
  "private": false,
  "record": {
    "abstract": "Quantum protocols for coin-flipping can be composed in series in such a way\nthat a cheating party gains no extra advantage from using entanglement between\ndifferent rounds. This composition principle applies to coin-flipping protocols\nwith cheat sensitivity as well, and is used to derive two results: There are no\nquantum strong coin-flipping protocols with cheat sensitivity that is linear in\nthe bias (or bit-commitment protocols with linear cheat detection) because\nthese can be composed to produce strong coin-flipping with arbitrarily small\nbias. On the other hand, it appears that quadratic cheat detection cannot be\ncomposed in series to obtain even weak coin-flipping with arbitrarily small\nbias.",
    "arxiv_id": "quant-ph/0311165",
    "authors": [
      "Carlos Mochon"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.70.032312",
    "journal_ref": "Phys. Rev. A 70, 032312 (2004)",
    "title": "Serial composition of quantum coin-flipping, and bounds on cheat   detection for bit-commitment",
    "url": "https://arxiv.org/abs/quant-ph/0311165"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "47f3b1a8-6bc2-4f70-a2ce-c61459426673",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}