Differences

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

--- members:jroland [2015/03/03 17:33]
jroland [Teaching]
+++ members:jroland [2015/11/04 09:57]
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 34: / Line 39: @@
   * Compléments de programmation et d'algorithmique (INFO-H-304)
   * Quantum information and computation (INFO-H-514)
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - Computing and Complexity Theory part
   * Examen spécial d'admission en Polytechnique - partie géométrie
-  * Analyse complexe - exercices (MATH-H-201)
+  * Analyse complexe - theory (MATH-H-302) - exercices (MATH-H-201)
 ==== Research interests ====
   * Quantum algorithms
   * Quantum walks
   * Adiabatic quantum computation
+  * Quantum query complexity
   * Quantum non-locality
   * Quantum communication complexity
-  * Quantum cryptography
+  * Quantum cryptographic primitives
-  * Quantum query complexity
 ==== 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 55: / 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}}]
@@ Line 75: / Line 79: @@
 </td>
 <td class="bibtexitem">
-Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Lauri&egrave;re, Sophie
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
-  Laplante, and J&eacute;r&eacute;mie Roland.
+  Lauri&egrave;re, 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.
+ In <em>42nd International Colloquium on Automata, Languages and
-[&nbsp;<a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
+  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>
@@ Line 93: / Line 99: @@
 Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
  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 109: / Line 117: @@
  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 119: / Line 127: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">4</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 125: / Line 151: @@
  Explicit relation between all lower bound techniques for quantum
   query complexity.
- <em>International Journal of Quantum Information</em>, 2013.
+ <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 135: / Line 160: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">5</a>]
+[<a name="ORR13">6</a>]
 </td>
 <td class="bibtexitem">
@@ Line 149: / Line 174: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">6</a>]
+[<a name="LR13">7</a>]
 </td>
 <td class="bibtexitem">
@@ Line 163: / Line 188: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">7</a>]
+[<a name="MR13">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 180: / Line 205: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">8</a>]
+[<a name="KLL+12">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 198: / Line 223: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">9</a>]
+[<a name="LLR12">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 215: / Line 240: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">10</a>]
+[<a name="LR11">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 231: / Line 256: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">11</a>]
+[<a name="ORR11">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 247: / Line 272: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">12</a>]
+[<a name="GRR11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 264: / Line 289: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">13</a>]
+[<a name="AMRR11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 281: / Line 306: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">14</a>]
+[<a name="dklr11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 296: / Line 321: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">15</a>]
+[<a name="mnrs11-sicomp">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 312: / Line 337: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">16</a>]
+[<a name="kklr11">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 327: / Line 352: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">17</a>]
+[<a name="kor10">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 342: / Line 367: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">18</a>]
+[<a name="kmor10">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 359: / Line 384: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">19</a>]
+[<a name="akr10-pnas">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 375: / Line 400: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">20</a>]
+[<a name="kklr09">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 393: / Line 418: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">21</a>]
+[<a name="akr09-arxiv">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 408: / Line 433: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">22</a>]
+[<a name="dklr09">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 425: / Line 450: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">23</a>]
+[<a name="rs09">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 441: / Line 466: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">24</a>]
+[<a name="arc06">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 456: / Line 481: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">25</a>]
+[<a name="dlr06:qudits">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 472: / Line 497: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">26</a>]
+[<a name="mnrs06">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 489: / Line 514: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">27</a>]
+[<a name="ir06">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 504: / Line 529: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">28</a>]
+[<a name="ccmr05:pisa">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 524: / Line 549: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">29</a>]
+[<a name="dr05">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 538: / Line 563: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">30</a>]
+[<a name="dlr05">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 553: / Line 578: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">31</a>]
+[<a name="ccmr05:pra">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 570: / Line 595: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">32</a>]
+[<a name="rc05">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 586: / Line 611: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">33</a>]
+[<a name="roland04">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 600: / Line 625: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">34</a>]
+[<a name="rc03b">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 615: / Line 640: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">35</a>]
+[<a name="rc03a">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 630: / Line 655: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">36</a>]
+[<a name="mprg02">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 645: / Line 670: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">37</a>]
+[<a name="rc02">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 660: / Line 685: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">38</a>]
+[<a name="hrb02">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 670: / Line 695: @@
 </td>
 </tr>
-</table><hr><p><em>This file was generated by
+</table>
+<hr><p><em>This file was generated by
 <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>