Differences

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

--- members:jroland [2013/04/26 16:43]
jroland
+++ members:jroland [2014/11/14 16:13]
jroland [Publications]
@@ Line 1: / Line 1: @@
+~~NOTOC~~
 ====== Jérémie Roland ======
@@ Line 7: / Line 8: @@
 | style="width:541px;"| jroland (at) ulb.ac.be
 |-
 ! Phone:
 | +32-2-650-28-75
 |-
@@ Line 17: / Line 18: @@
 |}
-=== Short biography ===
+==== Short biography ====
   * Born in Brussels in 1976.
   * In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB).
@@ Line 30: / Line 31: @@
   * From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]].
-=== Research interests ===
+==== Teaching ====
+  * Compléments de programmation et d'algorithmique (INFO-H-304)
+  * Quantum information and computation (INFO-H-514)
+==== Research interests ====
   * Quantum algorithms
   * Quantum walks
@@ Line 38: / Line 43: @@
   * Quantum query complexity
-=== 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 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 50: / Line 56: @@
   * Search via quantum walk. [[http://www2.research.att.com/~dsj/stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'07) in San Diego (USA), June 11-13, 2007. [{{:members:jroland:stoc-presentation.pdf|PDF}}]
-=== Publications ===
+==== Publications ====
 <html>
-<!-- This document was automatically generated with bibtex2html 1.96
+<!-- This document was automatically generated with bibtex2html 1.97
      (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 publications.bib  -->
+     export TMPDIR=. && bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr publications.bib  -->
@@ Line 64: / Line 70: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR12">1</a>]
+[<a name="brandeho2014optimal">1</a>]
+</td>
+<td class="bibtexitem">
+Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
+ An optimal 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">2</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="LR14">3</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>, 2014.
+ 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">4</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">5</a>]
+</td>
+<td class="bibtexitem">
+Troy Lee and Jérémie Roland.
+ A strong direct product theorem for quantum query complexity.
+ <em>Computational Complexity</em>, 22(2):429-462, 2013.
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="MR13">6</a>]
 </td>
 <td class="bibtexitem">
@@ Line 70: / Line 151: @@
  Explicit relation between all lower bound techniques for quantum
   query complexity.
-In <em> 30th International Symposium on Theoretical Aspects of Computer Science (STACS'13)</em>, pages 434-445, 2013.
+ In <em>30th International Symposium on Theoretical Aspects of
-[&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;]
+  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;]
 </td>
@@ Line 79: / Line 162: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">2</a>]
+[<a name="KLL+12">7</a>]
 </td>
 <td class="bibtexitem">
@@ Line 88: / Line 171: @@
  In <em>53rd Annual IEEE Symposium on Foundations of Computer Science
   (FOCS'12)</em>, pages 500-509, 2012.
-[&nbsp;<a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a>&nbsp;|<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
 </td>
@@ Line 96: / Line 180: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">3</a>]
+[<a name="LLR12">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 113: / Line 197: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">4</a>]
+[<a name="LR11">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 129: / Line 213: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">5</a>]
+[<a name="ORR11">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 145: / Line 229: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">6</a>]
+[<a name="GRR11">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 162: / Line 246: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">7</a>]
+[<a name="AMRR11">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 179: / Line 263: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">8</a>]
+[<a name="dklr11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 194: / Line 278: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">9</a>]
+[<a name="mnrs11-sicomp">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 210: / Line 294: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">10</a>]
+[<a name="kklr11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 225: / Line 309: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">11</a>]
+[<a name="kor10">16</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 240: / Line 324: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">12</a>]
+[<a name="kmor10">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 257: / Line 341: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">13</a>]
+[<a name="akr10-pnas">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 273: / Line 357: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">14</a>]
+[<a name="kklr09">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 291: / Line 375: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">15</a>]
+[<a name="akr09-arxiv">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 306: / Line 390: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">16</a>]
+[<a name="dklr09">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 323: / Line 407: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">17</a>]
+[<a name="rs09">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 339: / Line 423: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">18</a>]
+[<a name="arc06">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 354: / Line 438: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">19</a>]
+[<a name="dlr06:qudits">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 370: / Line 454: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">20</a>]
+[<a name="mnrs06">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 387: / Line 471: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">21</a>]
+[<a name="ir06">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 402: / Line 486: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">22</a>]
+[<a name="ccmr05:pisa">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 422: / Line 506: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">23</a>]
+[<a name="dr05">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 428: / Line 512: @@
  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="~jroland/2005-proc-it05.pdf">.pdf</a>&nbsp;]
 </td>
@@ Line 436: / Line 520: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">24</a>]
+[<a name="dlr05">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 451: / Line 535: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">25</a>]
+[<a name="ccmr05:pra">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 468: / Line 552: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">26</a>]
+[<a name="rc05">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 484: / Line 568: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">27</a>]
+[<a name="roland04">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 498: / Line 582: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">28</a>]
+[<a name="rc03b">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 513: / Line 597: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">29</a>]
+[<a name="rc03a">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 528: / Line 612: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">30</a>]
+[<a name="mprg02">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 543: / Line 627: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">31</a>]
+[<a name="rc02">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 558: / Line 642: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">32</a>]
+[<a name="hrb02">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 569: / Line 653: @@
 </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>
 <!-- Site Meter -->