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/09/23 10:32]
jroland
members:jroland [2015/02/27 15:42]
jroland [Publications]
Line 8: 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 30: 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 40: 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 54: 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 65: Line 69:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="ORR13">​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>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 79: Line 146:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR13">​2</a>]+[<a name="​LR13">​6</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 93: Line 160:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR13">​3</a>]+[<a name="​MR13">​7</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 100: 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 110: Line 177:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+12">​4</a>]+[<a name="​KLL+12">​8</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 128: Line 195:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLR12">​5</a>]+[<a name="​LLR12">​9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 145: Line 212:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR11">​6</a>]+[<a name="​LR11">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 161: Line 228:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR11">​7</a>]+[<a name="​ORR11">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 177: Line 244:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​GRR11">​8</a>]+[<a name="​GRR11">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 194: Line 261:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​AMRR11">​9</a>]+[<a name="​AMRR11">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 211: Line 278:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr11">​10</a>]+[<a name="​dklr11">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 226: Line 293:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs11-sicomp">​11</a>]+[<a name="​mnrs11-sicomp">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 242: Line 309:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr11">​12</a>]+[<a name="​kklr11">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 257: Line 324:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kor10">​13</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 272: Line 339:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kmor10">​14</a>]+[<a name="​kmor10">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 289: Line 356:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr10-pnas">​15</a>]+[<a name="​akr10-pnas">​19</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 305: Line 372:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr09">​16</a>]+[<a name="​kklr09">​20</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 323: Line 390:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr09-arxiv">​17</a>]+[<a name="​akr09-arxiv">​21</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 338: Line 405:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr09">​18</a>]+[<a name="​dklr09">​22</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 355: Line 422:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rs09">​19</a>]+[<a name="​rs09">​23</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 371: Line 438:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​arc06">​20</a>]+[<a name="​arc06">​24</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 386: Line 453:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr06:​qudits">​21</a>]+[<a name="​dlr06:​qudits">​25</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 402: Line 469:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs06">​22</a>]+[<a name="​mnrs06">​26</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 419: Line 486:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ir06">​23</a>]+[<a name="​ir06">​27</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 434: Line 501:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pisa">​24</a>]+[<a name="​ccmr05:​pisa">​28</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 454: Line 521:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dr05">​25</a>]+[<a name="​dr05">​29</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 460: 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 468: Line 535:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr05">​26</a>]+[<a name="​dlr05">​30</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 483: Line 550:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pra">​27</a>]+[<a name="​ccmr05:​pra">​31</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 500: Line 567:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc05">​28</a>]+[<a name="​rc05">​32</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 516: Line 583:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​roland04">​29</a>]+[<a name="​roland04">​33</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 522: 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 530: Line 597:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03b">​30</a>]+[<a name="​rc03b">​34</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 545: Line 612:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03a">​31</a>]+[<a name="​rc03a">​35</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 560: Line 627:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mprg02">​32</a>]+[<a name="​mprg02">​36</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 575: Line 642:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc02">​33</a>]+[<a name="​rc02">​37</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 590: Line 657:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​hrb02">​34</a>]+[<a name="​hrb02">​38</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 601: 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>​