Paper detail

Optimization of QKD Networks with Classical and Quantum Annealing

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.