Exact Quantum Search by Parallel Unitary Discrimination Schemes

TL;DR

This paper investigates the exact quantum search problem using unitary discrimination, establishing lower bounds on query complexity for parallel schemes with and without entanglement, and demonstrating practical examples with fewer queries.

Contribution

The paper provides tight lower bounds on the number of queries needed for exact quantum search in parallel schemes, highlighting the advantage of entanglement and offering explicit solutions for specific cases.

Findings

Lower bound of (2/3)N + o(N) queries for unentangled parallel schemes

Lower bound of (1/2)(N - √N) queries with entanglement

Exact solution for N=6 with only two queries using entanglement

Abstract

We study the unsorted database search problem with items $N$ from the viewpoint of unitary discrimination. Instead of considering the famous $O(\sqrt{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 $\sum_j (-1)^{\delta_{\tau j}}|j>< j|$, we demonstrate a tight lower bound ${2/3}N+o(N)$ of the number of queries for any parallel scheme with unentangled input states. With the assistance of entanglement, we obtain a general lower bound ${1/2}(N-\sqrt{N})$. We provide concrete examples to illustrate our results. In particular, we show that the case of N=6 can be solved exactly with only two queries by using a bipartite entangled input state. Our results indicate that in the standard oracle model the complexity of exact quantum search with one unique solution can be strictly less than that of the calculation of OR function.