Differences

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

--- members:jroland [2014/11/14 16:18]
jroland [Publications]
+++ members:jroland [2015/11/04 10:00]
jroland [Teaching]
@@ Line 18: / 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 complexity? 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: [ [[http://eccc.hpi-web.de/report/2015/028/|http]] ]
+  * 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! [ [[http://arxiv.org/abs/1409.3558|arXiv]] ]
+  * 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 26: / Line 32: @@
   * From 2000 to 2004, he did a PhD thesis at QuIC, where he also worked as a teaching assistant for courses of information theory and quantum physics.
   * From 2004 to 2006, he held a postdoctoral position at the [[http://www.lri.fr/algo/|Laboratoire de Recherche en Informatique]] in Orsay, France.
-  * From 2006, he was a Postdoctoral Researcher of the Belgian [[http://www.frs-fnrs.be/|FNRS]], based at the University of Brussels.
   * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]].
   * 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.
@@ Line 33: / Line 38: @@
 ==== Teaching ====
   * Compléments de programmation et d'algorithmique (INFO-H-304)
-  * Quantum information and computation (INFO-H-514)
+  * Quantum information and computation (INFO-H-514) - partim: Quantum computation
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory
+  * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
+  * Analyse complexe (MATH-H-201) - partim: Exercices
+  * Examen spécial d'admission en Polytechnique - Géométrie
 ==== 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 ====
   * 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}}]
@@ Line 52: / 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}}]
@@ Line 58: / Line 66: @@
 ==== Publications ====
 <html>
 <!-- This document was automatically generated with bibtex2html 1.97
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
-     export TMPDIR=. && bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr publications.bib  -->
+     bibtex2html --no-abstract --nobibsource --nodoc -e dklr10 -e mnrs10-sicomp -e kor09 -e akr09-tr publications.bib  -->
@@ Line 70: / Line 77: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="brandeho2014optimal">1</a>]
+[<a name="FJKL+15">1</a>]
+</td>
+<td class="bibtexitem">
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
+  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
+ Relative Discrepancy does not separate Information and Communication
+  Complexity.
+ In <em>42nd International Colloquium on Automata, Languages and
+  Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
+  Science</em>, pages 506-516. Springer, 2015.
+[&nbsp;<a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a>&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.
- An optimal adiabatic quantum query algorithm.
+ A universal adiabatic quantum query algorithm.
- <em>arXiv preprint arXiv:1409.3558</em>, 2014.
+ In <em>10th Conference on the Theory of Quantum Computation,
+  Communication and Cryptography (TQC'15)</em>, 2015.
+ To appear.
 [&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
@@ Line 84: / Line 111: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">2</a>]
+[<a name="KLL+14">3</a>]
 </td>
 <td class="bibtexitem">
@@ Line 91: / Line 118: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 2014.
+ <em>SIAM Journal on Computing</em>, 2015.
  To appear.
 [&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
@@ Line 101: / Line 128: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR14">3</a>]
+[<a name="KMOR15">4</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="MR13-IJQI">5</a>]
 </td>
 <td class="bibtexitem">
@@ Line 107: / Line 152: @@
  Explicit relation between all lower bound techniques for quantum
   query complexity.
- <em>International Journal of Quantum Information</em>, 2014.
+ <em>International Journal of Quantum Information</em>, 13(4): 1350059, 2015.
- Online ready.
 [&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
@@ Line 117: / Line 161: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">4</a>]
+[<a name="ORR13">6</a>]
 </td>
 <td class="bibtexitem">
@@ Line 131: / Line 175: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">5</a>]
+[<a name="LR13">7</a>]
 </td>
 <td class="bibtexitem">
@@ Line 145: / Line 189: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">6</a>]
+[<a name="MR13">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 162: / Line 206: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">7</a>]
+[<a name="KLL+12">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 180: / Line 224: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">8</a>]
+[<a name="LLR12">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 197: / Line 241: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">9</a>]
+[<a name="LR11">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 213: / Line 257: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">10</a>]
+[<a name="ORR11">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 229: / Line 273: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">11</a>]
+[<a name="GRR11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 246: / Line 290: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">12</a>]
+[<a name="AMRR11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 263: / Line 307: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">13</a>]
+[<a name="dklr11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 278: / Line 322: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">14</a>]
+[<a name="mnrs11-sicomp">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 294: / Line 338: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">15</a>]
+[<a name="kklr11">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 309: / Line 353: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">16</a>]
+[<a name="kor10">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 324: / Line 368: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">17</a>]
+[<a name="kmor10">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 341: / Line 385: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">18</a>]
+[<a name="akr10-pnas">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 357: / Line 401: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">19</a>]
+[<a name="kklr09">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 375: / Line 419: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">20</a>]
+[<a name="akr09-arxiv">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 390: / Line 434: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">21</a>]
+[<a name="dklr09">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 407: / Line 451: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">22</a>]
+[<a name="rs09">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 423: / Line 467: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">23</a>]
+[<a name="arc06">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 438: / Line 482: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">24</a>]
+[<a name="dlr06:qudits">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 454: / Line 498: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">25</a>]
+[<a name="mnrs06">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 471: / Line 515: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">26</a>]
+[<a name="ir06">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 486: / Line 530: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">27</a>]
+[<a name="ccmr05:pisa">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 506: / Line 550: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">28</a>]
+[<a name="dr05">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 512: / Line 556: @@
  An intuitive approach for the simulation of quantum correlations.
  In <em>26th Symposium on Information Theory in the Benelux</em>, 2005.
-[&nbsp;<a href="/_media/members/jroland/2005-proc-it05.pdf">.pdf</a>&nbsp;]
+[&nbsp;<a href="/_media/members/jroland/publications/2005-proc-it05.pdf">.pdf</a>&nbsp;]
 </td>
@@ Line 520: / Line 564: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">29</a>]
+[<a name="dlr05">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 535: / Line 579: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">30</a>]
+[<a name="ccmr05:pra">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 552: / Line 596: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">31</a>]
+[<a name="rc05">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 568: / Line 612: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">32</a>]
+[<a name="roland04">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 582: / Line 626: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">33</a>]
+[<a name="rc03b">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 597: / Line 641: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">34</a>]
+[<a name="rc03a">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 612: / Line 656: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">35</a>]
+[<a name="mprg02">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 627: / Line 671: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">36</a>]
+[<a name="rc02">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 642: / Line 686: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">37</a>]
+[<a name="hrb02">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 652: / Line 696: @@
 </td>
 </tr>
-</table><hr><p><em>This file was generated by
+</table>
-<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>
+<hr><p><em>This file was generated by
+<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>