Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
members:jroland [2016/02/09 16:15] jroland [Grant offers] |
members:jroland [2016/02/10 09:31] jroland [Publications] |
||
|---|---|---|---|
| Line 94: | 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 157: | 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> ] | ||