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.
Sum-of-squares decompositions for a family of CHSH-like inequalities and their application to self-testing
我们介绍了两个家庭的平方和(SOS)分解的贝尔运营商与倾斜的CHSH表达式在物理学评论快报。108,100402(2012)。这些SOS分解提供了严格的上限这些贝尔表达式的最大量子值。此外,它们建立了任何量子态和产生最佳量子值的可观测量都必须满足的代数关系。然后使用这些代数关系来表明倾斜的CHSH表达式为任何部分纠缠的两量子比特状态提供了强大的自测试。这个自我测试的应用程序紧密遵循Phys. Rev. A 87,050102(2013)的方法,在那里我们识别并纠正了两个重要的缺陷。
Bayesian rational agents in iterated quantum games
Center for Quantum Information and Control, University of New Mexico(新墨西哥大学量子信息与控制中心);Department of Physics and Astronomy, Tufts University(塔夫茨大学物理与天文学系)
Robust self-testing of multipartite GHZ-state measurements in quantum networks
自我测试是基于观察到的统计数据的相关性对量子设备进行的独立于设备的检查。出于优雅的进展自我测试策略的测量[物理。121,250507(2018)]和状态[New J. Phys. 20,083041(2018)],我们开发了一个通用的自测试程序,用于多体广义GHZ状态测量。对于一般的N比特多体GHZ态测量,其关键步骤是自测试所有的测量本征态。按照我们的方法,我们只需要对N-2个选择的N-部本征态进行局域测量,并对剩下的两个本征态保持最大违反倾斜的Clauser-Horne-Shimony-Holt(CHSH)贝尔不等式.此外,从实验的角度来看,这种方法是物理操作的。结果表明,三量子比特GHz态测量的现有结果作为特例得到了恢复。同时,我们开发了自测试方法,对一定的白噪声具有鲁棒性。
Quantum strategies, error bounds, optimality, and duality gaps for multiplayer XOR, $\mathrm{XOR}^{*}$, compiled XOR, $\mathrm{XOR}^{*}$, and strong parallel repetiton of XOR, $\mathrm{XOR}^{*}$, and FFL games
Beyond real: Investigating the role of complex numbers in self-testing
Quantum Science Center of Guangdong-HongKong-Macao Greater Bay Area(粤港澳大湾区量子科学中心);QMATH, Department of Mathematical Sciences, University of Copenhagen(哥本哈根大学数学科学系 QMATH);Department of Mathematics, University of Auckland(奥克兰大学数学系)