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 [2020/08/27 15:07]
jroland [Publications]
Line 75: Line 75:
 ==== Publications ==== ==== Publications ====
 <​html>​ <​html>​
- 
  
  
Line 88: Line 87:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="CNR20">​1</​a>​]+[<a name="CNR20a">​1</​a>​]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Shantanav Chakraborty,​ Leonardo Novo, and Jérémie ​Roland. +Shantanav Chakraborty,​ Leonardo Novo, and J&​eacute;​r&​eacute;​mie ​Roland. 
- On the optimality of spatial search by continuous-time quantum ​walk+ Finding a marked node on any graph via continuous-time quantum ​walks
- <​em>​arXiv e-prints</​em>, ​arXiv:2004.12686, 2020. + <​em>​Phys. Rev. A</​em>, ​102:022227, 2020. 
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​2004.12686">​arXiv</​a>&​nbsp;​]+[&nbsp;<a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.022227">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1807.05957">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 102: Line 102:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="CLR20">​2</​a>​]+[<a name="CLR20a">​2</​a>​]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Shantanav Chakraborty,​ Kyle Luh, and Jérémie ​Roland. +Shantanav Chakraborty,​ Kyle Luh, and J&​eacute;​r&​eacute;​mie ​Roland. 
- How fast do quantum ​walks mix? + Analog ​quantum ​algorithms for the mixing of markov chains. 
- <​em>​Physical Review ​Letters</​em>, ​124(5):050501, 2020. + <​em>​Physical Review ​A</​em>, ​102:022423, 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.022423">​DOI</​a>&​nbsp;​|  
-<a href="​http://​arxiv.org/​abs/​2001.06305">​arXiv</​a>&​nbsp;​]+<a href="​http://​arxiv.org/​abs/​1904.11895">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 117: Line 117:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="ARV19">​3</​a>​]+[<a name="BAKR20">​3</​a>​]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Atul&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​mie Roland, and Chrysoula Vlachou+Kishor Bharti, ​Atul&​nbsp;​Singh Arora, ​Leong&​nbsp;​Chuan Kwek, and J&​eacute;​r&​eacute;​mie Roland. 
- Explicit quantum weak coin flipping protocols with arbitrarily small + Uniqueness of all fundamental noncontextuality inequalities
-  bias+ <​em>​Physical Review Research</​em>, ​2:0330102020
- <​em>​arXiv e-prints</​em>, ​arXiv:1911.132832019+[&nbsp;<a href="​http://​dx.doi.org/​10.1103/​PhysRevResearch.2.033010">​DOI</​a>&​nbsp;​|  
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​]+<a href="​http://​arxiv.org/​abs/​1811.05294">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 132: Line 132:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="CLR19">​4</​a>​]+[<a name="CNR20b">​4</​a>​]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Shantanav Chakraborty, ​Kyle Luh, and J&​eacute;​r&​eacute;​mie ​Roland. +Shantanav Chakraborty, ​Leonardo Novo, and Jérémie ​Roland. 
- ​On ​analog quantum algorithms for the mixing ​of markov chains+ On the optimality ​of spatial search by continuous-time quantum walk
- <​em>​arXiv e-prints</​em>,​ arXiv:1904.118952019+ <​em>​arXiv e-prints</​em>,​ arXiv:2004.126862020
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1904.11895">​arXiv</​a>&​nbsp;​]+[&​nbsp;<​a href="​http://​arxiv.org/​abs/​2004.12686">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 146: Line 146:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="CJR19">​5</​a>​]+[<a name="CLR20b">​5</​a>​]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Jean CardinalGwena&​euml;​l Joret, and J&​eacute;​r&​eacute;​mie ​Roland. +Shantanav ChakrabortyKyle Luh, and Jérémie ​Roland. 
- Information-theoretic lower bounds for quantum ​sorting. + How fast do quantum ​walks mix? 
- <​em>​arXiv e-prints</​em>, ​arXiv:1902.064732019+ <​em>​Physical Review Letters</​em>, ​124(5):0505012020
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1902.06473">​arXiv</​a>&​nbsp;​]+[&nbsp;<a href="​http://​dx.doi.org/​10.1103/​physrevlett.124.050501">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​2001.06305">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 160: Line 161:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="ARW19">​6</​a>​]+[<a name="ARV19">​6</​a>​]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Atul&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​mie Roland, and Stephan Weis+Atul&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​mie Roland, and Chrysoula Vlachou
- Quantum ​weak coin flipping. + Explicit quantum ​weak coin flipping ​protocols with arbitrarily small 
- In <em>51st ACM Symposium on Theory of Computing (STOC'​19)</​em>, ​pages +  bias
-  205-216, 2019. + <​em>​arXiv e-prints</​em>, ​arXiv:​1911.13283, 2019. 
-[&nbsp;<a href="​http://​dx.doi.org/​10.1145/​3313276.3316306">​DOI</​a>&​nbsp;​|  +[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​]
-<a href="​http://​arxiv.org/​abs/​1811.02984">​arXiv</​a>&​nbsp;​]+
  
 </td> </td>
Line 176: Line 176:
 <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 190:
 <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 882:
 </​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>​
-