37 citations · 76 across the 6 of their papers we have counts for
7 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…
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…
Reference frame agreement in quantum networks
Tanvirul Islam, Loïck Magnin, Brandon Sorg +1
In order to communicate information in a quantum network effectively, all network nodes should share a common reference frame. Here, we propose to study how well m nodes in a quant…
Explicit relation between all lower bound techniques for quantum query complexity
Loïck Magnin, Jérémie Roland
The polynomial method and the adversary method are the two main techniques to prove lower bounds on quantum query complexity, and they have so far been considered as unrelated appr…
Symmetry-assisted adversaries for quantum state generation
Andris Ambainis, Loïck Magnin, Martin Roetteler +1
We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of…
Strong no-go theorem for Gaussian quantum bit commitment
Loïck Magnin, Frédéric Magniez, Anthony Leverrier +1
Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaus…