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

基于纠缠一夫一妻性博弈的量子密钥分发的设备无关安全性

Device independent security of quantum key distribution from monogamy-of-entanglement games

Enrique Cervero-Martín, Marco Tomamichel

AI总结:

本文基于纠缠一夫一妻性博弈提出通用设备无关量子密钥分发协议,给出信息论安全证明,并以魔方博弈为例数值优化密钥率,证明其对约2.2%以下去极化噪声具有鲁棒性。

摘要:

我们分析了两方非局域博弈,其谓词要求 Alice 和 Bob 生成匹配比特,以及它们的三方扩展,其中第三个玩家接收所有输入并被要求输出一个与原始玩家匹配的比特。我们为满足纠缠一夫一妻性性质的此类非局域博弈子集提出了一个通用的设备无关量子密钥分发协议,该性质由博弈的两方版本和三方版本之间最大获胜概率的差距来表征。这一差距源于两个玩家的最优策略需要纠缠,而由于纠缠的一夫一妻性,该纠缠无法与任何额外玩家共享。仅基于纠缠一夫一妻性性质,我们给出了协议信息论安全性的简单证明。最后,我们以魔方博弈为例,数值优化了我们协议的有限和渐近密钥率,并为此提供了三方量子最大获胜概率的数值上界,该上界与两方经典获胜概率非常接近。此外,我们证明了我们的协议对于约 2.2% 以下的去极化噪声具有鲁棒性,为基于魔方博弈的量子密钥分发针对一般攻击提供了首个此类界限。

英文摘要:

We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the original players. We propose a general device independent quantum key distribution protocol for the subset of such non-local games that satisfy a monogamy-of-entanglement property characterised by a gap in the maximum winning probability between the bipartite and tripartite versions of the game. This gap is due to the optimal strategy for two players requiring entanglement, which due to its monogamy property cannot be shared with any additional players. Based solely on the monogamy-of-entanglement property, we provide a simple proof of information theoretic security of our protocol. Lastly, we numerically optimize the finite and asymptotic secret key rates of our protocol using the magic square game as an example, for which we provide a numerical bound on the maximal tripartite quantum winning probability which closely matches the bipartite classical winning probability. Further, we show that our protocol is robust for depolarizing noise up to about $2.2\%$, providing the first such bound for general attacks for magic square based quantum key distribution.

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

↑