arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.2058quant-phcond-mat.stat-mechcs.CC
收藏

关于乘积、类属和随机类属量子可满足性

On product, generic and random generic quantum satisfiability

C. R. Laumann, A. M. Läuchli, R. Moessner, A. Scardicchio, S. L. Sondhi

摘要:

我们报告了一组关于k-QSAT的结果,k-qubit投影机的量子可满足性问题,它将经典的可满足性与k位子句推广到量子设置。首先,我们定义了乘积可满足性的NP完全问题,并给出了一个判定QSAT交互图是乘积可满足的几何判据。我们表明,相同的标准足以建立量子满足所有的投影仪。其次,我们将这些结果与通用投影机的随机图集成,并获得改进的SAT-unSAT过渡的位置上的下界。第三,我们提出了随机的,通用的可满足性的数值结果,提供估计的位置的过渡为k=3和k=4和温和的证据的存在的一个阶段,这是可满足的纠缠态单独。

英文摘要:

We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability and give a geometrical criterion for deciding when a QSAT interaction graph is product satisfiable with positive probability. We show that the same criterion suffices to establish quantum satisfiability for all projectors. Second, we apply these results to the random graph ensemble with generic projectors and obtain improved lower bounds on the location of the SAT--unSAT transition. Third, we present numerical results on random, generic satisfiability which provide estimates for the location of the transition for k=3 and k=4 and mild evidence for the existence of a phase which is satisfiable by entangled states alone.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