基于切线界的简单QKD密钥率计算
Simple QKD keyrate computations from tangent-line bounds
浏览论文内容
中文总结 AI 辅助
本文提出一种基于切线界的简单方法，利用现成求解器计算基本QKD协议（如BB84和六态协议）的有限尺寸密钥率，并推导了六态协议的单轮Rényi熵闭式表达式。
中文摘要 AI 辅助
量子密钥分发（QKD）领域近期的研究，利用熵累积框架，基于凸优化问题得出了有限尺寸密钥率。近年来，多个求解器被开发出来以解决这些优化问题，但它们基于一个较为复杂的框架，使用复杂的算法，以适应广泛的QKD协议。在这项工作中，我们注意到对于基本的QKD协议，如量子比特BB84，通过获得目标函数中下界项的合适切线，可以轻松地使用现成的求解器来计算密钥率。我们计算了由此得到的有限尺寸密钥率，并与先前的工作进行了比较。此外，我们将这种方法扩展到六态协议，通过推导该协议中单轮Rényi熵的闭式表达式。这将有助于后续通过熵累积对六态协议进行研究。
英文摘要
Recent work in quantum key distribution (QKD) has yielded finite-size keyrates based on convex optimisation problems, using the framework of entropy accumulation. Multiple solvers have been developed to address these optimisations in recent years, but have been based on a somewhat elaborate framework using sophisticated algorithms, in order to accommodate a broad range of QKD protocols. In this work, we note that for basic QKD protocols such as qubit BB84, the keyrates can be easily computed using off-the-shelf solvers instead, by obtaining suitable tangent lines to lower bound terms in the objective function. We compute the resulting finite-size keyrates and compare them to previous work. Moreover, we extend this approach to the six-state protocol, by deriving closed-form expressions for the single-round Rényi entropies in the protocol. This should facilitate subsequent study of the six-state protocol via entropy accumulation.
发表机构
- National University of Singapore（新加坡国立大学）
机构由 AI 辅助整理，请以论文原文为准。
