Cover
In recent years, there has been widespread attention and discourse surrounding the field of distributed quantum computation. In comparison to centralized quantum computation, distributed quantum computation requires fewer qubits per node and shallower quantum circuits, making it more efficient in performing quantum computing tasks. We propose a distributed exact Grover algorithm (DEGA) that can solve the exact search problem for single target string. Specifically, (i) our algorithm is exact, which means the theoretical probability of finding the objective state is 100%; (ii) the depth of our circuit is less than the circuit depths of the original and modified Grover's algorithms. It only depends on the parity of n, and it is not deepened as n increases; (iii) we provide particular situations of our DEGA on MindQuantum (a quantum software) to demonstrate the practicality and validity of our method. Since our circuit is shallower, it will be more resistant to the depolarization channel noise. For more details, please refer to the article entitled “Distributed exact Grover’s algorithm” by Xu Zhou, Daowen Qiu, and Le Luo, Front. Phys. 18(5), 51305 (2023). [Photo credits: Xu Zhou at QUDOOR Co, Ltd.]
Download cover
