Lower bound for a class of weak quantum coin flipping protocols

Simple item page
dc.creatorAmbainis, Andris
dc.date2002-04-11
dc.date.accessioned2026-07-07T06:03:57Z
dc.date.available2026-07-07T06:03:57Z
dc.descriptionWe 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}$.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0204063
dc.identifierhttp://arxiv.org/abs/quant-ph/0204063
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90134
dc.subjectQuantum Physics
dc.subjectCryptography and Security
dc.titleLower bound for a class of weak quantum coin flipping protocols
dc.typetext

Files

Collections

arXiv