Dynamic rotation gate quantum algorithm and performance analysis

Compared with other optimization algorithm quantum algorithm is a distinctive type for its intervention and powerful parallel computing power and parallel optimization capabilities which enables it to solve combinatorial optimization problems. Quantities of researchers cast problems to its applications and parameters settings. In this paper, we use quantum algorithm to Qos constrained multicast routing problem with uncertain parameters constrained optimization and design a dynamic rotation gate which can adjust the choice probability according to the evolutionary process and guarantee the correct direction and avoid the pre-mature phenomenon. The algorithm is compared to PBIL algorithm because both of these two algorithms are based on probability strategy. The result to simulation examples shows the quantum algorithm based on dynamic rotation gate is powerful to solve such optimization problems and the design of dynamic rotation gate is reasonable and effective.