====== Loïck Magnin ======

{| class="portrait"
|-
| style="width:159px;" rowspan="4" | <box w=150px border left>{{members:lmagnin:lmagnin.jpg?nolink&150}}</box> 
! style="width:50px;"| Email:
| style="width:541px;"| lmagnin (at) ulb.ac.be
|-
! Phone: 
| +32-2-650 29 56
|-
! Fax:
| +32-2-650 29 41
|-
! Address:
| ULB - QuIC \\ Av. F.D. Roosevelt 50 - CP165/59 \\ B-1050 Bruxelles \\ Belgique
|}

=== Short biography ===
  * Born in Valence (France) in 1983.
  * In September 2004, I began to study fundamental computer science at the École Normale Supérieure de Lyon and got my master in july 2007.
  * Since September 2007, I am working on a PhD thesis at both, the Center for Quantum Information and Communication of the University of Brussels (ULB) and the Laboratoire de Recherche en Informatique (LRI)  
  * in Orsay (France)
  * I am a member of the [[http://www.lri.fr/quantum/gt-iq/|GT-IQ]]

=== Research interests ===
  * Quantum Information Theory
  * Quantum Computing
  * Quantum Information Processing with Continuous Variables
  * Quantum Key Distribution with Continuous Variables
  * Quantum Kolmogorov Complexity

=== Teaching ===
  * 2008-2009 : TP IF1 (Programmation) à l'université Diderot (Paris 7)
  * 2007-2008 : TP (H300) thérorie de l'information, École Polytechnique, Université Libre de Bruxelles. 
  * 2007 : TD en INF311 à l'École Polytechnique (France)

=== Publications ===

== 2011 ==

//Two-player interaction in quantum computing: cryptographic primitives & query complexity//, \\
L. Magnin \\
Ph.D. Thesis, Université Libre de Bruxelles and Université Paris-Sud, \\
{{publications:2011-PhDThesis-lmagnin.pdf|PDF file}}

//Symmetry-assisted adversaries for quantum state generation//, \\
A. Ambainis, L. Magnin, M. Roetteler, and [[members/jroland|J. Roland]] \\
Proceedings of the 26th Annaul IEEE Conference on Computational Complexity (CCC'11) Pages 167-177,  \\
{{publications:2011-CCC-167.pdf|PDF file}},
[[http://arxiv.org/abs/1012.2112|arXiv:1012.2112 [quant-ph]]]

== 2010 ==
//Continuous-variables quantum algorithms for black-box problems//, \\
N. J. Cerf, P. Høyer, L. Magnin and B. C. Sanders\\
3rd Workshop on Physics and Computation\\


//Strong no-go theorem for Gaussian quantum bit commitment//, \\
L. Magnin, F. Magniez, A. Leverrier, and N. J. Cerf, \\
Phys. Rev. A 81 (2010) 010302 (R). \\
{{publications:2010-PRA-81-010302.pdf|PDF file}},
[[http://arxiv.org/abs/0905.3419|arXiv:0905.3419 [quant-ph]]]


== 2007 ==
J. Sudjana, L. Magnin, R. Garcia-Patron, N. J. Cerf,\\
//Tight bounds on the eavesdropping of a continuous-variable quantum cryptographic protocol with no basis switching,//\\
Phys. Rev. A **76**, 052301 (2007) (9 pages)\\
{{publications:2007-PRA-76-052301.pdf|PDF file}}, [[http://arxiv.org/abs/0706.4283|arχiv: quant-ph/0706.4283]]