首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Grover quantum searching algorithm based on weighted targets
Authors:Li Panchi  Li Shiyong
Institution:1. Dept. Of Control Science and Engineering, Harbin Inst. Of Technology, Harbin 150001, P. R. China;Dept. Of Computer Science and Engineering, Daqing Petroleum Inst., Daqing 163318, P. R. China
2. Dept. of Control Science and Engineering, Harbin Inst. of Technology, Harbin 150001, P. R. China
Abstract:The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm.Finally, the validity of the algorithm is proved by a simple searching example.
Keywords:Grover algorithm  targets weighting  quantum searching  quantum computing  
本文献已被 维普 万方数据 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号