“…Here the QSE was compared against the GQA [22], QEA [23], QEA with probabilistic termination conditions [24], two phases TPQEA [24], advanced quantum genetic algorithm (ANQGA) [77], random search and greedy selection based GQA (RSGS_GQA) [53], quantum-inspired evolutionary algorithm based on p-system (QEPS) [76], adaptive quantum-inspired differential evolution algorithm (AQDE) [28], quantum-inspired cuckoo algorithm (QICSA) [38], quantum-inspired harmony search algorithm (QIHSA) [39], quantum-inspired DE and PSO algorithm (QDEPSO) [79], quantum-inspired Swarm Evolution (QSwEv) [68], discrete binary differential algorithm [28], binary artificial bee colony optimization and binary PSO (BABCNBPSO) [26], different binary PSO variants (DBPSO) [4]. In [54], the QSE was tested using the 0-1 knapsack problem, and it was reported that the QSE has better performance than the GQA, QEA, QEA with different termination conditions, TPQEA, ANQEA, RSGS_GQA, QEPS, AQDE, QSwEv, DBPSO, and BABCNBPSO. There was not reported a comparative of convergence time of each algorithm.…”