Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
arXiv:0909.4186 · doi:10.1088/1367-2630/12/3/033027
Abstract
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.
Supercedes arXiv:0908.1682
References in corpus (4)
Cited by in corpus (16)
- Simple proof of the impossibility of bit-commitment in generalised probabilistic theories using cone programming
- QKD based on symmetric entangled Bernstein-Vazirani
- Quantum cryptography beyond key distribution: theory and experiment
- Conditions that enable a player to surely win in sequential quantum games
- A family of loss-tolerant quantum coin flipping protocols
- A two-party quantum parliament
- Quantum Weak Coin Flipping
- Tossing Quantum Coins and Dice
- Computing on Anonymous Quantum Network
- Unconditionally secure relativistic multi-party biased coin flipping and die rolling
- Quantum Tapsilou -- a quantum game inspired from the traditional Greek coin tossing game tapsilou
- Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement
- Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming
- The connection between the penny flip game and the dihedral groups
- Impossibility of adversarial self-testing and secure sampling
- A Fast Exact Quantum Algorithm for Solitude Verification