The analysis shows that the Grover's algorithm and the improved algorithm of Long are hard to attain 100% success probability. So a new searching algorithm is presented based on the improved algorithm of Long. The main contributions are to replace the inverting phase with a rotation phase which has the characteristic of self-adaption related with the data total amount and the target data quantity
and expand twice as big as the total amount when the target data quantity is half of the total amount. The new algorithm can attain 100% searching success rate in any case. The simulation result of knapsack problem indicates that the new algorithm is superior to Grover's algorithm and the improved algorithm of Long
it possesses of quick speed and high accuracy in searching
and gets good effect to solve actual problems with data error for phase matching.
关键词
Keywords
references
Grover L K. A Fast quantum mechanical algorithm for database search [C]∥Proceedings of the 28th Annual ACM Symposium on the Theory of Computing. New York: ACM,1996:212-219.
Grover L K. Quantum mechanics helps in searching for a needle in a haystack [J]. Phys Rev Lett, 1997, 79(2):326-328.
Grover L K. Quantum computers can search rapidly by using almost any transformation [J]. Phys Rev Lett, 1998, 80(19):4329-4332.
夏培肃.量子计算[J].计算机研究与发展,2001,38(10):1154-1155.
Xia Peisu. Quantum computation [J]. Journal of Computer Research and Development, 2001,38(10):1154-1155.