2 citations · 2 across the 2 of their papers we have counts for
4 papers
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting
Dorit Aharonov, Maor Ganz, Loick Magnin
We provide the first quantum (exact) protocol for the Dining Philosophers problem (DP), a central problem in distributed algorithms. It is well known that the problem cannot be sol…
Quantum coin hedging, and a counter measure
Maor Ganz, Or Sattath
A quantum board game is a multi-round protocol between a single quantum player against the quantum board. Molina and Watrous discovered quantum hedging. They gave an example for pe…
A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias
Dorit Aharonov, André Chailloux, Maor Ganz +2
Mochon's proof [Moc07] of existence of quantum weak coin flipping with arbitrarily small bias is a fundamental result in quantum cryptography, but at the same time one of the least…
Quantum Leader Election
Maor Ganz
Leader election between n parties is known to be impossible classically. This work gives a simple algorithm that does it, based on the weak coin flipping protocol with arbitrarily…