论文标题
Grover搜索较小的甲骨文
Grover search with smaller oracles
论文作者
论文摘要
Grover搜索是最重要的量子算法之一。在本文中，我们考虑一种搜索，可以将满意度的条件重写为$ t = t_1 \ bigcap t_2 $。然后，我们提出了一个新的Grover搜索，并带有较小的口腔。该算法$ o（\fracπ{4} \ sqrt {\ frac {\ frac {n} {bλ}}+\fracπ{4} \ sqrt {\ frac {b frac {b}τ}τ}）$的时间复杂性的时间复杂性。 $ O（\fracπ{4} \ sqrt {\ frac {n} {m}}}} $。
Grover search is one of the most important quantum algorithms. In this paper, we consider a kind of search that the conditions of satisfaction $T$ can be rewritten as $T=T_1\bigcap T_2$. Then we present a new Grover search with smaller oracles. The time complexity of this algorithm $O(\fracπ{4}\sqrt{\frac{N}{bλ}}+\fracπ{4}\sqrt{\frac{b}τ})$, which is smaller than the time complexity of original Grover search, i.e. $O(\fracπ{4}\sqrt{\frac{N}{M}})$.
