Andrés González Lorente

Computing key rates in QKD numerically is essential to unlock more powerful protocols, that uses more sophisticated measurement bases or quantum systems of higher dimension. It is a difficult optimization problem, that depends on minimizing a convex non-linear function, the relative entropy. The gold standard for solving such problems is a primal-dual interior-point algorithm, that is highly efficient and inherently gives upper and lower bounds. Recently one such algorithm was discovered for non-symmetric cones, a category that includes the relative entropy, and was previously out of reach.