Quantum random-walk search algorithm

The search-by-walk paper cited from the complexity table. The abstract states an oracle search on N items with O(square root of N) calls, and describes the speedup as similar to other quantum search algorithms. The row does not claim a better query exponent than Grover's algorithm. This library does not yet have an algorithm page for quantum walks.