arXiv Analytics

Sign in

arXiv:0909.4186 [quant-ph]AbstractReferencesReviewsResources

Quantum dice rolling: A multi-outcome generalization of quantum coin flipping

N. Aharon, J. Silman

Published 2009-09-23Version 1

We generalize the problem of coin flipping to more than two outcomes and parties. We term this problem dice rolling, and study both its weak and strong variants. We prove by construction that in quantum settings (i) weak N-sided dice rolling admits an arbitrarily small bias for any value of N, and (ii) two-party strong N-sided dice rolling saturates the corresponding generalization of Kitaev's bound for any value of N. In addition, we make use of this last result to introduce a family of optimal 2m-party strong n^m-sided dice rolling protocols for any value of m and n.

Comments: Supercedes arXiv:0908.1682
Journal: New J. Phys., 12, 033027 (2010)
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0206123 (Published 2002-06-19)
On bit-commitment based quantum coin flipping
arXiv:quant-ph/0204022 (Published 2002-04-04)
A New Protocol and Lower Bounds for Quantum Coin Flipping
arXiv:0908.1682 [quant-ph] (Published 2009-08-12, updated 2009-08-20)
Quantum dice rolling