| |
| | QiSci |
 | | This search algorithm is very universal and one can use it as a subroutine for solving a number of other problems, for example element distinctness, that is testing whether all number in a sequence of length N are distinct, in time N^{3/4}. |
 | | Ambainis [2004] published a very elegant algorithm based on quantum random walks solving this problem in time N^{2/3}, which is optimal. |
 | | The resulting algorithm is almost as universal as unsorted search, and it was successfully applied to triangle finding in time N^{1.3} [Magniez, Santha, Szegedy, 2005], group commutativity testing in time N^{2/3} [Magniez, Nayak, 2005], and verification of matrix products [Buhrman, Špalek, 2006]. |
| www.qinfo.org (1516 words) |
|