Study of Test Suite Reduction Based on Quantum Evolutionary Algorithm

Test suite reduction aims at adequately testing all the test requirements with the least number of test cases. Through the coverage relationship between test requirements and test cases, test suite reduction problem can be converted into the standard optimization problem. Quantum evolutionary algorithm (QEA) is an intelligent algorithm based on quantum computation . In QEA, chromosomes are encoded with quantum bits as the basic information bits, and individual variation evolution is realized by quantum mutation based on quantum probability gates. So in QEA, the convergence speed and ability to search global best results are superior to the traditional evolutionary algorithms. Motivated by this, we propose a novel test suite reduction method using quantum evolutionary. Finally, experiments validate the technology with higher efficiency.