A Parallel Quantum Algorithm for the Satisfiability Problem
Liu Wen-Zhang, Zhang Jing-Fu, Long Gui-Lu · Communications in Theoretical Physics · 2008
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.