Differences

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

--- members:jroland [2013/04/26 16:43]
jroland
+++ members:jroland [2015/03/19 09:57]
jroland [News]
@@ 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 ===
+==== News ====
+  * On May 31, 2015, I will run the 20km of Brussels for [[http://www.medecinsdumonde.be/|Doctors of the World]]. Help me support their action by [[http://www.medecinsdumonde.be/events/20-km-de-bruxelles/j-r-mie_roland|sponsoring my race]].
+  * Any query problem can be solved optimally with bounded error by and adiabatic quantum algorithms, as shown in the article I coauthored with my PhD student Mathieu Brandeho, which was just accepted at [[http://tqc2015.ulb.ac.be|TQC 2015]]. Congratulations to Mathieu for his first accepted article!
+  * Quantum walks can find a marked element on any graph! The original result was obtained in 2010 with my coauthors Hari Krovi, Frédéric Magniez and Maris Ozols, but the full journal article is finally available in Algorithmica: [ [[http://dx.doi.org/10.1007/s00453-015-9979-8|DOI]] | [[http://arxiv.org/abs/1002.2419|arXiv]] ]
+==== 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 36: @@
   * 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)
+  * Examen spécial d'admission en Polytechnique - partie géométrie
+  * Analyse complexe - exercices (MATH-H-201)
+==== Research interests ====
   * Quantum algorithms
   * Quantum walks
   * Adiabatic quantum computation
+  * Quantum query complexity
   * Quantum non-locality
   * Quantum communication complexity
-  * Quantum query complexity
+  * Quantum cryptographic primitives
+==== 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 46: / Line 59: @@
   * Finding is as easy as detecting for quantum walks. [[http://qip2011.quantumlah.org/|14th Workshop on Quantum Information Processing]] (QIP'11) in Singapore, January 8-9, 2011. [{{:members:jroland:walks-qip-presentation-printout.pdf|PDF}} | [[http://qip2011.quantumlah.org/scientificprogramme/movie.php?id=1002.2419|Video]]]
   * Anderson localization and adiabatic quantum optimization. [[http://pctp.princeton.edu/pcts/rareevents/rareevents.html|Workshop on Rare Events in Computational, Financial and Physical Sciences]] at Princeton University (USA), October 21-22, 2010. [{{:members:jroland:talk-rare-events-handout.pdf|PDF}}]
-  * Anderson localization and adiabatic quantum optimization. [[http://www.perimeterinstitute.ca/en/Events/Random_Matrix_Techniques_in_Quantum_Information/Random_Matrix_Techniques_in_Quantum_Information_Theory/|Workshop on Random Matrix Techniques in Quantum Information Theory ]] at Perimeter Institute (Waterloo, Canada), July 4-6, 2010. [ [[http://pirsa.org/10070006/|Video]] ]
+  * Anderson localization and adiabatic quantum optimization. [[http://www.perimeterinstitute.ca/conferences/random-matrix-techniques-quantum-information-theory|Workshop on Random Matrix Techniques in Quantum Information Theory ]] at Perimeter Institute (Waterloo, Canada), July 4-6, 2010. [ [[http://pirsa.org/10070006/|Video]] ]
   * The communication complexity of non-signaling distributions. [[http://membres-liglab.imag.fr/degorre/FounQi/|Workshop on Foundational Principles in Quantum Information]] (FounQI'09) in Grenoble (France), June 15-17, 2009. [{{:members:jroland:non-signalling-seminar-handout.pdf|PDF}}]
   * 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.97
-<!-- This document was automatically generated with bibtex2html 1.96
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
@@ Line 64: / Line 76: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR12">1</a>]
+[<a name="KMOR15">1</a>]
+</td>
+<td class="bibtexitem">
+Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+ Quantum walks can find a marked element on any graph.
+ <em>Algorithmica</em>, 2015.
+ Published online.
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="FJKL+15">2</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">3</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">4</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">5</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">6</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">7</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">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 70: / Line 189: @@
  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 200: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">2</a>]
+[<a name="KLL+12">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 88: / Line 209: @@
  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 218: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">3</a>]
+[<a name="LLR12">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 113: / Line 235: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">4</a>]
+[<a name="LR11">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 129: / Line 251: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">5</a>]
+[<a name="ORR11">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 145: / Line 267: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">6</a>]
+[<a name="GRR11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 162: / Line 284: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">7</a>]
+[<a name="AMRR11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 179: / Line 301: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">8</a>]
+[<a name="dklr11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 194: / Line 316: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">9</a>]
+[<a name="mnrs11-sicomp">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 210: / Line 332: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">10</a>]
+[<a name="kklr11">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 225: / Line 347: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">11</a>]
+[<a name="kor10">18</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 362: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">12</a>]
+[<a name="kmor10">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 257: / Line 379: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">13</a>]
+[<a name="akr10-pnas">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 273: / Line 395: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">14</a>]
+[<a name="kklr09">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 291: / Line 413: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">15</a>]
+[<a name="akr09-arxiv">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 306: / Line 428: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">16</a>]
+[<a name="dklr09">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 323: / Line 445: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">17</a>]
+[<a name="rs09">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 339: / Line 461: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">18</a>]
+[<a name="arc06">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 354: / Line 476: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">19</a>]
+[<a name="dlr06:qudits">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 370: / Line 492: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">20</a>]
+[<a name="mnrs06">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 387: / Line 509: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">21</a>]
+[<a name="ir06">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 402: / Line 524: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">22</a>]
+[<a name="ccmr05:pisa">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 422: / Line 544: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">23</a>]
+[<a name="dr05">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 428: / Line 550: @@
  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 436: / Line 558: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">24</a>]
+[<a name="dlr05">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 451: / Line 573: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">25</a>]
+[<a name="ccmr05:pra">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 468: / Line 590: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">26</a>]
+[<a name="rc05">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 484: / Line 606: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">27</a>]
+[<a name="roland04">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 490: / Line 612: @@
  <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 498: / Line 620: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">28</a>]
+[<a name="rc03b">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 513: / Line 635: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">29</a>]
+[<a name="rc03a">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 528: / Line 650: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">30</a>]
+[<a name="mprg02">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 543: / Line 665: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">31</a>]
+[<a name="rc02">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 558: / Line 680: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">32</a>]
+[<a name="hrb02">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 568: / Line 690: @@
 </td>
 </tr>
-</table><hr><p><em>This file was generated by
+</table>
-<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p>
+<hr><p><em>This file was generated by
+<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>
 <!-- Site Meter -->