dorsal/arxiv
View SchemaLower bound for a class of weak quantum coin flipping protocols
| Authors | Andris Ambainis |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0204063 |
| URL | https://arxiv.org/abs/quant-ph/0204063 |
Abstract
We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (quant-ph/0202118). We show that, for any protocol in this class, one party can win the coin flip with probability at least $1/\sqrt{2}$.
{
"annotation_id": "2169cafe-7afc-4f84-bb0e-37dc889ea6e3",
"date_created": "2026-03-02T18:01:49.381000Z",
"date_modified": "2026-03-02T18:01:49.381000Z",
"file_hash": "4befa30c633b9e0f88d1e815bb1099f035c1dfaa212e07135a92212850955a3b",
"private": false,
"record": {
"abstract": "We study the class of protocols for weak quantum coin flipping introduced by\nSpekkens and Rudolph (quant-ph/0202118). We show that, for any protocol in this\nclass, one party can win the coin flip with probability at least $1/\\sqrt{2}$.",
"arxiv_id": "quant-ph/0204063",
"authors": [
"Andris Ambainis"
],
"categories": [
"quant-ph",
"cs.CR"
],
"title": "Lower bound for a class of weak quantum coin flipping protocols",
"url": "https://arxiv.org/abs/quant-ph/0204063"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "df7afc13-749a-45db-9e64-b7fb0767a7ad",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}