arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0502022quant-ph
收藏

两个轻微纠缠的NP完全问题

Two Slightly-Entangled NP-Complete Problems

Roman Orus

摘要:

我们进行了两个真正的量子力学问题的经典计算复杂性的数学分析,这是在量子自旋系统的预期磁化和子系统之间的纠缠计算的启发。我们分别称之为SES和SESSP的问题是用n个量子比特的纯微纠缠量子态来描述的,并给出了严格的数学证明,证明它们属于NP-完全复杂性类. SES和SESSP,因此,计算等价于相关的3-SAT问题,一个有效的算法尚未被发现。

英文摘要:

We perform a mathematical analysis of the classical computational complexity of two genuine quantum-mechanical problems, which are inspired in the calculation of the expected magnetizations and the entanglement between subsystems for a quantum spin system. These problems, which we respectively call SES and SESSP, are specified in terms of pure slightly-entangled quantum states of n qubits, and rigorous mathematical proofs that they belong to the NP-Complete complexity class are presented. Both SES and SESSP are, therefore, computationally equivalent to the relevant 3-SAT problem, for which an efficient algorithm is yet to be discovered.

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

↑