Extended non-local games and monogamy-of-entanglement games

Author:

Johnston Nathaniel12,Mittal Rajat3,Russo Vincent4ORCID,Watrous John45

Affiliation:

1. Department of Mathematics and Computer Science, Mount Allison University, Sackville, New Brunswick, Canada E4L 1E4

2. Institute for Quantum Computing, Department of Combinatorics and Optimization, Waterloo, Ontario, Canada N2L 3G1

3. Department of Computer Science and Engineering, IIT Kanpur, Kanpur, Uttar Pradesh 208016, India

4. Institute for Quantum Computing, School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

5. Canadian Institute for Advanced Research, Toronto, Ontario, Canada M5G 1Z8

Abstract

We study a generalization of non-local games—which we call extended non-local games —in which the players, Alice and Bob, initially share a tripartite quantum state with the referee. In such games, the winning conditions for Alice and Bob may depend on the outcomes of measurements made by the referee, on its part of the shared quantum state, in addition to Alice and Bob's answers to randomly selected questions. Our study of this class of games was inspired by the monogamy-of-entanglement games introduced by Tomamichel, Fehr, Kaniewski and Wehner, which they also generalize. We prove that a natural extension of the Navascués–Pironio–Acín hierarchy of semidefinite programmes converges to the optimal commuting measurement value of extended non-local games, and we prove two extensions of results of Tomamichel et al.  concerning monogamy-of-entanglement games.

Funder

Natural Sciences and Engineering Research Council of Canada

United States Army Research Office

Department of Science and Technology, India

Publisher

The Royal Society

Subject

General Physics and Astronomy,General Engineering,General Mathematics

Reference38 articles.

1. On the Einstein Podolsky Rosen paradox

2. Proposed Experiment to Test Local Hidden-Variable Theories

3. Ben-Or M Goldwasser S Kilian J Wigderson A. 1988 Multi-prover interactive proofs: how to remove intractability assumptions. In Proc. of the 20th Annu. ACM Symp. on Theory of Computing Chicago IL 2–4 May 1988 pp. 113–131. New York NY: ACM.

4. Fortnow L. 1989 Complexity-theoretic aspects of interactive proof systems. PhD dissertation Massachusetts Institute of Technology Cambridge MA USA.

5. Non-deterministic exponential time has two-prover interactive protocols

Cited by 12 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3