Data post-processing for the one-way heterodyne protocol under composable finite-size security
Alexander George Mountogiannakis, Panagiotis Papanastasiou, Stefano, Pirandola

TL;DR
This paper analyzes and optimizes the post-processing steps, including error correction and privacy amplification, for a practical continuous-variable quantum key distribution protocol under finite-size security assumptions, supported by simulations and a Python library.
Contribution
It introduces a detailed simulation and optimization of post-processing in CV-QKD with finite-size security, including a Python library for implementation.
Findings
Optimized parameters improve key rates in practical CV-QKD.
High-rate non-binary LDPC codes enhance error correction efficiency.
Simulation results demonstrate feasibility of secure key generation under realistic conditions.
Abstract
The performance of a practical continuous-variable (CV) quantum key distribution (QKD) protocol depends significantly, apart from the loss and noise of the quantum channel, on the post-processing steps which lead to the extraction of the final secret key. A critical step is the reconciliation process, especially when one assumes finite-size effects in a composable framework. Here, we focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. We simulate the quantum communication process and we post-process the output data by applying parameter estimation, error correction (using high-rate, non-binary low-density parity-check codes), and privacy amplification. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above. We also present an…
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.
