arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.04651quant-phcs.CCmath.OA
收藏

非局域博弈、压缩定理与算术层级

Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy

Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen

AI总结:

本文证明判定双人非局域博弈的量子值是否恰好为1对算术层级第二层Π_2完全,并借助适用于量子与交换算子策略的无间隙压缩定理统一解释非局域博弈复杂度结果。

摘要:

我们研究了非局域博弈的复杂度与算术层级之间的联系,算术层级是根据定义语言的算术公式的复杂度对语言进行分类的一种体系。Ji、Natarajan、Vidick、Wright 和 Yuen 最近证明,判定一个非局域博弈的(有限维)量子值是 $1$ 还是至多 $\frac{1}{2}$ 对于类 $Σ_1$(即 $\mathsf{RE}$)是完全的。Slofstra 的一个结果意味着,判定一个非局域博弈的交换算子值是否等于 $1$ 对于类 $Π_1$(即 $\mathsf{coRE}$)是完全的。我们证明,判定一个双人非局域博弈的量子值是否恰好等于 $1$ 对于 $Π_2$ 是完全的;该类处于算术层级的第二层,对应于形如“$\forall x \\, \exists y \\, ϕ(x,y)$”的公式。这表明精确计算量子值严格难于近似计算它,也严格难于计算交换算子值(无论是精确计算还是近似计算)。我们解释了关于非局域博弈复杂度的结果如何都能以统一的方式从一种称为压缩的技术中得出。我们的 $Π_2$-完全性结果的核心是一个新的“无间隙”压缩定理,该定理对量子策略和交换算子策略都成立。我们的压缩定理作为一个副产品给出了 Slofstra 关于量子关联集合不闭合这一结果的另一种证明。我们还展示了交换算子策略的“保间隙”压缩定理将如何意味着近似计算交换算子值对于 $Π_1$ 是完全的。

英文摘要:

We investigate the connection between the complexity of nonlocal games and the arithmetical hierarchy, a classification of languages according to the complexity of arithmetical formulas defining them. It was recently shown by Ji, Natarajan, Vidick, Wright and Yuen that deciding whether the (finite-dimensional) quantum value of a nonlocal game is $1$ or at most $\frac{1}{2}$ is complete for the class $Σ_1$ (i.e., $\mathsf{RE}$). A result of Slofstra implies that deciding whether the commuting operator value of a nonlocal game is equal to $1$ is complete for the class $Π_1$ (i.e., $\mathsf{coRE}$). We prove that deciding whether the quantum value of a two-player nonlocal game is exactly equal to $1$ is complete for $Π_2$; this class is in the second level of the arithmetical hierarchy and corresponds to formulas of the form "$\forall x \, \exists y \, ϕ(x,y)$". This shows that exactly computing the quantum value is strictly harder than approximating it, and also strictly harder than computing the commuting operator value (either exactly or approximately). We explain how results about the complexity of nonlocal games all follow in a unified manner from a technique known as compression. At the core of our $Π_2$-completeness result is a new "gapless" compression theorem that holds for both quantum and commuting operator strategies. Our compression theorem yields as a byproduct an alternative proof of Slofstra's result that the set of quantum correlations is not closed. We also show how a "gap-preserving" compression theorem for commuting operator strategies would imply that approximating the commuting operator value is complete for $Π_1$.

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

↑