Differences

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

--- members:jroland [2014/07/29 19:10]
jroland
+++ members:jroland [2015/03/05 09:45]
jroland [Research interests]
@@ Line 8: / Line 8: @@
 | style="width:541px;"| jroland (at) ulb.ac.be
 |-
 ! Phone:
 | +32-2-650-28-75
 |-
@@ Line 34: / Line 34: @@
   * Compléments de programmation et d'algorithmique (INFO-H-304)
   * Quantum information and computation (INFO-H-514)
+  * Examen spécial d'admission en Polytechnique - partie géométrie
+  * Analyse complexe - exercices (MATH-H-201)
 ==== Research interests ====
@@ Line 39: / Line 41: @@
   * Quantum walks
   * Adiabatic quantum computation
+  * Quantum query complexity
   * Quantum non-locality
   * Quantum communication complexity
-  * Quantum query complexity
+  * Quantum cryptographic primitives
 ==== 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:quawag-grenoble-presentation-handout.pdf|PDF}}]
+  * 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 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 59: / Line 61: @@
 <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/),
      with the following command:
@@ Line 70: / Line 71: @@
 <tr valign="top">
 <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 class="bibtexitem">
@@ Line 84: / Line 148: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">2</a>]
+[<a name="LR13">6</a>]
 </td>
 <td class="bibtexitem">
@@ Line 98: / Line 162: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">3</a>]
+[<a name="MR13">7</a>]
 </td>
 <td class="bibtexitem">
@@ Line 105: / Line 169: @@
   query complexity.
  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;|
 <a href="http://arxiv.org/abs/1209.2713">arXiv</a>&nbsp;]
@@ Line 115: / Line 179: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">4</a>]
+[<a name="KLL+12">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 133: / Line 197: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">5</a>]
+[<a name="LLR12">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 150: / Line 214: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">6</a>]
+[<a name="LR11">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 166: / Line 230: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">7</a>]
+[<a name="ORR11">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 182: / Line 246: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">8</a>]
+[<a name="GRR11">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 199: / Line 263: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">9</a>]
+[<a name="AMRR11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 216: / Line 280: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">10</a>]
+[<a name="dklr11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 231: / Line 295: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">11</a>]
+[<a name="mnrs11-sicomp">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 247: / Line 311: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">12</a>]
+[<a name="kklr11">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 262: / Line 326: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">13</a>]
+[<a name="kor10">17</a>]
 </td>
 <td class="bibtexitem">
 Hari Krovi, Maris Ozols, and J&eacute;r&eacute;mie Roland.
  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;|
 <a href="http://arxiv.org/abs/1004.2721">arXiv</a>&nbsp;]
@@ Line 277: / Line 341: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">14</a>]
+[<a name="kmor10">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 294: / Line 358: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">15</a>]
+[<a name="akr10-pnas">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 310: / Line 374: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">16</a>]
+[<a name="kklr09">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 328: / Line 392: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">17</a>]
+[<a name="akr09-arxiv">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 343: / Line 407: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">18</a>]
+[<a name="dklr09">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 360: / Line 424: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">19</a>]
+[<a name="rs09">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 376: / Line 440: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">20</a>]
+[<a name="arc06">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 391: / Line 455: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">21</a>]
+[<a name="dlr06:qudits">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 407: / Line 471: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">22</a>]
+[<a name="mnrs06">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 424: / Line 488: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">23</a>]
+[<a name="ir06">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 439: / Line 503: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">24</a>]
+[<a name="ccmr05:pisa">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 459: / Line 523: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">25</a>]
+[<a name="dr05">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 465: / Line 529: @@
  An intuitive approach for the simulation of quantum correlations.
  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>
@@ Line 473: / Line 537: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">26</a>]
+[<a name="dlr05">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 488: / Line 552: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">27</a>]
+[<a name="ccmr05:pra">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 505: / Line 569: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">28</a>]
+[<a name="rc05">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 521: / Line 585: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">29</a>]
+[<a name="roland04">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 527: / Line 591: @@
  <em>Adiabatic Quantum Computation</em>.
  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>
@@ Line 535: / Line 599: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">30</a>]
+[<a name="rc03b">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 550: / Line 614: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">31</a>]
+[<a name="rc03a">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 565: / Line 629: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">32</a>]
+[<a name="mprg02">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 580: / Line 644: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">33</a>]
+[<a name="rc02">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 595: / Line 659: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">34</a>]
+[<a name="hrb02">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 606: / Line 670: @@
 </tr>
 </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>