Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)

Dynamic rotation gate quantum algorithm and performance analysis

Shanshan Wan, Lei Sun

Published Oct 1, 2010• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icicisys.2010.5658295

Related papers

Hybrid intelligent quantum algorithm and its application

Shanshan Wan, Chuyuan Wei, Xuhua Sun

Quantum algorithm has powerful parallel computing power and parallel optimization capabilities. It is capable of solving Np- complete problem such as Qos problem. In this paper, based on the parallelism performance of quantum algorithms, some advanced strategies are put forward to design a dynamic rotation gate. The different rotation angle and amplitude of rotation gate can be applied to adjust and control the evolutionary process. These strategies aim to enforce and guarantee the quantum's parallel computing feature and enhance its global search performance. The dynamic rotation gate based quantum algorithm improved algorithm is applied to solve the QoS constrained multicast routing problem with uncertain parameters constrained and the result shows the advanced quantum algorithm has the prominent efficiency and high searching performance and it is much robust on parameters, initial conditions and solution scale.

International Conference on Computer Application and System Modeling•Oct 1, 2010•1 citation

A Novel Quantum Evolutionary Algorithm and Its Application

Hui Gao, Guanghui Xu, Zheren Wang

Based on the probability amplitude ratio of the corresponding states of quantum bits, the rotation angle of quantum rotation gate is calculated adaptively and a new quantum rotation gate is constructed. A novel quantum evolutionary algorithms (NQEA), whose core is that the designed quantum rotation gate is used as evolutionary strategy is introduced, rapid convergence and good global search capability characterize the performance of NQEA, and NQEA is able to possess the two characteristics of exploration and exploitation, simultaneously. NQEA is applied on the physical distribution vehicle routing problem - a typical combinatorial optimization problem, the results show that NQEA is superior to the previous quantum evolutionary algorithm as well as other conventional genetic algorithms

World Congress on Intelligent Control and Automation•Jan 1, 2006•14 citations

Improved Quantum Evolutionary Algorithm for Combinatorial Optimization Problem

Rui Zhang, Hui Gao

The method of calculating rotation angle of quantum rotation gate plays an important role to the performance of quantum evolutionary algorithm (QEA). This paper proposes an improved quantum evolutionary algorithm (IQEA), whose core is that a new approach of adaptive calculating rotation angle of quantum rotation gate is designed on the basis of the probability amplitude ratio of the corresponding states. Rapid convergence and good global search capability characterize the performance of IQEA. Based on a typical combinatorial optimization problem - 0/1 knapsack problems, the influence of the relative parameter to the performance of IQEA is demonstrated, and then comparing experiments have been done. The results show that IQEA is superior to the previous quantum evolutionary algorithm.

International Conference on Machine Learning and Cybernetics•Jan 1, 2007•37 citations

Quantum Max-min Ant Colony Algorithm For QoS Routing Problem

Yalong Li, Wang Wei, Sun Jing +1 more

Abstract Aiming at the ant colony algorithm is weak to solve the problem of QoS routing, this paper proposes a routing algorithm that combines quantum computing with the max-min ant colony algorithm. The algorithm introduces a quantum selection strategy, uses qubit probability amplitude to encode the path, and dynamically adjusts the quantum rotation gate to update the path quantum coding on the basis of the minimum cost to meet the constraints and other optimal conditions, combined with the maximum and minimum pheromone determination mechanism to find the optimal path, effectively control the evolution speed and direction, and accelerate the algorithm convergence. Experimental results show that the algorithm is effective in controlling the speed and direction of evolution, and has better optimization ability and convergence performance than ant colony algorithm.

Journal of Physics Conference Series•Mar 1, 2021•1 citation

A Quantum MMAS Based Algorithm for Multicast Routing Problem

Yalong Li, Wei Wang, Sun Jing +1 more

Abstract For solving the problem of multicast routing, ant colony algorithm (ACO) has insufficient optimization ability. The paper proposes a routing algorithm which combines quantum computing and max min ACO. The algorithm uses quantum bit probability amplitude to encode the link, and dynamically adjusts quantum revolving gate to update the quantum coding on the link, so as to meet the cost optimization under constraint conditions, combined with the maximum and minimum pheromone decision mechanism to find the optimal link path, effectively control the evolution speed and direction, and enhance the convergence performance of the algorithm. The simulation results show that the algorithm can effectively control the evolution speed and direction, and is better than ant colony algorithm in the optimization ability and convergence performance.

Journal of Physics Conference Series•May 1, 2021•0 citations

An improved quantum optimization algorithm for multicast routing problem

