A linear time quantum algorithm for 3SAT
Zachary B. Walters · arXiv (Cornell University) · 2015
A quantum algorithm for the NP complete problem of satisfying boolean formulas with three variables per clause (3SAT) is presented. Departing from traditional models of quantum computation, this algorithm makes extensive use of irreversible operations to incoherently transfer population from states which do not solve some problem of interest to states which do. Provided that a solution exists, the algorithm yields exponential decay of nonsolution probability, at a rate controlled by the user.