用量子计算机解决高约束搜索问题
Solving Highly Constrained Search Problems with Quantum Computers
摘要：
将一种单步的求解1-SAT问题的量子搜索算法推广到一系列高约束的k-SAT问题。我们确定了一个约束条件的可满足性问题，广义算法可以找到一个解决方案，在一个常数的步骤，作为变量的数量增加的条款的数量。这种性能与最好的经典算法所需的步骤数的线性增长以及忽略问题结构的经典和量子方法所需的指数增长形成对比。在某些情况下，该算法还可以保证无法解决的问题实际上没有解决方案，这与以前提出的量子搜索算法不同。
英文摘要：
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for which the generalized algorithm can find a solution in a constant number of steps as the number of variables increases. This performance contrasts with the linear growth in the number of steps required by the best classical algorithms, and the exponential number required by classical and quantum methods that ignore the problem structure. In some cases, the algorithm can also guarantee that insoluble problems in fact have no solutions, unlike previously proposed quantum search algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
