# Analysis of the trusted-device scenario in continuous-variable quantum key distribution

## TL;DR

This paper derives a simplified method to calculate the Holevo bound in trusted-device CV-QKD scenarios, revealing that certain trusted noise and loss can enhance key rates.

## Contribution

It provides a new, less complex derivation of the Holevo bound for trusted-device CV-QKD, applicable regardless of trusted-noise sources.

## Key findings

- Derivation reduces to solving a quadratic equation.
- Trusted noise and loss can improve key rate.
- Mathematical complexity remains constant with trusted-noise sources.

## Abstract

The assumption that detection and/or state-preparation devices used for continuous-variable quantum key distribution (CV-QKD) are beyond influence of potential eavesdroppers leads to a significant performance enhancement in terms of achievable key rate and transmission distance. We provide a detailed and comprehensible derivation of the Holevo bound in this so-called trusted-device scenario. Modelling an entangling-cloner attack and using some basic algebraic matrix transformations, we show that the computation of the Holevo bound can be reduced to the solution of a quadratic equation. As an advantage of our derivation, the mathematical complexity of our solution does not increase with the number of trusted-noise sources. Finally, we provide a numerical evaluation of our results, illustrating the counter-intuitive fact that an appropriate amount of trusted receiver loss and noise can even be beneficial for the key rate.