CAJ | 학술논문

Grover提出了容量为N的数据库量子搜索法.只需进行O(平方根N)次迭代就能以几乎为1的概率实现对目标的搜索.本文将文献[1]的Grover搜索法推广到混合态情形,给出了一个基于混合态的Grover搜索法,并分析了该搜索法成功的概率上界.进一步发现搜索法成功的概率完全依赖于所使用的初态(混合态).该结论为了解量子噪声对Grover搜索法的影响提供一定的理论依据.最后通过例子说明了如何实施基于混合态的Grover搜索法.
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 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.