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

Vaidman型博弈中部分纠缠态的有效性分析及其在量子秘密共享中的应用

Analysing the efficiency of partially entangled states in Vaidman's-type games and its applications in Quantum Secret Sharing

Hargeet Kaur, Atul Kumar

摘要:

我们分析了在玩家共享一组部分纠缠的三量子比特态的情况下,Vaidman博弈的纠缠度的作用。我们的结果表明,纠缠态结合量子策略可能并不总是有助于赢得比赛,而不是经典的策略。我们进一步发现量子策略总是有助于在游戏中实现更高的获胜概率相比,经典策略的条件。此外,我们表明,一个特殊的类的W状态总是可以用来赢得游戏使用量子策略,而不管三个量子比特之间的纠缠度。我们的分析也有助于我们比较Vaidman的游戏与秘密共享协议。此外,我们提出了一个新的Vaidman型的游戏,规则制定者本身是纠缠与其他两个球员,并作为一个促进者与两个球员分享一个秘密的密钥。出于实用的目的,分析扩展到研究所提出的游戏在嘈杂的条件下。此外,所得结果也推广到了多量子比特博弈。

英文摘要:

We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be always helpful in winning a game as opposed to the classical strategies. We further find the conditions under which quantum strategies are always helpful in achieving higher winning probability in the game in comparison to classical strategies. Moreover, we show that a special class of W states can always be used to win the game using quantum strategies irrespective of the degree of entanglement between the three qubits. Our analysis also helps us in comparing the Vaidman's game with the secret sharing protocol. Furthermore, we propose a new Vaidman-type game where the rule maker itself is entangled with the other two players and acts as a facilitator to share a secret key with the two players. For practical purposes, the analysis is extended to study the proposed game under noisy conditions. In addition, the results obtained here are also generalized for multi-qubit games.

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

↑