Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation

TL;DR

CVQKD has been limited to short distances because extracting keys from continuous data is difficult and Gaussian-modulation approaches fail over long channels. The paper introduces a discretely modulated, reverse-reconciled protocol with an unconditional security proof and low-SNR error correction, enabling secret-key distribution over longer distances.

• Problem

  CVQKD remains restricted to short distances because classical post-processing of continuous shared data is more complicated than its discrete counterpart, while Gaussian-modulation approaches fail over a few tens of kilometers.

• Method

  The paper combines discrete modulation, reverse reconciliation, an unconditional security proof, and low-SNR error-correcting codes based on concatenated capacity-achieving and repetition codes.

• Results

  The four-state protocol is unconditionally secure and can distill secret keys at long distances by maintaining high reconciliation efficiency at very low SNR.

• Takeaways & Limitations

  Discrete modulation with efficient low-SNR reconciliation makes long-distance CVQKD possible, while Gaussian modulation remains better suited to high key rates at short distances.

• Takeaways & Limitations

  With state-of-the-art coding, Gaussian modulation was not expected to extend the protocol well over 30 kilometers, and breaking a 50-kilometer limit seemed unlikely.