{
  "annotation_id": "d47563f0-824b-45f3-863f-c700e9fc2364",
  "date_created": "2026-03-02T18:02:07.101000Z",
  "date_modified": "2026-03-02T18:02:07.101000Z",
  "file_hash": "0c3b33abd44b1fb002bba172332d38e2ea4e906384496c77ef6c270c9734eac5",
  "private": false,
  "record": {
    "abstract": "A family of protocols for quantum weak coin-flipping which asymptotically\nachieve a bias of 0.192 is described in this paper. The family contains\nprotocols with n+2 messages for all n\u003e1. The case n=2 is equivalent to the\nprotocol of Spekkens and Rudolph with bias of 0.207. The case n=3 achieves a\nbias of 0.199, and n=8 achieves a bias of 0.193. The analysis of the protocols\nuses Kitaev\u0027s description of coin-flipping as a semidefinite program. The paper\nconstructs an analytical solution to the dual problem which provides an upper\nbound on the amount that a party can cheat.",
    "arxiv_id": "quant-ph/0403193",
    "authors": [
      "Carlos Mochon"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "In proceedings of the 45th Symposium on Foundations of Computer\n  Science (FOCS 2004)",
    "title": "Quantum weak coin-flipping with bias of 0.192",
    "url": "https://arxiv.org/abs/quant-ph/0403193"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "712ddf59-1053-40e8-98c0-f0269ec95c8b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}