A deterministic quantum search algorithm is presented for complete bipartite graphs, which generalizes Grover's search algorithm and enables efficient search on structured graphs.
