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/04/15 14:40] jroland [Short biography] |
members:jroland [2015/11/04 10:00] jroland [Teaching] |
||
|---|---|---|---|
| Line 38: | Line 38: | ||
| ==== Teaching ==== | ==== Teaching ==== | ||
| * Compléments de programmation et d'algorithmique (INFO-H-304) | * Compléments de programmation et d'algorithmique (INFO-H-304) | ||
| - | * Quantum information and computation (INFO-H-514) | + | * Quantum information and computation (INFO-H-514) - partim: Quantum computation |
| - | * Examen spécial d'admission en Polytechnique - partie géométrie | + | * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory |
| - | * Analyse complexe - exercices (MATH-H-201) | + | * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe |
| + | * Analyse complexe (MATH-H-201) - partim: Exercices | ||
| + | * Examen spécial d'admission en Polytechnique - Géométrie | ||
| ==== Research interests ==== | ==== Research interests ==== | ||
| * Quantum algorithms | * Quantum algorithms | ||
| Line 76: | Line 77: | ||
| <tr valign="top"> | <tr valign="top"> | ||
| <td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
| - | [<a name="KMOR15">1</a>] | + | [<a name="FJKL+15">1</a>] |
| </td> | </td> | ||
| <td class="bibtexitem"> | <td class="bibtexitem"> | ||
| - | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | + | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu |
| - | Quantum walks can find a marked element on any graph. | + | Laurière, and Jérémie Roland. |
| - | <em>Algorithmica</em>, 2015. | + | |
| - | Published online. | + | |
| - | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | + | |
| - | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | + | |
| - | + | ||
| - | </td> | + | |
| - | </tr> | + | |
| - | + | ||
| - | + | ||
| - | <tr valign="top"> | + | |
| - | <td align="right" class="bibtexnumber"> | + | |
| - | [<a name="FJKL+15">2</a>] | + | |
| - | </td> | + | |
| - | <td class="bibtexitem"> | + | |
| - | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Laurière, Sophie | + | |
| - | Laplante, and Jérémie Roland. | + | |
| Relative Discrepancy does not separate Information and Communication | Relative Discrepancy does not separate Information and Communication | ||
| Complexity. | Complexity. | ||
| - | <em>Electronic Colloquium on Computational Complexity</em>, 28, 2015. | + | In <em>42nd International Colloquium on Automata, Languages and |
| - | [ <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | + | Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer |
| + | Science</em>, pages 506-516. Springer, 2015. | ||
| + | [ <a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a> | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
| </td> | </td> | ||
| Line 108: | Line 95: | ||
| <tr valign="top"> | <tr valign="top"> | ||
| <td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
| - | [<a name="BR14">3</a>] | + | [<a name="BR14">2</a>] |
| </td> | </td> | ||
| <td class="bibtexitem"> | <td class="bibtexitem"> | ||
| Mathieu Brandeho and Jérémie Roland. | Mathieu Brandeho and Jérémie Roland. | ||
| A universal adiabatic quantum query algorithm. | A universal adiabatic quantum query algorithm. | ||
| - | <em>arXiv preprint arXiv:1409.3558</em>, 2014. | + | In <em>10th Conference on the Theory of Quantum Computation, |
| + | Communication and Cryptography (TQC'15)</em>, 2015. | ||
| + | To appear. | ||
| [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | ||
| Line 122: | Line 111: | ||
| <tr valign="top"> | <tr valign="top"> | ||
| <td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
| - | [<a name="KLL+14">4</a>] | + | [<a name="KLL+14">3</a>] |
| </td> | </td> | ||
| <td class="bibtexitem"> | <td class="bibtexitem"> | ||
| Line 129: | Line 118: | ||
| Lower bounds on information complexity via zero-communication | Lower bounds on information complexity via zero-communication | ||
| protocols and applications. | protocols and applications. | ||
| - | <em>SIAM Journal on Computing</em>, 2014. | + | <em>SIAM Journal on Computing</em>, 2015. |
| To appear. | To appear. | ||
| [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
| Line 135: | Line 124: | ||
| </td> | </td> | ||
| </tr> | </tr> | ||
| + | |||
| + | |||
| + | <tr valign="top"> | ||
| + | <td align="right" class="bibtexnumber"> | ||
| + | [<a name="KMOR15">4</a>] | ||
| + | </td> | ||
| + | <td class="bibtexitem"> | ||
| + | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | ||
| + | Quantum walks can find a marked element on any graph. | ||
| + | <em>Algorithmica</em>, 2015. | ||
| + | Published online. | ||
| + | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | ||
| + | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | ||
| + | |||
| + | </td> | ||
| + | </tr> | ||
| + | |||
| + | |||
| Line 145: | Line 152: | ||
| Explicit relation between all lower bound techniques for quantum | Explicit relation between all lower bound techniques for quantum | ||
| query complexity. | query complexity. | ||
| - | <em>International Journal of Quantum Information</em>, 2013. | + | <em>International Journal of Quantum Information</em>, 13(4): 1350059, 2015. |
| - | Online ready. | + | |
| [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | ||