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

纠缠游戏不需要太多的纠缠(撤回)

Entangled games do not require much entanglement (withdrawn)

Gus Gutoski

摘要:

我们证明了一个明确的上限的纠缠量所需的任何战略在两个球员的合作游戏与经典的问题和量子答案。具体来说,我们证明了具有n比特问题和n量子比特答案的游戏的每一个策略都可以由共享不超过5 n量子比特的纠缠态的玩家精确地实现-这是一个最佳的限制,在5/2的因子内。在此之前,甚至连近似这种策略所需的纠缠量的上限都不知道。因此,计算这些博弈的价值的问题是NP问题,而以前这个问题并不知道是可计算的。

英文摘要:

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qubit answers can be implemented exactly by players who share an entangled state of no more than 5n qubits--a bound which is optimal to within a factor of 5/2. Previously, no upper bound at all was known on the amount of entanglement required even to approximate such a strategy. It follows that the problem of computing the value of these games is in NP, whereas previously this problem was not known to be computable.

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

↑