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

用于3SAT问题的精确张量网络

An exact tensor network for the 3SAT problem

A. Garcia-Saez, J. I. Latorre

摘要:

我们构造了一个张量网络,它提供了一个非归一化的量子态,其系数是一个NP完全问题3SAT的解决方案。对应于状态范数的张量网络收缩计算实例的解的数量。由此可见,这个张量网络的精确收缩处于#P-complete计算复杂性级别,因此被认为是一项艰巨的任务。此外,我们表明,对于一个3SAT的实例与n位,这是足够的执行多项式数量的收缩张量网络结构的计算相关的本地可观的,以获得一个明确的解决方案的问题,如果有的话。由通用张量网络描述的状态的物理实现相当于找到3SAT实例的满意分配,因此,这个实验任务预计是困难的。

英文摘要:

We construct a tensor network that delivers an unnormalized quantum state whose coefficients are the solutions to a given instance of 3SAT, an NP-complete problem. The tensor network contraction that corresponds to the norm of the state counts the number of solutions to the instance. It follows that exact contractions of this tensor network are in the #P-complete computational complexity class, thus believed to be a hard task. Furthermore, we show that for a 3SAT instance with n bits, it is enough to perform a polynomial number of contractions of the tensor network structure associated to the computation of local observables to obtain one of the explicit solutions to the problem, if any. Physical realization of a state described by a generic tensor network is equivalent to finding the satisfying assignment of a 3SAT instance and, consequently, this experimental task is expected to be hard.

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

↑