The vortex search is a new optimization algorithm recently proposed, which has the advantages of simple operation and strong search capabilities. However, it is easy to fall into premature convergence in the late stages of the algorithm. By introducing quantum computing into the algorithm, a quantum-inspired vortex search algorithm is proposed. Firstly, the vortex center is encoded by qubits described on the Bloch sphere, and then through repeatedly rotating all qubits on this individual about the same coordinate axis, some new individuals are generated. The best individual is chosen as a new vortex center which is rotated again until meeting the termination conditions. The experimental results of some benchmark functions extreme optimization show that the proposed algorithm is obviously superior to the original one.