论文标题
用经典和量子退火优化QKD网络
Optimization of QKD Networks with Classical and Quantum Annealing
论文作者
论文摘要
本文分析了一种经典和量子退火方法，以计算1级提供商网络中量子密钥分布（QKD）硬件的最小部署。 QKD系统的集合需要能够在所有网络节点之间交换尽可能多的加密密钥，以加密数据有效负载，该数据有效载荷由流量需求矩阵定义。冗余和延迟要求增加了其他边界条件。优化问题的结果产生了经典的启发式网络计划者可以用于计划未来的QKD量子网络。
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.
