Using genetic algorithms to solve NP-complete problems
Proceedings of the third international conference on Genetic algorithms
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Superior Evolutionary Algorithm for 3-SAT
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Weighting for godot: learning heuristics for GSAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Quantum communication for wireless wide-area networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Grover's search algorithm, one of the most popular quantum algorithms, provides a good solution to solve NP complexity problems, but requires a large number of quantum bits (qubits) for its functionality. In this paper, a novel algorithm called quantum cooperative search is proposed to make Grover's search algorithm work on 3-SAT problems with a small number of qubits. The proposed algorithm replaces some qubits with classical bits and finds assignments to these classical bits using the traditional 3-SAT algorithms including evolutionary algorithms and heuristic local search algorithms. In addition, the optimal configuration of the proposed algorithm is suggested by mathematical analysis. The experimental results show that the quantum cooperative search algorithm composed by Grover's search and heuristic local search performs better than other pure traditional 3-SAT algorithms in most cases. The mathematical analysis of the appropriate number of qubits is also verified by the experiments.