{
  "annotation_id": "9d9174fc-6063-4010-a004-1a40536e8de9",
  "date_created": "2026-03-02T18:01:53.156000Z",
  "date_modified": "2026-03-02T18:01:53.156000Z",
  "file_hash": "a3313e39f0c18b8d9bc2e82fe677e24112b49f8e895e2e15a190911f687a9902",
  "private": false,
  "record": {
    "abstract": "In this paper, we focus on a special framework for quantum coin flipping\nprotocols,_bit-commitment based protocols_, within which almost all known\nprotocols fit. We show a lower bound of 1/16 for the bias in any such protocol.\nWe also analyse a sequence of multi-round protocol that tries to overcome the\ndrawbacks of the previously proposed protocols, in order to lower the bias. We\nshow an intricate cheating strategy for this sequence, which leads to a bias of\n1/4. This indicates that a bias of 1/4 might be optimal in such protocols, and\nalso demonstrates that a cleverer proof technique may be required to show this\noptimality.",
    "arxiv_id": "quant-ph/0206123",
    "authors": [
      "Ashwin Nayak",
      "Peter Shor"
    ],
    "categories": [
      "quant-ph",
      "cs.CR"
    ],
    "doi": "10.1103/PhysRevA.67.012304",
    "title": "On bit-commitment based quantum coin flipping",
    "url": "https://arxiv.org/abs/quant-ph/0206123"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "817ed41b-553d-47ff-a4ac-c85b438f3e0e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}