量子2SAT的线性时间算法
Linear time algorithm for quantum 2SAT
摘要:
关于可满足性理论的一个典型结果是,2-SAT问题可以在线性时间内解决,尽管3-SAT问题是NP-困难的。在量子2-SAT问题中,我们在一个$n$量子比特系统上给出一族2-量子比特投影$Π_{ij}$,任务是判定对于某些$α=O(1)$,其哈密顿量$H=\sum Π_{ij}$是否有0-本征值,或者是否大于$1/n^α$.这个问题不仅是经典2-SAT问题到量子情形的自然延伸,而且也等价于寻找自旋$\frac{1}{2}$的2-局域无阻挫哈密顿量的基态的问题,这是一个被充分研究的模型,被认为捕获了现代凝聚态物理中的某些关键性质。虽然Bravyi已经证明量子2-SAT问题有一个经典的多项式时间算法,但他的算法的运行时间是$O(n^4)$。在本文中,我们给出了一个经典的算法与线性运行时间的本地投影机的数量,从而达到最佳的可能的复杂性。
英文摘要:
A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors $Π_{ij}$ on a system of $n$ qubits, and the task is to decide whether the Hamiltonian $H=\sum Π_{ij}$ has a 0-eigenvalue, or it is larger than $1/n^α$ for some $α=O(1)$. The problem is not only a natural extension of the classical 2-SAT problem to the quantum case, but is also equivalent to the problem of finding the ground state of 2-local frustration-free Hamiltonians of spin $\frac{1}{2}$, a well-studied model believed to capture certain key properties in modern condensed matter physics. While Bravyi has shown that the quantum 2-SAT problem has a classical polynomial-time algorithm, the running time of his algorithm is $O(n^4)$. In this paper we give a classical algorithm with linear running time in the number of local projectors, therefore achieving the best possible complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。