Loïck Magnin

Learn More
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 partial or total functions and the preparation of target quantum states. There has been hope for quite some time that quantum state generation might be a route to tackle the(More)
God does not play dice. He flips coins instead.” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be(More)
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 approaches. Here, we show an explicit reduction from the polynomial method to the multiplicative adversary method. The proof goes by extending the polynomial method from Boolean(More)
BACKGROUND To evaluate outcomes after optimized laser in situ keratomileusis (LASIK) for astigmatism correction with flap created by a mechanical microkeratome or a femtosecond laser. PATIENTS AND METHODS In this retrospective study, a total of 102 eyes of 71 consecutive patients were enrolled undergoing optimized LASIK treatments using the Allegretto(More)
This dissertation studies two di↵erent aspects of two-player interaction in the model of quantum communication and quantum computation. First, we study two cryptographic primitives, that are used as basic blocks to construct sophisticated cryptographic protocols between two players, e.g. identification protocols. The first primitive is “quantum bit(More)
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 solved exactly in the classical setting. We then use our DP protocol to provide a new quantum protocol for the tightly related problem of exact leader election (LE) on a ring,(More)
  • 1