Differences

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

--- members:jroland [2015/04/15 10:21]
jroland [News]
+++ members:jroland [2016/02/09 16:15]
jroland [Grant offers]
@@ Line 18: / Line 18: @@
 |}
-==== News ====
+==== Grant offers ====
-  * 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]].
+As part of a new project on quantum communication complexity and quantum cryptographic primitives such as weak coin flipping, I am looking for one postdoctoral researcher (2-year grant) and on PhD student (1-year grant, with possibility of extension).
+Interested applicants can send an email with their resume to jroland (at) ulb.ac.be and are encouraged to have at least 2 letters of recommendation sent to the same address.
+Consideration of candidates will be effective immediately and will continue until the positions are filled.
+<html>
+<!--
+* 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!
+  * 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]] ]
+  * -->
+</html>
 ==== Short biography ====
   * Born in Brussels in 1976.
@@ Line 32: / Line 42: @@
   * 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 39: / Line 48: @@
 ==== 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 52: / Line 62: @@
   * Quantum cryptographic primitives
 ==== Selected talks ====
+  * A universal adiabatic quantum query algorithm. [[http://www.lorentzcenter.nl/lc/web/2015/724/info.php3?wsid=724&venue=Snellius|Quantum Random Walks and Quantum Algorithms]], Lorentz Center, Leiden (Netherlands), December 11, 2015. [{{:members:jroland:qwalks-leiden-2015-handout.pdf|PDF}}]
   * 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}}]
@@ Line 77: / Line 88: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">1</a>]
+[<a name="BR14">1</a>]
 </td>
 <td class="bibtexitem">
-Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
- Quantum walks can find a marked element on any graph.
+ A universal adiabatic quantum query algorithm.
- <em>Algorithmica</em>, 2015.
+ In <em>10th Conference on the Theory of Quantum Computation,
- Published online.
+  Communication and Cryptography (TQC'15)</em>, 2015.
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+ To appear.
-<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">2</a>]
+[<a name="KLL+14">2</a>]
 </td>
 <td class="bibtexitem">
-Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Lauri&egrave;re, Sophie
+Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&eacute;r&eacute;mie Roland,
-  Laplante, and J&eacute;r&eacute;mie Roland.
+  and David Xiao.
- Relative Discrepancy does not separate Information and Communication
+ Lower bounds on information complexity via zero-communication
-  Complexity.
+  protocols and applications.
- <em>Electronic Colloquium on Computational Complexity</em>, 28, 2015.
+ <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015.
-[&nbsp;<a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1137/130928273">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">3</a>]
+[<a name="FJKL+15">3</a>]
 </td>
 <td class="bibtexitem">
-Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
- A universal adiabatic quantum query algorithm.
+  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
- <em>arXiv preprint arXiv:1409.3558</em>, 2014.
+ Relative Discrepancy does not separate Information and Communication
-[&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
+  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>
@@ Line 123: / Line 137: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">4</a>]
+[<a name="MR13-IJQI">4</a>]
 </td>
 <td class="bibtexitem">
-Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&eacute;r&eacute;mie Roland,
+Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
-  and David Xiao.
+ Explicit relation between all lower bound techniques for quantum
- Lower bounds on information complexity via zero-communication
+  query complexity.
-  protocols and applications.
+ <em>International Journal of Quantum Information</em>, 13(4): 1350059, 2015.
- <em>SIAM Journal on Computing</em>, 2014.
+[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
- To appear.
-[&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
 </td>
@@ Line 140: / Line 152: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">5</a>]
+[<a name="KMOR15">5</a>]
 </td>
 <td class="bibtexitem">
-Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
+Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
- Explicit relation between all lower bound techniques for quantum
+ Quantum walks can find a marked element on any graph.
-  query complexity.
+ <em>Algorithmica</em>, 2015.
- <em>International Journal of Quantum Information</em>, 2013.
+ Published online.
- Online ready.
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
-[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
+<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">