Xiao Yan Sun, Hua Wang, Chuankai An +2 more

Delay-constraint minimum cost multicast tree problem is a classical combinatorial optimization problem. It has been proved to be a NP-complete problem. Many algorithms have been proposed to solve the problem. This paper proposed a tree-based quantum optimization algorithm for the multicast tree problem. In this algorithm, the probability amplitude of each side was stored in a quantum, and the quantum evolved by quantum gate, each quantum moved in the direction of better solution. The evolutionary process merged the trees rather than paths directly to accelerate the convergence and improved the quality of solutions. Simulation results showed that the algorithm in this paper performed well at searching and convergence speed.

IEEE International Conference on Communication Technology (ICCT)•Sep 1, 2011•1 citation
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.
Quantum algorithm has powerful parallel computing power and parallel optimization capabilities. It is capable of solving Np- complete problem such as Qos problem. In this paper, based on the parallelism performance of quantum algorithms, some advanced strategies are put forward to design a dynamic rotation gate. The different rotation angle and amplitude of rotation gate can be applied to adjust and control the evolutionary process. These strategies aim to enforce and guarantee the quantum's parallel computing feature and enhance its global search performance. The dynamic rotation gate based quantum algorithm improved algorithm is applied to solve the QoS constrained multicast routing problem with uncertain parameters constrained and the result shows the advanced quantum algorithm has the prominent efficiency and high searching performance and it is much robust on parameters, initial conditions and solution scale.
Based on the probability amplitude ratio of the corresponding states of quantum bits, the rotation angle of quantum rotation gate is calculated adaptively and a new quantum rotation gate is constructed. A novel quantum evolutionary algorithms (NQEA), whose core is that the designed quantum rotation gate is used as evolutionary strategy is introduced, rapid convergence and good global search capability characterize the performance of NQEA, and NQEA is able to possess the two characteristics of exploration and exploitation, simultaneously. NQEA is applied on the physical distribution vehicle routing problem - a typical combinatorial optimization problem, the results show that NQEA is superior to the previous quantum evolutionary algorithm as well as other conventional genetic algorithms
The method of calculating rotation angle of quantum rotation gate plays an important role to the performance of quantum evolutionary algorithm (QEA). This paper proposes an improved quantum evolutionary algorithm (IQEA), whose core is that a new approach of adaptive calculating rotation angle of quantum rotation gate is designed on the basis of the probability amplitude ratio of the corresponding states. Rapid convergence and good global search capability characterize the performance of IQEA. Based on a typical combinatorial optimization problem - 0/1 knapsack problems, the influence of the relative parameter to the performance of IQEA is demonstrated, and then comparing experiments have been done. The results show that IQEA is superior to the previous quantum evolutionary algorithm.
Abstract Aiming at the ant colony algorithm is weak to solve the problem of QoS routing, this paper proposes a routing algorithm that combines quantum computing with the max-min ant colony algorithm. The algorithm introduces a quantum selection strategy, uses qubit probability amplitude to encode the path, and dynamically adjusts the quantum rotation gate to update the path quantum coding on the basis of the minimum cost to meet the constraints and other optimal conditions, combined with the maximum and minimum pheromone determination mechanism to find the optimal path, effectively control the evolution speed and direction, and accelerate the algorithm convergence. Experimental results show that the algorithm is effective in controlling the speed and direction of evolution, and has better optimization ability and convergence performance than ant colony algorithm.
Abstract For solving the problem of multicast routing, ant colony algorithm (ACO) has insufficient optimization ability. The paper proposes a routing algorithm which combines quantum computing and max min ACO. The algorithm uses quantum bit probability amplitude to encode the link, and dynamically adjusts quantum revolving gate to update the quantum coding on the link, so as to meet the cost optimization under constraint conditions, combined with the maximum and minimum pheromone decision mechanism to find the optimal link path, effectively control the evolution speed and direction, and enhance the convergence performance of the algorithm. The simulation results show that the algorithm can effectively control the evolution speed and direction, and is better than ant colony algorithm in the optimization ability and convergence performance.
Delay-constraint minimum cost multicast tree problem is a classical combinatorial optimization problem. It has been proved to be a NP-complete problem. Many algorithms have been proposed to solve the problem. This paper proposed a tree-based quantum optimization algorithm for the multicast tree problem. In this algorithm, the probability amplitude of each side was stored in a quantum, and the quantum evolved by quantum gate, each quantum moved in the direction of better solution. The evolutionary process merged the trees rather than paths directly to accelerate the convergence and improved the quality of solutions. Simulation results showed that the algorithm in this paper performed well at searching and convergence speed.