Differences

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

--- members:jroland [2015/03/18 13:00]
jroland
+++ members:jroland [2015/11/04 09:59]
jroland [Teaching]
@@ Line 19: / Line 19: @@
 ==== News ====
-  * On May 31, 2015, I will run the 20km of Brussels for [[http://www.medecinsdumonde.be/|Doctors of the World]]. Help me raise funds by [[http://www.medecinsdumonde.be/events/20-km-de-bruxelles/j-r-mie_roland|sponsoring my race]].
+  * 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]].
-  * 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!
+  * 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 31: / 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 38: / 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
-  * Examen spécial d'admission en Polytechnique - partie géométrie
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory
-  * Analyse complexe - exercices (MATH-H-201)
+  * 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
@@ Line 76: / Line 77: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">1</a>]
+[<a name="FJKL+15">1</a>]
 </td>
 <td class="bibtexitem">
-Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
- Quantum walks can find a marked element on any graph.
+  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
- <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.
+ 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 108: / Line 95: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">3</a>]
+[<a name="BR14">2</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.
+ 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 122: / Line 111: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">4</a>]
+[<a name="KLL+14">3</a>]
 </td>
 <td class="bibtexitem">
@@ Line 129: / 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 135: / Line 124: @@
 </td>
 </tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<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>
@@ Line 145: / Line 152: @@
  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;]