摘要
In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.
基金
supported by 973 Program under Grant No.2006CB921106
National Natural Science Foundation of China under Grant No.60635040
the Key Grant Project of the Ministry of Education under Grant No.306020
