Differences

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

--- members:jroland [2018/10/03 10:32]
jroland
+++ members:jroland [2020/08/27 15:07]
jroland [Publications]
@@ Line 28: / Line 28: @@
 </html>
-==== Job announcements ====
-A 2-year postdoctoral grant, starting around January 2019, will be available to work on quantum algorithms in the context of the [[http://quantalgo.ulb.be/|QuantAlgo project]] (part of the [[https://www.quantera.eu/|QuantERA ERA-NET Cofund in Quantum Technologies]]). Interested applicants should send me an email with their resume.
 ==== Short biography ====
@@ Line 59: / Line 57: @@
   * Quantum cryptographic primitives
 ==== Selected talks ====
+  * Finding a marked node on any graph by continuous time quantum walk. [[https://www.birs.ca/events/2019/5-day-workshops/19w5146|Quantum Walks and Information Tasks]] in Banff (Canada), April 24, 2019. [{{ :members:jroland:ctqw_search_any_graph-handout.pdf |PDF}} | [[https://www.birs.ca/events/2019/5-day-workshops/19w5146/videos/watch/201904241020-Roland.html|Video]]]
+  * Quantum weak coin flipping. [[https://uwaterloo.ca/institute-for-quantum-computing/|IQC Colloquium at UWaterloo]] (Canada), April 22, 2019. [{{ :members:jroland:iqc-colloquium-04-19-handout.pdf |PDF}} | [[https://youtu.be/2tfUBa0eHuU|Video]]]
   * The quantum query complexity of sorting under partial information. [[https://sites.google.com/site/analysisqit2017/main-events/conference-on-quantum-information-theory|Conference on "Quantum Information Theory"]] at Institut Henri Poincaré (Paris, France), December 11-15,2017. [{{:members:jroland:ihp-quantum-sorting-12-17.pdf |PDF}} | [[https://youtu.be/MjKl80JO2wU|Video]]]
   * A universal adiabatic quantum query algorithm. [[http://www.lorentzcenter.nl/lc/web/2015/724/info.php3?wsid=724&venue=Snellius|Quantum Random Walks and Quantum Algorithms]], Lorentz Center, Leiden (Netherlands), December 11, 2015. [{{:members:jroland:qwalks-leiden-2015-handout.pdf|PDF}}]
@@ Line 75: / Line 75: @@
 ==== Publications ====
 <html>
@@ Line 82: / Line 80: @@
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
-     bibtex2html --no-abstract --nobibsource --nodoc -e dklr10 -e mnrs10-sicomp -e kor09 -e akr09-tr -e MR11 publications.bib  -->
+     bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 publications.bib  -->
@@ Line 89: / Line 87: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLN+18">1</a>]
+[<a name="CNR20a">1</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
+ Finding a marked node on any graph via continuous-time quantum walks.
+ <em>Phys. Rev. A</em>, 102:022227, 2020.
+[&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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CLR20a">2</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Kyle Luh, and J&eacute;r&eacute;mie Roland.
+ Analog quantum algorithms for the mixing of markov chains.
+ <em>Physical Review A</em>, 102:022423, 2020.
+[&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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="BAKR20">3</a>]
+</td>
+<td class="bibtexitem">
+Kishor Bharti, Atul&nbsp;Singh Arora, Leong&nbsp;Chuan Kwek, and J&eacute;r&eacute;mie Roland.
+ Uniqueness of all fundamental noncontextuality inequalities.
+ <em>Physical Review Research</em>, 2:033010, 2020.
+[&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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CNR20b">4</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland.
+ On the optimality of spatial search by continuous-time quantum walk.
+ <em>arXiv e-prints</em>, arXiv:2004.12686, 2020.
+[&nbsp;<a href="http://arxiv.org/abs/2004.12686">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CLR20b">5</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Kyle Luh, and Jérémie Roland.
+ How fast do quantum walks mix?
+ <em>Physical Review Letters</em>, 124(5):050501, 2020.
+[&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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ARV19">6</a>]
+</td>
+<td class="bibtexitem">
+Atul&nbsp;Singh Arora, J&eacute;r&eacute;mie Roland, and Chrysoula Vlachou.
+ Explicit quantum weak coin flipping protocols with arbitrarily small
+  bias.
+ <em>arXiv e-prints</em>, arXiv:1911.13283, 2019.
+[&nbsp;<a href="http://arxiv.org/abs/1911.13283">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CJR19">7</a>]
+</td>
+<td class="bibtexitem">
+Jean Cardinal, Gwena&euml;l Joret, and J&eacute;r&eacute;mie Roland.
+ Information-theoretic lower bounds for quantum sorting.
+ <em>arXiv e-prints</em>, arXiv:1902.06473, 2019.
+[&nbsp;<a href="http://arxiv.org/abs/1902.06473">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ARW19">8</a>]
+</td>
+<td class="bibtexitem">
+Atul&nbsp;Singh Arora, J&eacute;r&eacute;mie Roland, and Stephan Weis.
+ Quantum weak coin flipping.
+ In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages
+-216, 2019.
+[&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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="LLN+18">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 105: / Line 222: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+16">2</a>]
+[<a name="FJKL+16">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 122: / Line 239: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLN+16">3</a>]
+[<a name="LLN+16">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 140: / Line 257: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR15">4</a>]
+[<a name="BR15">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 157: / Line 274: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+15">5</a>]
+[<a name="KLL+15">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 174: / Line 291: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">6</a>]
+[<a name="FJKL+15">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 184: / Line 301: @@
   Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
   Science</em>, pages 506-516. Springer, 2015.
-[&nbsp;<a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a>&nbsp;|
+<a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
 </td>
@@ Line 192: / Line 310: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">7</a>]
+[<a name="KMOR15">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 207: / Line 325: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR15-IJQI">8</a>]
+[<a name="MR15-IJQI">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 224: / Line 342: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">9</a>]
+[<a name="ORR13">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 239: / Line 357: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">10</a>]
+[<a name="LR13">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 254: / Line 372: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">11</a>]
+[<a name="MR13">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 271: / Line 389: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">12</a>]
+[<a name="KLL+12">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 289: / Line 407: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">13</a>]
+[<a name="LLR12">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 306: / Line 424: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">14</a>]
+[<a name="LR11">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 322: / Line 440: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">15</a>]
+[<a name="ORR11">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 338: / Line 456: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">16</a>]
+[<a name="GRR11">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 355: / Line 473: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">17</a>]
+[<a name="AMRR11">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 372: / Line 490: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">18</a>]
+[<a name="dklr11">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 387: / Line 505: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">19</a>]
+[<a name="mnrs11-sicomp">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 403: / Line 521: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">20</a>]
+[<a name="kklr11">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 418: / Line 536: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">21</a>]
+[<a name="kor10">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 434: / Line 552: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">22</a>]
+[<a name="kmor10">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 451: / Line 569: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">23</a>]
+[<a name="akr10-pnas">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 467: / Line 585: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">24</a>]
+[<a name="kklr09">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 485: / Line 603: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">25</a>]
+[<a name="akr09-arxiv">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 500: / Line 618: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">26</a>]
+[<a name="dklr09">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 517: / Line 635: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">27</a>]
+[<a name="rs09">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 533: / Line 651: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">28</a>]
+[<a name="arc06">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 548: / Line 666: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">29</a>]
+[<a name="dlr06:qudits">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 564: / Line 682: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">30</a>]
+[<a name="mnrs06">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 581: / Line 699: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">31</a>]
+[<a name="ir06">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 596: / Line 714: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">32</a>]
+[<a name="ccmr05:pisa">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 616: / Line 734: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">33</a>]
+[<a name="dr05">41</a>]
 </td>
 <td class="bibtexitem">
@@ Line 630: / Line 748: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">34</a>]
+[<a name="dlr05">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 645: / Line 763: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">35</a>]
+[<a name="ccmr05:pra">43</a>]
 </td>
 <td class="bibtexitem">
@@ Line 662: / Line 780: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">36</a>]
+[<a name="rc05">44</a>]
 </td>
 <td class="bibtexitem">
@@ Line 678: / Line 796: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">37</a>]
+[<a name="roland04">45</a>]
 </td>
 <td class="bibtexitem">
@@ Line 692: / Line 810: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">38</a>]
+[<a name="rc03b">46</a>]
 </td>
 <td class="bibtexitem">
@@ Line 707: / Line 825: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">39</a>]
+[<a name="rc03a">47</a>]
 </td>
 <td class="bibtexitem">
@@ Line 722: / Line 840: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">40</a>]
+[<a name="mprg02">48</a>]
 </td>
 <td class="bibtexitem">
@@ Line 737: / Line 855: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">41</a>]
+[<a name="rc02">49</a>]
 </td>
 <td class="bibtexitem">
@@ Line 752: / Line 870: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">42</a>]
+[<a name="hrb02">50</a>]
 </td>
 <td class="bibtexitem">
@@ Line 764: / Line 882: @@
 </table><hr><p><em>This file was generated by
 <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p>