This paper analyses a classical and a quantum annealing approach to compute the minimum deployment of Quantum Key Distribution (QKD) hardware in a tier 1 provider network. The ensemble of QKD systems needs to be able to exchange as many encryption keys between all network nodes in order to encrypt the data payload, which is defined by traffic demand matrices. Redundancy and latency requirements add additional boundary conditions. The result of the optimization problem yields a classical heuristic network planners may utilize for planning future QKD quantum networks.
翻译:本文分析了计算第一级供应商网络中量子键分布(QKD)硬件最低部署量的古典和量子整流法。QKD系统的组合需要能够在所有网络节点之间交换尽可能多的加密键,以对数据有效载荷进行加密,数据有效载荷由交通需求矩阵定义。冗余和延缓要求增加了额外的边界条件。优化问题的结果是产生了传统的超常网络规划者可用于规划未来的QKD量子网络。