Differences

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

--- members:jroland [2013/06/21 17:58]
jroland
+++ members:jroland [2015/04/15 10:19]
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: @@
 |}
+==== News ====
+  * From May 20 to 22, 2015, Stefano Pironio and I organize the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) in Brussels. More information [[http://tqc2015.ulb.ac.be|here]].
+  * 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]].
+  * How to separate information and communication complexities? My joint paper with (too many coauthors to list!), which was accepted at [[http://www.kurims.kyoto-u.ac.jp/icalp2015/|ICALP 2015]], takes a fresh look at this problem.
+  * Any query problem can be solved optimally with bounded error by an adiabatic quantum algorithm, as shown in the article I coauthored with my PhD student Mathieu Brandeho, which was 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.
@@ Line 30: / Line 37: @@
   * 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 60: @@
   * 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 77: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">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">
@@ Line 78: / Line 184: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">2</a>]
+[<a name="MR13">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 85: / Line 191: @@
   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 95: / Line 201: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">3</a>]
+[<a name="KLL+12">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 113: / Line 219: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">4</a>]
+[<a name="LLR12">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 130: / Line 236: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">5</a>]
+[<a name="LR11">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 146: / Line 252: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">6</a>]
+[<a name="ORR11">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 162: / Line 268: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">7</a>]
+[<a name="GRR11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 179: / Line 285: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">8</a>]
+[<a name="AMRR11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 196: / Line 302: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">9</a>]
+[<a name="dklr11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 211: / Line 317: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">10</a>]
+[<a name="mnrs11-sicomp">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 227: / Line 333: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">11</a>]
+[<a name="kklr11">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 242: / Line 348: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">12</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 257: / Line 363: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">13</a>]
+[<a name="kmor10">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 274: / Line 380: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">14</a>]
+[<a name="akr10-pnas">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 290: / Line 396: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">15</a>]
+[<a name="kklr09">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 308: / Line 414: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">16</a>]
+[<a name="akr09-arxiv">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 323: / Line 429: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">17</a>]
+[<a name="dklr09">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 340: / Line 446: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">18</a>]
+[<a name="rs09">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 356: / Line 462: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">19</a>]
+[<a name="arc06">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 371: / Line 477: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">20</a>]
+[<a name="dlr06:qudits">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 387: / Line 493: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">21</a>]
+[<a name="mnrs06">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 404: / Line 510: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">22</a>]
+[<a name="ir06">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 419: / Line 525: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">23</a>]
+[<a name="ccmr05:pisa">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 439: / Line 545: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">24</a>]
+[<a name="dr05">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 445: / Line 551: @@
  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 453: / Line 559: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">25</a>]
+[<a name="dlr05">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 468: / Line 574: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">26</a>]
+[<a name="ccmr05:pra">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 485: / Line 591: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">27</a>]
+[<a name="rc05">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 501: / Line 607: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">28</a>]
+[<a name="roland04">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 507: / Line 613: @@
  <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 515: / Line 621: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">29</a>]
+[<a name="rc03b">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 530: / Line 636: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">30</a>]
+[<a name="rc03a">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 545: / Line 651: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">31</a>]
+[<a name="mprg02">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 560: / Line 666: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">32</a>]
+[<a name="rc02">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 575: / Line 681: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">33</a>]
+[<a name="hrb02">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 585: / Line 691: @@
 </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>