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 [2016/02/09 16:04] jroland [News] |
members:jroland [2016/02/10 09:31] jroland [Publications] |
||
---|---|---|---|
Line 19: | Line 19: | ||
==== Grant offers ==== | ==== Grant offers ==== | ||
- | A 2-year postdoctoral grant and a one-year PhD grant (with possibility of extension) are available as part of a project whose objectives are to study quantum communication complexity and devise explicit quantum protocols for cryptographic primitives such as weak coin flipping. | + | 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 should send an email with their resume to jroland (at) ulb.ac.be. Applicants are also encouraged to have at least 2 letters of recommendation arranged to be sent to the same address. | + | 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. | Consideration of candidates will be effective immediately and will continue until the positions are filled. | ||
- | |||
<html> | <html> | ||
Line 95: | Line 94: | ||
A universal adiabatic quantum query algorithm. | A universal adiabatic quantum query algorithm. | ||
In <em>10th Conference on the Theory of Quantum Computation, | In <em>10th Conference on the Theory of Quantum Computation, | ||
- | Communication and Cryptography (TQC'15)</em>, 2015. | + | Communication and Cryptography (TQC'15)</em>, volume 44 of <em>Leibniz |
- | To appear. | + | International Proceedings in Informatics (LIPIcs)</em>, pages 163--179, 2015. |
- | [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | ||
</td> | </td> | ||
Line 158: | Line 158: | ||
Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | ||
Quantum walks can find a marked element on any graph. | Quantum walks can find a marked element on any graph. | ||
- | <em>Algorithmica</em>, 2015. | + | <em>Algorithmica</em>, 74(2):851--907, 2015. |
- | Published online. | + | |
[ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | ||
<a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] |