{
  "annotation_id": "9b7d1a52-f128-483f-a82e-c4f381ef61fa",
  "date_created": "2026-03-02T18:01:48.886000Z",
  "date_modified": "2026-03-02T18:01:48.886000Z",
  "file_hash": "a38dac6225d1e2f11c39481bea7d21ee4006eb664601aed2db057b66fdc83a15",
  "private": false,
  "record": {
    "abstract": "We present a quantum protocol for the task of weak coin flipping. We find\nthat, for one choice of parameters in the protocol, the maximum probability of\na dishonest party winning the coin flip if the other party is honest is\n1/sqrt(2). We also show that if parties restrict themselves to strategies\nwherein they cannot be caught cheating, their maximum probability of winning\ncan be even smaller. As such, the protocol offers additional security in the\nform of cheat sensitivity.",
    "arxiv_id": "quant-ph/0202118",
    "authors": [
      "R. W. Spekkens",
      "Terry Rudolph"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.89.227901",
    "journal_ref": "Phys. Rev. Lett. vol 89, 227901 (2002)",
    "title": "A quantum protocol for cheat-sensitive weak coin flipping",
    "url": "https://arxiv.org/abs/quant-ph/0202118"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e3262dea-bee6-4305-8f55-5bd9775b36af",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}