Iterative Secret Key Rate Adapting with Error Minimization for Continuous-Variable Quantum Key Distribution
Laszlo Gyongyosi

TL;DR
This paper introduces an iterative method for optimizing secret key rates in multicarrier continuous-variable quantum key distribution, minimizing errors through adaptive sub-channel adjustments for practical implementation.
Contribution
It proposes a simple, iterative adaptation algorithm that optimizes secret key rates and minimizes errors in multicarrier CVQKD without complex computations.
Findings
Achieves target secret key rate with minimized error rate
Requires no complex calculations, suitable for experimental scenarios
Provides an easy-to-implement adaptive protocol
Abstract
We define an iterative error-minimizing secret key adapting method for multicarrier CVQKD. A multicarrier CVQKD protocol uses Gaussian subcarrier quantum continuous variables (CVs) for the transmission. The proposed method allows for the parties to reach a given target secret key rate with minimized error rate through the Gaussian sub-channels by a sub-channel adaption procedure. The adaption algorithm iteratively determines the optimal transmit conditions to achieve the target secret key rate and the minimal error rate over the sub-channels. The solution requires no complex calculations or computational tools, allowing for easy implementation for experimental CVQKD scenarios.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
