Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Analysis of the Trusted‐Device Scenario in Continuous‐Variable Quantum Key Distribution

Analysis of the Trusted‐Device Scenario in Continuous‐Variable Quantum Key Distribution The assumption that detection and/or state preparation devices used for continuous‐variable quantum key distribution are beyond influence of potential eavesdroppers leads to a significant performance enhancement in terms of achievable key rate and transmission distance. A detailed and comprehensible derivation of the Holevo bound in this so‐called trusted‐device scenario is provided. Modeling an entangling‐cloner attack and using some basic algebraic matrix transformations, it is shown 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, a numerical evaluation of our results is provided, illustrating the counter‐intuitive fact that an appropriate amount of trusted‐receiver loss and noise can even be beneficial for the key rate. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Advanced Quantum Technologies Wiley

Analysis of the Trusted‐Device Scenario in Continuous‐Variable Quantum Key Distribution

Loading next page...
 
/lp/wiley/analysis-of-the-trusted-device-scenario-in-continuous-variable-quantum-rNKKgN0nyo
Publisher
Wiley
Copyright
© 2019 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim
eISSN
2511-9044
DOI
10.1002/qute.201900055
Publisher site
See Article on Publisher Site

Abstract

The assumption that detection and/or state preparation devices used for continuous‐variable quantum key distribution are beyond influence of potential eavesdroppers leads to a significant performance enhancement in terms of achievable key rate and transmission distance. A detailed and comprehensible derivation of the Holevo bound in this so‐called trusted‐device scenario is provided. Modeling an entangling‐cloner attack and using some basic algebraic matrix transformations, it is shown 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, a numerical evaluation of our results is provided, illustrating the counter‐intuitive fact that an appropriate amount of trusted‐receiver loss and noise can even be beneficial for the key rate.

Journal

Advanced Quantum TechnologiesWiley

Published: Nov 1, 2019

Keywords: ; ; ; ;

References