Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
members:lmagnin [2011/11/19 15:00] joschaef |
members:lmagnin [2012/02/06 10:03] lmagnin |
||
|---|---|---|---|
| Line 37: | Line 37: | ||
| === Publications === | === 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 == | == 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//, \\ | //Strong no-go theorem for Gaussian quantum bit commitment//, \\ | ||
| L. Magnin, F. Magniez, A. Leverrier, and N. J. Cerf, \\ | L. Magnin, F. Magniez, A. Leverrier, and N. J. Cerf, \\ | ||