论文标题
具有先验知识的集合量子搜索
Quantum search in sets with prior knowledge
论文作者
论文摘要
量子搜索算法能够仅使用$ o（\ sqrt {n}）$ steps解决$ n $元素的搜索问题，从而产生了很大的影响。不幸的是，不可能降低该问题复杂性的顺序，但是，可以通过不变的因素进行改进。在本文中，我们在具有已知概率分布的集合中追求了搜索问题的改进。我们已经表明，通过使用修改版的量子搜索算法，可以减少此类集合的预期迭代次数。
Quantum Search Algorithm made a big impact by being able to solve the search problem for a set with $N$ elements using only $O(\sqrt{N})$ steps. Unfortunately, it is impossible to reduce the order of the complexity of this problem, however, it is possible to make improvements by a constant factor. In this paper we pursued such improvements for search problem in sets with known probability distributions. We have shown that by using a modified version of quantum search algorithm, it is possible to decrease the expected number of iterations for such sets.
