AI 中文总结
本文研究QKD网络的拓扑，将其特性转化为图结构，提出成本函数筛选可靠高效的图族，结合实际性能数据说明SKR对损耗的敏感性，还给出连接小图构建大型高效图的方法。
AI 中文摘要
量子密钥分发（QKD）是一种在远程端点间分发加密密钥的方法，其安全性基于量子物理学。本文迈出了研究QKD网络拓扑的第一步，QKD网络对可靠性和效率有若干要求特性，我们将此类特性以图结构的形式表达。为比较潜在图，我们描述了成本函数，可借此识别可靠且高效的图族。为使讨论贴合实际，我们汇总了现场报告的代表性QKD性能数据，并说明密钥速率（SKR）对额外损耗的敏感程度。最后，我们提出通过连接较小图来构建大型高效图的方法。
英文摘要
Quantum key distribution (QKD) is a method for distributing cryptographic keys between remote endpoints, enjoying security based on quantum physics. This paper makes a first step towards studying topologies for QKD networks. QKD networks imply several required characteristics for their reliability and efficiency. We express such properties in terms of graph structure. For the comparison of potential graphs, we describe cost functions that allow us to identify families of graphs that are reliable and efficient. To make the discussion realistic, we summarize representative field-reported QKD performance numbers and illustrate the sensitivity of secret-key rate (SKR) to a few dB of additional loss. Last, we present methods to construct large efficient graphs through connecting smaller graphs.
CommentsAccepted to International conference on Network and Service Management (CNSM) 2026: Mini-conference track
