中文说明：量子粒子群算法：因为粒子的位置和速度在量子空间中不能一起确定，所以用波函数表示粒子位置，通过蒙特卡罗方法求出粒子位置。gbest求解通过平均最好位置mbest得到。mbest是所有个体平均最优，通过它来求解粒子出现在相对点的位置，用L表示。而粒子的势表示位置的最终值，与L直接相关。
English Description：
Quantum particle swarm optimization algorithm: because the position and velocity of the particle can not be determined together in the quantum space, the wave function is used to represent the particle position, and the Monte Carlo method is used to find the particle position. Gbest is solved by the average best position mbest. Mbest is the average optimal of all individuals. It is used to solve the position of particles in the relative point, expressed by L. The potential of the particle represents the final value of the position, which is directly related to L.