Multipartite entanglement in adiabatic quantum searching algorithm

To explore the role of multipartite entanglement in Grover´s algorithm, we generalized the Meyer-Wallach measure to include all possible bipartitions of the system, and use this generalized measure as the quantify of multipartite entanglement. It is shown that along with the bipartite entanglement during the process of adiabatic quantum search algorithm, multipartite entanglement also exists and evolution with the system. Moreover, similar scaling behaviors show both in bipartite and multipartite case.