Symmetry-assisted adversaries for quantum state generation A Ambainis, L Magnin, M Roetteler, J Roland 26th Annual IEEE Conference on Computational Complexity, 167-177, 2010 | 59 | 2010 |
Strong no-go theorem for Gaussian quantum bit commitment L Magnin, F Magniez, A Leverrier, NJ Cerf Physical Review A 81 (1), 010302, 2010 | 36 | 2010 |
Tight bounds on the eavesdropping of a continuous-variable quantum cryptographic protocol with no basis switching J Sudjana, L Magnin, R García-Patrón, NJ Cerf Physical Review A 76 (5), 052301, 2007 | 32 | 2007 |
A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias D Aharonov, A Chailloux, M Ganz, I Kerenidis, L Magnin SIAM Journal on Computing 45 (3), 633-679, 2016 | 28 | 2016 |
Spatial reference frame agreement in quantum networks T Islam, L Magnin, B Sorg, S Wehner New Journal of Physics 16 (6), 063040, 2014 | 11 | 2014 |
Explicit relation between all lower bound techniques for quantum query complexity L Magnin, J Roland 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 10 | 2013 |
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting D Aharonov, M Ganz, L Magnin arXiv preprint arXiv:1707.01187, 2017 | 5 | 2017 |
Two-player interaction in quantum computing: cryptographic primitives & query complexity L Magnin Université Paris Sud-Paris XI; Université libre de Bruxelles (1970 …, 2011 | 2 | 2011 |
Quantum algorithms with continuous variables for black box problems N Cerf, P Høyer, L Magnin, BC Sanders 3rd international workshop on physics and computation (P&C 2010) conference …, 2010 | 2 | 2010 |
Heisenberg-limited eavesdropping on the continuous-variable quantum cryptographic protocol with no basis switching is impossible J Sudjana, L Magnin, R Garcia-Patron, NJ Cerf arXiv preprint arXiv:0706.4283, 2007 | 1 | 2007 |
Quantum adversary lower bounds by polynomials L Magnin, J Roland | | 2011 |
Mise en gage quantique avec des variables continues L Magnin | | 2007 |