Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
members:jroland [2015/04/15 14:40] jroland [Short biography] |
members:jroland [2015/12/15 17:38] jroland [Selected talks] |
||
---|---|---|---|
Line 38: | Line 38: | ||
==== Teaching ==== | ==== Teaching ==== | ||
* Compléments de programmation et d'algorithmique (INFO-H-304) | * 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 ==== | ==== Research interests ==== | ||
* Quantum algorithms | * Quantum algorithms | ||
Line 51: | Line 52: | ||
* Quantum cryptographic primitives | * Quantum cryptographic primitives | ||
==== Selected talks ==== | ==== 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 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}}] | * 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 78: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KMOR15">1</a>] | + | [<a name="BR14">1</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | + | Mathieu Brandeho and Jéré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. |
- | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | + | To appear. |
- | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | + | [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] |
</td> | </td> | ||
</tr> | </tr> | ||
- | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+15">2</a>] | + | [<a name="KLL+14">2</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Laurière, Sophie | + | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, |
- | Laplante, and Jéré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. |
- | [ <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | + | [ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
</td> | </td> | ||
</tr> | </tr> | ||
- | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BR14">3</a>] | + | [<a name="FJKL+15">3</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Mathieu Brandeho and Jérémie Roland. | + | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu |
- | A universal adiabatic quantum query algorithm. | + | Laurière, and Jérémie Roland. |
- | <em>arXiv preprint arXiv:1409.3558</em>, 2014. | + | Relative Discrepancy does not separate Information and Communication |
- | [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | + | 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. | ||
+ | [ <a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a> | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
</td> | </td> | ||
Line 122: | Line 127: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+14">4</a>] | + | [<a name="MR13-IJQI">4</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, | + | Loïck Magnin and Jéré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. | + | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] |
- | To appear. | + | |
- | [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | + | |
</td> | </td> | ||
Line 139: | Line 142: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13-IJQI">5</a>] | + | [<a name="KMOR15">5</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Loïck Magnin and Jérémie Roland. | + | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jéré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. | + | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | |
- | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | + | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] |
</td> | </td> | ||
</tr> | </tr> | ||
- | |||
<tr valign="top"> | <tr valign="top"> |