The Improvement Of Quantum Grover Algorithm And Its Application In The Ad Hoc Network Routing

Quantum Grover algorithm has got much attention by many scholars since1996, because of itsSuperior performance.But it still has many shotcomings.For example, when the number of targetreach1/2of total number, this algorithm may fails.Some improved algorithms were proposed forthe shortcoming of grover algorithm.How to further improver the grover algorithm’s performance,is one of starting points of our paper.Mobile Ad Hoc networks is a kind of hight performancenetworks without infrastructure and The topology is not still.Because its special features, thetradition routing algorithms does not meet its need. How to find a new routing algorithm that meetsits need is another starting point of our paper. The work of this paper is as follows:First, this article discusses the Grover algorithm and puts forward an improved algorithm. Wesimulate two algorithms and analysis the defects of the Grover algorithm. The results show that theimproved algorithm can reduce the amount of computation to1/3while guaranting the highprobability of success (93%).Second, the routing problem of Ad Hoc networks was discussed.Based on the analysis of DSRRouting algorithm and the routing algorithm based on Grover algorithm. An improved routingalgorithm was put forward.The new algorithm was proved to have better performance thoughcomparance between DSR and the algorithm based on Grover.Third, the QoS problem of Ad Hoc routing was discussed.A new quantum QoS routingalgorithm was put forward based on analysis of existing Ad Hoc QoS routing algorithm and Qosrouting algorithm based on Quantum Grover search algorithm.