arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.02525quant-ph
收藏

将非定域博弈的近似最优量子策略舍入为使用最大纠缠态的策略

Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states

Connor Paddock

AI总结:

本文为BCS和XOR等非定域博弈建立了近似刚性结果,证明了近似最优量子策略可逼近使用最大纠缠态的策略,并将该结论推广至同步博弈类。

摘要:

我们为几类著名的非定域博弈族建立了近似刚性结果。特别地,我们证明了布尔约束系统(BCS)博弈的近似完美量子策略是对应BCS代数的近似表示。同样,对于XOR非定域博弈类,我们证明了近似最优量子策略是对应于该博弈最优量子值的*-代数的近似表示。在这两种情况下,近似表示均基于归一化Hilbert-Schmidt范数,且独立于策略中使用的Hilbert空间或量子态。我们还证明了BCS(分别地,XOR代数)的近似表示可为近似完美(分别地,近似最优)量子策略产生测量算子,其中玩家在博弈中使用最大纠缠态。作为推论,每个近似完美的BCS(分别地,近似最优的XOR)量子策略都接近于一个使用最大纠缠态的近似完美(分别地,近似最优)量子策略。最后,我们确立了每个同步代数都*-同构于某个称为SynchBCS代数的特定BCS代数。这使我们能够将BCS刚性结果同样应用于同步博弈类。

英文摘要:

We establish approximate rigidity results for several well-known families of nonlocal games. In particular, we show that near-perfect quantum strategies for boolean constraint system (BCS) games are approximate representations of the corresponding BCS algebra. Likewise, for the class of XOR nonlocal games, we show that near-optimal quantum strategies are approximate representations of the corresponding $*$-algebra associated with optimal quantum values for the game. In both cases, the approximate representations are with respect to the normalized Hilbert-Schmidt norm and independent of the Hilbert space or quantum state employed in the strategy. We also show that approximate representation of the BCS (resp.~XOR-algebra) yields measurement operators for near-perfect (resp.~near-optimal) quantum strategies where the players employ a maximally entangled state in the game. As a corollary, every near-perfect BCS (resp.~near-optimal XOR) quantum strategy is close to a near-perfect (resp.~near-optimal) quantum strategy using a maximally entangled state. Lastly, we establish that every synchronous algebra is $*$-isomorphic to a certain BCS algebra called the SynchBCS algebra. This allows us to apply our BCS rigidity results to the class of synchronous games as well.

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

↑