By Topic

Dynamic rotation gate quantum algorithm and performance analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shanshan Wan ; Sch. of Comput. Sci., Beijing Univ. of Civil Eng. & Archit., Beijing, China ; Lei Sun

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.

Published in:

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:2 )

Date of Conference:

29-31 Oct. 2010