After that, we propose a distributed exact Grover's algorithm (DEGA), which decomposes the original search problem into ?n/2? parts. Specifically, (i) our algorithm is as exact as the modified version of Grover'