当前位置: X-MOL 学术Quantum Sci. Technol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Rigidity of the magic pentagram game.
Quantum Science and Technology ( IF 6.7 ) Pub Date : 2018-02-13 , DOI: 10.1088/2058-9565/aa931d
Amir Kalev 1 , Carl A Miller 1, 2
Affiliation  

A game is rigid if a near-optimal score guarantees, under the sole assumption of the validity of quantum mechanics, that the players are using an approximately unique quantum strategy. Rigidity has a vital role in quantum cryptography as it permits a strictly classical user to trust behavior in the quantum realm. This property can be traced back as far as 1998 (Mayers and Yao) and has been proved for multiple classes of games. In this paper we prove ridigity for the magic pentagram game, a simple binary constraint satisfaction game involving two players, five clauses and ten variables. We show that all near-optimal strategies for the pentagram game are approximately equivalent to a unique strategy involving real Pauli measurements on three maximally-entangled qubit pairs.

中文翻译:

五角星游戏的刚性。

如果在量子力学有效性的唯一假设下,接近最佳的分数可以保证玩家使用的是近似独特的量子策略,那么游戏就是僵化的。刚性在量子密码学中具有至关重要的作用,因为它允许严格的经典用户信任量子领域中的行为。该属性的历史可以追溯到1998年(Mayers和Yao),并且已经在多类游戏中得到证明。在本文中,我们证明了魔术五角星游戏的数字手指性,这是一个简单的二进制约束满足游戏,涉及两个参与者,五个子句和十个变量。我们表明,五角星游戏的所有近似最优策略都近似等于一个独特的策略,其中涉及对三个最大纠缠的量子位对的真实Pauli测量。
更新日期:2019-11-01
down
wechat
bug