Distributed Grover's algorithm

In this paper, we propose a distributed Grover's algorithm, and it requires fewer qubits and has a linear advantage in time complexity compared to the original Grover's algorithm. More exactly, to search for a target in an unstructured database with N elements, Grover's algorithm can get the target with query complexity O(N), but our distributed Grover's algorithm with K computing nodes can get the target with query complexity O(NK), and the number of qubits inputted in our distributed Grover's algorithm is ⌊log⁡K⌋ less than that in Grover's algorithm. In addition, we propose an efficient algorithm of constructing quantum circuits for realizing the oracle corresponding to any Boolean function with conjunctive normal form (CNF).