iweb visitor

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

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/05/17 17:27]
jroland [Jérémie Roland]
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 88: Line 88:
 <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 ChakrabortyLeonardo Novo, and Jérémie Roland+Atul&​nbsp;​Singh AroraJ&​eacute;​r&​eacute;​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.126862020+  bias
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​2004.12686">​arXiv</​a>&​nbsp;​]+ In <em>Proceedings of the 2021 ACM-SIAM Symposium on Discrete 
 +  Algorithms (SODA)</​em>, ​pages 919-9382021
 +[&nbsp;<a href="​http://​dx.doi.org/​10.1137/​1.9781611976465.58">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 102: Line 105:
 <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&​eacute;​r&​eacute;​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. 
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​physrevlett.124.050501">​DOI</​a>&​nbsp;​|  +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.032214">​DOI</​a>&​nbsp;​|  
-<a href="​http://​arxiv.org/​abs/​2001.06305">​arXiv</​a>&​nbsp;​]+<a href="​http://​arxiv.org/​abs/​2004.12686">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 117: Line 120:
 <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&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​mie Roland, and Chrysoula Vlachou+Shantanav ChakrabortyLeonardo Novo, and J&​eacute;​r&​eacute;​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:0222272020
- <​em>​arXiv e-prints</​em>, ​arXiv:1911.132832019+[&nbsp;<a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.022227">​DOI</​a>&​nbsp;​|  
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​]+<a href="​http://​arxiv.org/​abs/​1807.05957">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 132: Line 135:
 <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&​eacute;​r&​eacute;​mie Roland. Shantanav Chakraborty,​ Kyle Luh, and J&​eacute;​r&​eacute;​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.118952019+ <​em>​Physical Review A</​em>, ​102:0224232020
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1904.11895">​arXiv</​a>&​nbsp;​]+[&nbsp;<a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.022423">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1904.11895">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 146: Line 150:
 <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 CardinalGwena&euml;l Joret, and J&​eacute;​r&​eacute;​mie Roland. +Kishor BhartiAtul&nbsp;Singh Arora, Leong&​nbsp;Chuan Kwek, and J&​eacute;​r&​eacute;​mie Roland. 
- Information-theoretic lower bounds for quantum sorting+ Uniqueness of all fundamental noncontextuality inequalities
- <​em>​arXiv e-prints</​em>, ​arXiv:1902.064732019+ <​em>​Physical Review Research</​em>, ​2:0330102020
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1902.06473">​arXiv</​a>&​nbsp;​]+[&nbsp;<a href="​http://​dx.doi.org/​10.1103/​PhysRevResearch.2.033010">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1811.05294">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 160: Line 165:
 <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&​nbsp;​Singh AroraJ&​eacute;​r&​eacute;​mie Roland, and Stephan Weis+Shantanav ChakrabortyKyle 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):​0505012020
-  205-2162019+[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/physrevlett.124.050501">​DOI</​a>&​nbsp;​|  
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/3313276.3316306">​DOI</​a>&​nbsp;​|  +<a href="​http://​arxiv.org/​abs/​2001.06305">​arXiv</​a>&​nbsp;​]
-<a href="​http://​arxiv.org/​abs/​1811.02984">​arXiv</​a>&​nbsp;​]+
  
 </td> </td>
Line 176: Line 180:
 <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 BhartiAtul&nbsp;Singh Arora, Leong&​nbsp;Chuan Kwek, and J&​eacute;​r&​eacute;​mie Roland. +Jean CardinalGwena&euml;l Joret, and J&​eacute;​r&​eacute;​mie Roland. 
- All fundamental non-contextuality inequalities are unique+ Information-theoretic lower bounds for quantum sorting
- <​em>​arXiv e-prints</​em>,​ arXiv:1811.052942018+ <​em>​arXiv e-prints</​em>,​ arXiv:1902.064732019
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1811.05294">​arXiv</​a>&​nbsp;​]+[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1902.06473">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 190: Line 194:
 <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 ChakrabortyLeonardo Novo, and J&​eacute;​r&​eacute;​mie Roland. +Atul&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​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.059572018+ In <em>51st ACM Symposium on Theory of Computing (STOC'​19)</​em>, ​pages 
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1807.05957">​arXiv</​a>&​nbsp;​]+  205-2162019
 +[&nbsp;<a href="​http://​dx.doi.org/​10.1145/​3313276.3316306">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1811.02984">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 880: Line 886:
 </​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 -->