首页|Quantum Ant Colony Algorithm Based on Bloch Coordinates
Quantum Ant Colony Algorithm Based on Bloch Coordinates
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
Given classic Ant Colony Algorithm only resolves the optimization problem of discrete system， this paper proposed a Quantum Ant Colony Algorithm (QACA) based on the Bloch spherical coordinate by combining Quantum Evolutionary Algorithm and Ant Colony Algorithm。 This algorithm applies Bloch spherical coordinate of Qubits to represent the current position information of ants; a new quantum revolving door is designed for updating the position to achieve to watch ants' movement。 Quantum doors help to realize the variation of ants' positions， increase the diversity。 For different optimization problems， various solution space transformational models and fitness functions are planned， so as to optimally solve the target。 Furthermore， simulations of function extreme value and TSP problems were conducted， which indicted that the algorithm is feasible and effective。
quantum computingBloch CoordinatesQuantum Ant Colony Algorithm
Xiaofeng Chen、Xingyou Xia、Ruiyun Yu
展开 >
Software College, Northeastern University, Shenyang, China
International conference on information computing and applications
NETL
