Differences

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

--- members:jroland [2015/03/03 17:33]
jroland [Teaching]
+++ members:jroland [2015/03/06 09:23]
jroland [Publications]
@@ Line 41: / Line 41: @@
   * Quantum walks
   * Adiabatic quantum computation
+  * Quantum query complexity
   * Quantum non-locality
   * Quantum communication complexity
-  * Quantum cryptography
+  * Quantum cryptographic primitives
-  * Quantum query complexity
 ==== Selected talks ====
   * 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}}]
@@ Line 69: / Line 68: @@
 <table>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="KMOR15">1</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">