Quantum Leader Election

Details Quantum Leader Election Quantum Leader Election

2009-10-26

arxiv.org/abs/0910.4952v1

Physics

Quantum Physics

15 pages, 3 figures

Scientific paper

A group of n individuals who do not trust each other and are located far away from each other, want to select a leader. This is the leader election problem, a natural extension of the coin flipping problem to n players. We want a protocol which will guarantee that an honest player will have almost 1/n chance of winning, regardless of what the other players do (whether they are honest, cheating alone or in groups). It is known to be impossible classically. This work gives a simple algorithm that does it, based on the weak coin flipping protocol with arbitrarily small bias recently derived by Mochon [2007]. The protocol is quite simple to achieve if the number of rounds is linear; We provide an improvement to logarithmic number of rounds.

Affiliated with

Also associated with

No associations

Rating

Quantum Leader Election does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Leader Election, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Leader Election will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563757