A quantum polynomial time search algorithm for certain unsorted finite lists

ePrint Report: A quantum polynomial time search algorithm for certain unsorted finite lists

Stephane Lemieux

Grover famously showed that any unsorted list, of finite size $N$, can be searched in O($\sqrt{N})$ time via quantum computation. Bennett et. al. demonstrated that any algorithm general enough to search any finite unsorted list must take at least O($\sqrt{N})$ time via quantum computation. We demonstrate a quantum algorithm that can search a proper subclass of finite, unsorted lists, of size $N$, in a time …

algorithm eprint report lists quantum search