arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.01593quant-ph
收藏

CHSH的推广及最优策略的代数结构

A generalization of CHSH and the algebraic structure of optimal strategies

David Cui, Arthur Mehta, Hamoon Mousavi, Seyed Sajjad Nezhadi

摘要:

自检测是量子信息理论中一个重要的研究领域。它允许实验者与黑箱量子系统进行经典交互,并测试特定的纠缠态是否存在,并进行特定的测量。最近,自我测试一直是复杂性理论中备受瞩目的结果的核心,如Natarajan和Vidick的纠缠游戏PCP(FOCS 2018),Fitzsimons等人的迭代压缩(STOC 2019)以及Natarajan和Wright的MIP* 中的NEEXP(FOCS 2019)。在这项工作中,我们介绍了一个代数推广CHSH视为一个线性约束系统(LCS)的游戏,表现出自我测试性质是定性不同的。这些提供了非本地游戏的第一个例子,该游戏自我测试非泡利算子,解决了Coladangelo和Stark提出的一个悬而未决的问题(QIP 2017)。我们的游戏还为最大纠缠态以外的状态提供了自我测试,从而解决了Cleve和Mittal提出的开放问题(ICALP 2012)。此外,我们的游戏有1位的问题和$\log n$位的答案长度,使它们成为复杂性理论应用的合适候选者。这项工作是第一步走向自我测试任意群体的一般理论。为了得到我们的结果,我们利用平方和证明,非交换环理论,和近似表示理论的Gowers-Hatami定理之间的联系。我们分析的一个关键部分是引入一个平方和框架,将Cleve,Liu和Slofstra的\emph{solution group}(数学物理杂志2017)推广到非伪心灵感应机制。最后,我们给出了第一个不是自我测试的游戏的例子。我们的研究结果表明,自我测试现象比以前认为的更丰富的景观。

英文摘要:

Self-testing has been a rich area of study in quantum information theory. It allows an experimenter to interact classically with a black box quantum system and to test that a specific entangled state was present and a specific set of measurements were performed. Recently, self-testing has been central to high-profile results in complexity theory as seen in the work on entangled games PCP of Natarajan and Vidick (FOCS 2018), iterated compression by Fitzsimons et al. (STOC 2019), and NEEXP in MIP* due to Natarajan and Wright (FOCS 2019). In this work, we introduce an algebraic generalization of CHSH by viewing it as a linear constraint system (LCS) game, exhibiting self-testing properties that are qualitatively different. These provide the first example of non-local games that self-test non-Pauli operators resolving an open questions posed by Coladangelo and Stark (QIP 2017). Our games also provide a self-test for states other than the maximally entangled state, and hence resolves the open question posed by Cleve and Mittal (ICALP 2012). Additionally, our games have 1 bit question and $\log n$ bit answer lengths making them suitable candidates for complexity theoretic application. This work is the first step towards a general theory of self-testing arbitrary groups. In order to obtain our results, we exploit connections between sum of squares proofs, non-commutative ring theory, and the Gowers-Hatami theorem from approximate representation theory. A crucial part of our analysis is to introduce a sum of squares framework that generalizes the \emph{solution group} of Cleve, Liu, and Slofstra (Journal of Mathematical Physics 2017) to the non-pseudo-telepathic regime. Finally, we give the first example of a game that is not a self-test. Our results suggest a richer landscape of self-testing phenomena than previously considered.

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

↑