量子2- SAT的线性时间算法
A linear time algorithm for quantum 2-SAT
摘要:
布尔约束满足问题3-SAT可以说是典型的NP完全问题。相比之下,2-SAT不仅可以在多项式时间内确定,而且实际上可以在确定性线性时间内确定。在2006年,Bravyi提出了一个物理动机的k-SAT到量子设置的推广,定义了“量子k-SAT”问题。他证明了量子2-SAT在经典计算机上也可以在多项式时间内求解,特别是在确定性时间O(n^4)内,假设在有理数的域扩展上的单位成本算术,其中n是变量的数量。本文提出了一个量子2-SAT算法,它在线性时间内运行,即确定性时间O(n+m),n和m分别是变量和子句的数量。我们的方法利用了Laumann等人[QIC,2010]在随机量子2-SAT的相变研究中使用的转移矩阵技术,并且与Even,Itai和Shamir(基于回溯)[SICOMP,1976]和Aspvall,Plass和Tarjan(基于强连接分量)[IPL,1979]的线性时间2-SAT算法具有相似性。
英文摘要:
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically motivated generalization of k-SAT to the quantum setting, defining the problem "quantum k-SAT". He showed that quantum 2-SAT is also solvable in polynomial time on a classical computer, in particular in deterministic time O(n^4), assuming unit-cost arithmetic over a field extension of the rational numbers, where n is number of variables. In this paper, we present an algorithm for quantum 2-SAT which runs in linear time, i.e. deterministic time O(n+m) for n and m the number of variables and clauses, respectively. Our approach exploits the transfer matrix techniques of Laumann et al. [QIC, 2010] used in the study of phase transitions for random quantum 2-SAT, and bears similarities with both the linear time 2-SAT algorithms of Even, Itai, and Shamir (based on backtracking) [SICOMP, 1976] and Aspvall, Plass, and Tarjan (based on strongly connected components) [IPL, 1979].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。