Exact Quantum Search by Parallel Unitary Discrimination Schemes.pdfVIP

Exact Quantum Search by Parallel Unitary Discrimination Schemes Xiaodi Wu1,2∗ and Runyao Duan1† 1State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China 2Department of Physics, Tsinghua University, Beijing 100084, China We study the unsorted database search problem with items N from the viewpoint of unitary discrimination. Instead of considering the famous O(√N ) Grover’s the bounded-error algorithm for the original problem, we seek for the results about the exact algorithms, i.e. the ones succeed with certainty. Under the standard oracle model Pj (−1)δτj |j j |, we demonstrate a tight lower bound 2 N + o(N ) of the number of queries for any parallel scheme with unentangled input states. With 3 8 the assistance of entanglement, we obtain a general lower bound 1 (N − √N ). We provide concrete 2 0 examples to illustrate our results. In particular, we show that the case of N = 6 can be solved 0 exactly with only two queries by using a bipartite entangled input state. Our results indicate that 2 in the standard oracle model the complexity of exact quantum search with one unique solution can n be strictly less