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 [2020/05/11 12:22] jroland [Publications] |
members:jroland [2021/09/22 14:27] jroland [Teaching] |
||
---|---|---|---|
Line 6: | Line 6: | ||
| style="width:159px;" rowspan="4" | <box w=150px border left>{{members:jroland-quic.jpg?nolink&150}}</box> | | style="width:159px;" rowspan="4" | <box w=150px border left>{{members:jroland-quic.jpg?nolink&150}}</box> | ||
! style="width:50px;"| Email: | ! style="width:50px;"| Email: | ||
- | | style="width:541px;"| jroland (at) ulb.ac.be | + | | style="width:541px;"| Jeremie.Roland (at) ulb.be |
|- | |- | ||
! Phone: | ! Phone: | ||
Line 42: | Line 42: | ||
==== Teaching ==== | ==== Teaching ==== | ||
- | * Compléments de programmation et d'algorithmique (INFO-H-304) | + | * Since 2021 Analyse II (MATH-H-2000) - partim: part b |
- | * Quantum information and computation (INFO-H-514) - partim: Quantum computation | + | * Since 2015 Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory |
- | * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Complexity Theory | + | * Since 2013 Compléments de programmation et d'algorithmique (INFO-H-304) |
- | * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe | + | * Since 2012 Quantum information and computation (INFO-H-514) - partim: Quantum computation |
- | * Signaux et Systèmes (MATH-H-3001) - partim: Exercices | + | * Since 2012 Examen spécial d'admission en Polytechnique - Géométrie |
- | * Examen spécial d'admission en Polytechnique - Géométrie | + | * 2016-2021 Signaux et Systèmes (MATH-H-3001) - partim: Exercices |
+ | * 2015-2021 Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe | ||
+ | |||
==== Research interests ==== | ==== Research interests ==== | ||
* Quantum algorithms | * Quantum algorithms | ||
Line 88: | Line 91: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CNR20">1</a>] | + | [<a name="ARV21">1</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | + | Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. |
- | On the optimality of spatial search by continuous-time quantum walk. | + | Analytic quantum weak coin flipping protocols with arbitrarily small |
- | <em>arXiv e-prints</em>, arXiv:2004.12686, 2020. | + | bias. |
- | [ <a href="http://arxiv.org/abs/2004.12686">arXiv</a> ] | + | In <em>Proceedings of the 2021 ACM-SIAM Symposium on Discrete |
+ | Algorithms (SODA)</em>, pages 919-938, 2021. | ||
+ | [ <a href="http://dx.doi.org/10.1137/1.9781611976465.58">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1911.13283">arXiv</a> ] | ||
</td> | </td> | ||
Line 102: | Line 108: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CLR20">2</a>] | + | [<a name="CNR20b">2</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. | + | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. |
- | How fast do quantum walks mix? | + | Optimality of spatial search via continuous-time quantum walks. |
- | <em>Physical Review Letters</em>, 124(5):050501, 2020. | + | <em>Phys. Rev. A</em>, 102:032214, 2020. |
- | [ <a href="http://dx.doi.org/10.1103/physrevlett.124.050501">DOI</a> | | + | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.032214">DOI</a> | |
- | <a href="http://arxiv.org/abs/2001.06305">arXiv</a> ] | + | <a href="http://arxiv.org/abs/2004.12686">arXiv</a> ] |
</td> | </td> | ||
Line 117: | Line 123: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ARV19">3</a>] | + | [<a name="CNR20a">3</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. | + | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. |
- | Explicit quantum weak coin flipping protocols with arbitrarily small | + | Finding a marked node on any graph via continuous-time quantum walks. |
- | bias. | + | <em>Phys. Rev. A</em>, 102:022227, 2020. |
- | <em>arXiv e-prints</em>, arXiv:1911.13283, 2019. | + | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a> | |
- | [ <a href="http://arxiv.org/abs/1911.13283">arXiv</a> ] | + | <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] |
</td> | </td> | ||
Line 132: | Line 138: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CLR19">4</a>] | + | [<a name="CLR20a">4</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. | ||
- | On analog quantum algorithms for the mixing of markov chains. | + | Analog quantum algorithms for the mixing of markov chains. |
- | <em>arXiv e-prints</em>, arXiv:1904.11895, 2019. | + | <em>Physical Review A</em>, 102:022423, 2020. |
- | [ <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022423">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] | ||
</td> | </td> | ||
Line 146: | Line 153: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CJR19">5</a>] | + | [<a name="BAKR20">5</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Jean Cardinal, Gwenaël Joret, and Jérémie Roland. | + | Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. |
- | Information-theoretic lower bounds for quantum sorting. | + | Uniqueness of all fundamental noncontextuality inequalities. |
- | <em>arXiv e-prints</em>, arXiv:1902.06473, 2019. | + | <em>Physical Review Research</em>, 2:033010, 2020. |
- | [ <a href="http://arxiv.org/abs/1902.06473">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1103/PhysRevResearch.2.033010">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | ||
</td> | </td> | ||
Line 160: | Line 168: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ARW19">6</a>] | + | [<a name="CLR20b">6</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Atul Singh Arora, Jérémie Roland, and Stephan Weis. | + | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. |
- | Quantum weak coin flipping. | + | How fast do quantum walks mix? |
- | In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages | + | <em>Physical Review Letters</em>, 124(5):050501, 2020. |
- | 205-216, 2019. | + | [ <a href="http://dx.doi.org/10.1103/physrevlett.124.050501">DOI</a> | |
- | [ <a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a> | | + | <a href="http://arxiv.org/abs/2001.06305">arXiv</a> ] |
- | <a href="http://arxiv.org/abs/1811.02984">arXiv</a> ] | + | |
</td> | </td> | ||
Line 176: | Line 183: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BAKR18">7</a>] | + | [<a name="CJR19">7</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. | + | Jean Cardinal, Gwenaël Joret, and Jérémie Roland. |
- | All fundamental non-contextuality inequalities are unique. | + | Information-theoretic lower bounds for quantum sorting. |
- | <em>arXiv e-prints</em>, arXiv:1811.05294, 2018. | + | <em>arXiv e-prints</em>, arXiv:1902.06473, 2019. |
- | [ <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | + | [ <a href="http://arxiv.org/abs/1902.06473">arXiv</a> ] |
</td> | </td> | ||
Line 190: | Line 197: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CNR18">8</a>] | + | [<a name="ARW19">8</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | + | Atul Singh Arora, Jérémie Roland, and Stephan Weis. |
- | Finding a marked node on any graph by continuous time quantum walk. | + | Quantum weak coin flipping. |
- | <em>arXiv e-prints</em>, arXiv:1807.05957, 2018. | + | In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages |
- | [ <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] | + | 205-216, 2019. |
+ | [ <a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1811.02984">arXiv</a> ] | ||
</td> | </td> | ||
Line 880: | Line 889: | ||
</table><hr><p><em>This file was generated by | </table><hr><p><em>This file was generated by | ||
<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p> | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p> | ||
- | |||
- | |||
<!-- Site Meter --> | <!-- Site Meter --> |