Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
members:jroland [2015/03/09 15:33] jroland [Selected talks] |
members:jroland [2015/03/19 09:57] jroland [News] |
||
|---|---|---|---|
| Line 17: | Line 17: | ||
| | QuIC - Ecole Polytechnique de Bruxelles \\ Université Libre de Bruxelles \\ 50 av. F. D. Roosevelt - CP 165/59 \\ B-1050 Bruxelles \\ Belgique | | QuIC - Ecole Polytechnique de Bruxelles \\ Université Libre de Bruxelles \\ 50 av. F. D. Roosevelt - CP 165/59 \\ B-1050 Bruxelles \\ Belgique | ||
| |} | |} | ||
| + | |||
| + | ==== News ==== | ||
| + | * On May 31, 2015, I will run the 20km of Brussels for [[http://www.medecinsdumonde.be/|Doctors of the World]]. Help me support their action by [[http://www.medecinsdumonde.be/events/20-km-de-bruxelles/j-r-mie_roland|sponsoring my race]]. | ||
| + | * Any query problem can be solved optimally with bounded error by and adiabatic quantum algorithms, as shown in the article I coauthored with my PhD student Mathieu Brandeho, which was just accepted at [[http://tqc2015.ulb.ac.be|TQC 2015]]. Congratulations to Mathieu for his first accepted article! | ||
| + | * Quantum walks can find a marked element on any graph! The original result was obtained in 2010 with my coauthors Hari Krovi, Frédéric Magniez and Maris Ozols, but the full journal article is finally available in Algorithmica: [ [[http://dx.doi.org/10.1007/s00453-015-9979-8|DOI]] | [[http://arxiv.org/abs/1002.2419|arXiv]] ] | ||
| ==== Short biography ==== | ==== Short biography ==== | ||