摘要
Grover提出了容量为N的数据库量子搜索法。只需进行O(N)次迭代就能以几乎为1的概率实现对目标的搜索。本文将文献[1]的Grover搜索法推广到混合态情形,给出了一个基于混合态的Grover搜索法,并分析了该搜索法成功的概率上界。进一步发现搜索法成功的概率完全依赖于所使用的初态(混合态)。该结论为了解量子噪声对Grover搜索法的影响提供一定的理论依据。最后通过例子说明了如何实施基于混合态的Grover搜索法。
Grover proposed how a quantum computer can find a single marked object in a database of size N by using only O(√N) queries of the oracle that identifies the object with the probability of finding the marked object being not exactly 1. The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability of finding the marked object is calculated and it is found that it depends strongly on the specific initial state. Our results contribute to analyze the influence of quantum noise on Grover algorithm based on pure state. Finally, we give few examples to show that for some extremely mixed initial states.
出处
《量子光学学报》
CSCD
北大核心
2009年第3期236-240,共5页
Journal of Quantum Optics