Abstract
In this paper, quantum rotate gate is improved, which is the main operation in the population update of the traditional quantum evolutionary algorithm. A new rotation angle is defined, preventing the algorithm from easily falling into local optimum state in the middle and late term. Based on the characteristics of TSP, a modified quantum rotate gate is proposed in this paper to adaptively adjust the rotation angle, according to the evolution generations and the adapt to degree of the value to adaptive dynamic adjustment of the rotation angle, resulting a better global search capability. At the same time, in order to prevent the extramalisation of the probability amplitudes α and β falling into local optimal algorithm, this paper adopted the Hε gate on the probability amplitude of the rotation to make the corrective manipulation. The comparative experimental results showed that the algorithm's stability and accuracy have been greatly improved in solving the TSP problem, compared with the conventional quantum evolutionary algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of High Performance Systems Architecture
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
