| 逼近全概率Grover算法的搜索次数计算 |
| |
| 引用本文： | 陈洪光,李飚,沈振康.逼近全概率Grover算法的搜索次数计算[J].计算机工程与应用,2004,40(3):58-59. |
| |
| 作者姓名： | 陈洪光 李飚 沈振康 |
| |
| 作者单位： | 国防科技大学ATR国家重点实验室,长沙,410073 |
| |
| 摘 要： | 文章研究了Grover量子搜索算法,该算法进行o(N√)次搜索后只能以大于0.5的概率获得正确结果,并且没有确定最佳的搜索次数。针对这两个问题,提出了一种确定搜索次数的计算方法,使Grover算法逼近全概率地获得搜索目标。仿真结果表明,该计算方法行之有效。
|
| 关 键 词： | 量子计算 量子算法 Grover算法 最优搜索 |
| 文章编号： | 1002-8331-(2004)03-0058-02 |
Calculating Optimal Searching Times of Grover Algorithm |
| |
| Chen Hongguang Li,Biao Shen Zhenkang.Calculating Optimal Searching Times of Grover Algorithm[J].Computer Engineering and Applications,2004,40(3):58-59. |
| |
| Authors: | Chen Hongguang Li Biao Shen Zhenkang |
| |
| Abstract: | To obtain the target with the probability of more than0.5,Grover quantum search algorithm need access the unsorted database o(N√)times,and this search algorithm tells people nothing about the optimal searching times.To solve these two problems ,this paper presents an algorithm calculating the optimal searching times.With this searching times Grover Algorithm will obtain the target with almost full probability.Simulation result shows that this calculating method is effective. |
| |
| Keywords: | Quantum computing Quantum algorithm Grover Algorithm Optimal search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
