Quantum cooperative search algorithm for 3-SAT

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.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  Sheng-Tzong Cheng,et al.  Quantum communication for wireless wide-area networks , 2005, IEEE J. Sel. Areas Commun..

[3]  G. W. Greenwood,et al.  Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms , 2000, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[4]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[5]  P. Benioff.  The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

[6]  Donald E. Waagen,et al.  Proceedings of the 7th International Conference on Evolutionary Programming VII , 1998 .

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  John Hallam,et al.  Hybrid problems, hybrid solutions , 1995 .

[9]  Sheng-Tzong Cheng,et al.  Quantum switching and quantum merge sorting , 2006, IEEE Trans. Circuits Syst. I Regul. Pap..

[10]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[11]  Thomas Bäck,et al.  A Superior Evolutionary Algorithm for 3-SAT , 1998, Evolutionary Programming.

[12]  R. Feynman.  Simulating physics with computers , 1999 .

[13]  Jeremy Frank,et al.  Weighting for Godot: Learning Heuristics for GSAT , 1996, AAAI/IAAI, Vol. 1.

[14]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[15]  P. Jorrand,et al.  Measurement-Based Quantum Turing Machines and their Universality , 2004, quant-ph/0404146.

[16]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[17]  Ian P. Gent,et al.  Unsatisfied Variables in Local Search , 1995 .

[18]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[19]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[20]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  Zbigniew Michalewicz,et al.  Heuristic methods for evolutionary computation techniques , 1996, J. Heuristics.