Journal of Systems Engineering and Electronics ›› 2008, Vol. 19 ›› Issue (2): 363-369.

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Grover quantum searching algorithm based on weighted targets

Li Panchi1,2 & Li Shiyong1   

  1. 1. Dept. of Control Science and Engineering, Harbin Inst. of Technology, Harbin 150001, P. R. China;
    2. Dept. of Computer Science and Engineering, Daqing Petroleum Inst., Daqing 163318, P. R. China
  • Online:2008-04-21 Published:2010-01-03


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.