论文标题
部分可观测时空混沌系统的无模型预测
Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
论文作者
论文摘要
在存在损失的情况下，结合经典信息和量子信息的量子位置验证的协议（QPV）是不安全的。我们研究了基于BB84州的QPV最受欢迎的方案的确切损失耐受性以及该协议的概括。通过使用SemideFinite编程（SDP）界定一夫一妻制游戏的变体的获胜概率，我们发现了这些扩展的非本地游戏的损失与错误之间的关系紧密界限。 这些新界限可以使用更现实的实验参数来使用QPV协议。我们展示了这些结果如何转移到变体协议中，该协议将$ n $的经典信息与单个量子组结合在一起，从而显示了一项协议，即使在存在适度的光子损失的情况下，也可以针对线性纠缠（在经典信息$ n $中）进行线性量。此外，即使编码值编码的光纤中的光子传播的光子在光纤中，该协议也保持安全。我们还将这一分析扩展到两个以上的碱基，显示了该情况更强大的损失。 最后，由于我们的半明确程序界限了一个单式游戏游戏，因此我们描述了如何应用它们来改善单方面独立于QKD协议的分析。
Protocols for quantum position verification (QPV) which combine classical and quantum information are insecure in the presence of loss. We study the exact loss-tolerance of the most popular protocol for QPV, which is based on BB84 states, and generalizations of this protocol. By bounding the winning probabilities of a variant of the monogamy-of-entanglement game using semidefinite programming (SDP), we find tight bounds for the relation between loss and error for these extended non-local games. These new bounds enable the usage of QPV protocols using more-realistic experimental parameters. We show how these results transfer to the variant protocol which combines $n$ bits of classical information with a single qubit, thereby exhibiting a protocol secure against a linear amount of entanglement (in the classical information $n$) even in the presence of a moderate amount of photon loss. Moreover, this protocol stays secure even if the photon encoding the qubit travels arbitrarily slow in an optical fiber. We also extend this analysis to the case of more than two bases, showing even stronger loss-tolerance for that case. Finally, since our semi-definite program bounds a monogamy-of-entanglement game, we describe how they can also be applied to improve the analysis of one-sided device-independent QKD protocols.
