Nonlocal implementation of the Grover algorithm
Wenzhang Liu · Journal of Tsinghua University(Science and Technology) · 2005
At present, state-of-the-art quantum computers using nuclear magnetic resonance (NMR) can only implement 7-qubits. Therefore, some authors have proposed a distributed quantum computer that can integrate more qubits. The nonlocal implementation of the Grover quantum search algorithm was used to analyze the Einstein-Podolsky-Rosen (EPR) pair resources required for the nonlocal implementation. This study describes the details of the implementation in a two-qubit system and the nonlocal implementation of a system with N-qubit numbers. N is the databank size to be searched. The results show that for uncertain circumstances, the required resources in a nonlocal quantum computation are more EPR pairs than in a classical Grover algorithm, even more than in a classical computation; hence, the nonlocal implementation of quantum computation loses its advantage.