Differences

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

--- members:jroland [2015/11/04 09:57]
jroland [Teaching]
+++ 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! [ [[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 38: / 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
-  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - Computing and Complexity Theory part
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory
-  * Examen spécial d'admission en Polytechnique - partie géométrie
+  * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
-  * Analyse complexe - theory (MATH-H-302) - exercices (MATH-H-201)
+  * Analyse complexe (MATH-H-201) - partim: Exercices
+  * Examen spécial d'admission en Polytechnique - Géométrie
 ==== Research interests ====
   * Quantum algorithms
@@ Line 51: / 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 76: / Line 88: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">1</a>]
+[<a name="BR14">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">
@@ Line 106: / Line 100: @@
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">3</a>]
+[<a name="KLL+14">2</a>]
 </td>
 <td class="bibtexitem">
@@ Line 117: / Line 110: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 2015.
+ <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015.
- To appear.
+[&nbsp;<a href="http://dx.doi.org/10.1137/130928273">DOI</a>&nbsp;|
-[&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</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="KMOR15">4</a>]
+[<a name="FJKL+15">3</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.
+ Relative Discrepancy does not separate Information and Communication
- Published online.
+  Complexity.
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+ In <em>42nd International Colloquium on Automata, Languages and
-<a href="http://arxiv.org/abs/1002.2419">arXiv</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>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">5</a>]
+[<a name="MR13-IJQI">4</a>]
 </td>
 <td class="bibtexitem">
@@ Line 157: / Line 149: @@
 </tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="KMOR15">5</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">