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 [2013/06/21 17:58]
jroland
members:jroland [2015/02/27 15:42]
jroland [Publications]
Line 1: Line 1:
 +~~NOTOC~~
 ====== Jérémie Roland ====== ====== Jérémie Roland ======
  
Line 7: Line 8:
 | style="​width:​541px;"​| jroland (at) ulb.ac.be | style="​width:​541px;"​| jroland (at) ulb.ac.be
 |- |-
-! Phone: ​+! Phone:
 | +32-2-650-28-75 | +32-2-650-28-75
 |- |-
Line 29: Line 30:
   * From January to May 2008, he was a Postdoctoral Researcher of the Belgian [[http://​www.frs-fnrs.be/​|FNRS]],​ based at the University of Brussels. ​   * From January to May 2008, he was a Postdoctoral Researcher of the Belgian [[http://​www.frs-fnrs.be/​|FNRS]],​ based at the University of Brussels. ​
   * From May 2008 to August 2011, he was a Research Staff Member at [[http://​www.nec-labs.com/​|NEC Laboratories America]]. ​   * From May 2008 to August 2011, he was a Research Staff Member at [[http://​www.nec-labs.com/​|NEC Laboratories America]]. ​
 +
 +==== Teaching ====
 +  * Compléments de programmation et d'​algorithmique (INFO-H-304)
 +  * Quantum information and computation (INFO-H-514)
  
 ==== Research interests ==== ==== Research interests ====
Line 39: Line 44:
  
 ==== Selected talks ==== ==== Selected talks ====
 +  * Quantum algorithms based on quantum walks. [[https://​uwaterloo.ca/​institute-for-quantum-computing/​|IQC Colloquium at UWaterloo]] (Canada), July 28, 2014. [{{:​members:​jroland:​IQC-colloquium-08-2014-handout.pdf|PDF}}]
   * Quantum query complexity: Adversaries,​ polynomials and direct product theorems. [[http://​www.maths.bris.ac.uk/​~maowg/​q-alg-2013/​q-alg-2013.html|The 3rd Heilbronn Quantum Algorithms Day]] in Bristol (UK), April 25, 2013. [{{:​members:​jroland:​bristol-algorithm-day-2013-handout.pdf|PDF}}]   * Quantum query complexity: Adversaries,​ polynomials and direct product theorems. [[http://​www.maths.bris.ac.uk/​~maowg/​q-alg-2013/​q-alg-2013.html|The 3rd Heilbronn Quantum Algorithms Day]] in Bristol (UK), April 25, 2013. [{{:​members:​jroland:​bristol-algorithm-day-2013-handout.pdf|PDF}}]
   * Quantum algorithms based on quantum walks. [[http://​www-fourier.ujf-grenoble.fr/​~joye/​quawag/​QuaWaG/​|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:​members:​jroland:​quawag-grenoble-presentation-handout.pdf|PDF}}]   * Quantum algorithms based on quantum walks. [[http://​www-fourier.ujf-grenoble.fr/​~joye/​quawag/​QuaWaG/​|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:​members:​jroland:​quawag-grenoble-presentation-handout.pdf|PDF}}]
Line 53: Line 59:
 <​html>​ <​html>​
  
- +<!-- This document was automatically generated with bibtex2html 1.97
-<!-- This document was automatically generated with bibtex2html 1.96+
      (see http://​www.lri.fr/​~filliatr/​bibtex2html/​),​      (see http://​www.lri.fr/​~filliatr/​bibtex2html/​),​
      with the following command:      with the following command:
Line 64: Line 69:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="LR13">​1</​a>​]+[<a name="FJKL+15">1</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Lauri&​egrave;​re,​ Sophie 
 +  Laplante, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Relative Discrepancy does not separate Information and Communication 
 +  Complexity. 
 + <​em>​Electronic Colloquium on Computational Complexity</​em>,​ 28, 2015. 
 +[&​nbsp;<​a href="​http://​eccc.hpi-web.de/​report/​2015/​028/">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​BR14">​2</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Mathieu Brandeho and J&​eacute;​r&​eacute;​mie Roland. 
 + A universal adiabatic quantum query algorithm. 
 + <​em>​arXiv preprint arXiv:​1409.3558</​em>,​ 2014. 
 +[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1409.3558">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​KLL+14">​3</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&​eacute;​r&​eacute;​mie Roland, 
 +  and David Xiao. 
 + Lower bounds on information complexity via zero-communication 
 +  protocols and applications. 
 + <​em>​SIAM Journal on Computing</​em>,​ 2014. 
 + To appear. 
 +[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​MR13-IJQI">​4</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Lo&​iuml;​ck Magnin and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Explicit relation between all lower bound techniques for quantum 
 +  query complexity. 
 + <​em>​International Journal of Quantum Information</​em>,​ 2013. 
 + ​Online ready. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1142/​S0219749913500597">​DOI</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​ORR13">​5</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Maris Ozols, Martin Roetteler, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Quantum rejection sampling. 
 + <​em>​ACM Transactions on Computation Theory</​em>,​ 5(3):​11:​1-11:​33,​ 2013. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2493252.2493256">​DOI</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​LR13">​6</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 78: Line 160:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR13">​2</a>]+[<a name="​MR13">​7</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 85: Line 167:
   query complexity.   query complexity.
  In <​em>​30th International Symposium on Theoretical Aspects of  In <​em>​30th International Symposium on Theoretical Aspects of
-  Computer Science (STACS'​13)</​em>​, number arXiv:​1209.2713, pages 434-445, 2013.+  Computer Science (STACS'​13)</​em>,​ pages 434-445, 2013.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.STACS.2013.434">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.STACS.2013.434">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1209.2713">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1209.2713">​arXiv</​a>&​nbsp;​]
Line 95: Line 177:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+12">​3</a>]+[<a name="​KLL+12">​8</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 113: Line 195:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLR12">​4</a>]+[<a name="​LLR12">​9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 130: Line 212:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR11">​5</a>]+[<a name="​LR11">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 146: Line 228:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR11">​6</a>]+[<a name="​ORR11">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 162: Line 244:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​GRR11">​7</a>]+[<a name="​GRR11">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 179: Line 261:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​AMRR11">​8</a>]+[<a name="​AMRR11">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 196: Line 278:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr11">​9</a>]+[<a name="​dklr11">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 211: Line 293:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs11-sicomp">​10</a>]+[<a name="​mnrs11-sicomp">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 227: Line 309:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr11">​11</a>]+[<a name="​kklr11">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 242: Line 324:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kor10">​12</a>]+[<a name="​kor10">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Hari Krovi, Maris Ozols, and J&​eacute;​r&​eacute;​mie Roland. Hari Krovi, Maris Ozols, and J&​eacute;​r&​eacute;​mie Roland.
  ​Adiabatic condition and the quantum hitting time of Markov chains.  ​Adiabatic condition and the quantum hitting time of Markov chains.
- <em><​em>​Physical Review A</em></​em>,​ 82(2):​022333,​ 2010.+ <​em>​Physical Review A</​em>,​ 82(2):​022333,​ 2010.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevA.82.022333">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevA.82.022333">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1004.2721">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1004.2721">​arXiv</​a>&​nbsp;​]
Line 257: Line 339:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kmor10">​13</a>]+[<a name="​kmor10">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 274: Line 356:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr10-pnas">​14</a>]+[<a name="​akr10-pnas">​19</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 290: Line 372:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr09">​15</a>]+[<a name="​kklr09">​20</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 308: Line 390:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr09-arxiv">​16</a>]+[<a name="​akr09-arxiv">​21</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 323: Line 405:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr09">​17</a>]+[<a name="​dklr09">​22</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 340: Line 422:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rs09">​18</a>]+[<a name="​rs09">​23</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 356: Line 438:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​arc06">​19</a>]+[<a name="​arc06">​24</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 371: Line 453:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr06:​qudits">​20</a>]+[<a name="​dlr06:​qudits">​25</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 387: Line 469:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs06">​21</a>]+[<a name="​mnrs06">​26</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 404: Line 486:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ir06">​22</a>]+[<a name="​ir06">​27</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 419: Line 501:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pisa">​23</a>]+[<a name="​ccmr05:​pisa">​28</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 439: Line 521:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dr05">​24</a>]+[<a name="​dr05">​29</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 445: Line 527:
  An intuitive approach for the simulation of quantum correlations.  An intuitive approach for the simulation of quantum correlations.
  In <​em>​26th Symposium on Information Theory in the Benelux</​em>,​ 2005.  In <​em>​26th Symposium on Information Theory in the Benelux</​em>,​ 2005.
-[&​nbsp;<​a href="/​~jroland/​publications/​2005-Proc-IT05.pdf">​.pdf</​a>&​nbsp;​]+[&​nbsp;<​a href="/​_media/​members/​jroland/​publications/​2005-proc-it05.pdf">​.pdf</​a>&​nbsp;​]
  
 </td> </td>
Line 453: Line 535:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr05">​25</a>]+[<a name="​dlr05">​30</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 468: Line 550:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pra">​26</a>]+[<a name="​ccmr05:​pra">​31</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 485: Line 567:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc05">​27</a>]+[<a name="​rc05">​32</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 501: Line 583:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​roland04">​28</a>]+[<a name="​roland04">​33</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 507: Line 589:
  <​em>​Adiabatic Quantum Computation</​em>​.  <​em>​Adiabatic Quantum Computation</​em>​.
  PhD thesis, Universit&​eacute;​ Libre de Bruxelles, 2004.  PhD thesis, Universit&​eacute;​ Libre de Bruxelles, 2004.
-[&​nbsp;<​a href="/​~jroland/publications/2004-Thesis-Adiabatic\_Quantum\_Computation.pdf">​.pdf</​a>&​nbsp;​]+[&​nbsp;<​a href="/​_media/members/​jroland/2004-thesis.pdf">​.pdf</​a>&​nbsp;​]
  
 </td> </td>
Line 515: Line 597:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03b">​29</a>]+[<a name="​rc03b">​34</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 530: Line 612:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03a">​30</a>]+[<a name="​rc03a">​35</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 545: Line 627:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mprg02">​31</a>]+[<a name="​mprg02">​36</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 560: Line 642:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc02">​32</a>]+[<a name="​rc02">​37</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 575: Line 657:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​hrb02">​33</a>]+[<a name="​hrb02">​38</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 586: Line 668:
 </tr> </tr>
 </​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.97.</​em></​p>​