Pith. sign in

REVIEW

Lower bound for a class of weak quantum coin flipping protocols

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0204063 v1 pith:WKEFACVS submitted 2002-04-11 quant-ph cs.CR

Andris Ambainis This is my paper
classification quant-phcs.CR
keywords classcoinflippingprotocolsquantumweakboundflip
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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}$.

Discussion (0). Sign in to comment.

Pith tools