Continuous-mode analysis of improved two-way CV-QKD

Continuous-variable quantum key distribution (CV-QKD) enables information-theoretically secure key generation between legitimate parties. To further enhance system performance, an improved two-way CV-QKD protocol has been proposed, which is accessible in practice and exhibits increased robustness against excess noise. However, in practical implementations, device nonidealities inevitably drive the optical field from the single-mode regime into the continuous-mode regime. In this work, we introduce temporal modes to characterize the evolution of optical fields in the improved two-way protocol and establish a security analysis framework for the continuous-mode scenario based on adaptive normalization with calibrated shot-noise unit. In addition, finite-size effects are taken into account in the analysis. Our results demonstrate that the improved two-way protocol retains a performance advantage over one-way counterpart. The analysis provides useful guidance for the practical implementation and performance optimization of improved two-way CV-QKD systems.

💡 Research Summary

This paper presents a comprehensive security and performance analysis of an improved two‑way continuous‑variable quantum key distribution (CV‑QKD) protocol when the optical fields are described in the continuous‑mode regime rather than the idealized single‑mode picture. The authors begin by motivating the need for such an analysis: practical laser sources, modulators, and detectors inevitably introduce temporal and spectral structure that forces the transmitted quantum states to occupy a continuum of modes. To capture this, they introduce the temporal‑mode (TM) formalism, defining creation and annihilation operators for arbitrary wave‑packets ξ(t) and showing how a continuous‑mode coherent state |α⟩_ξ is generated by acting with the TM creation operator on vacuum.

A key technical contribution is the adaptive shot‑noise unit (SNU) normalization. Because the local oscillator, filtering, sampling interval, and digital signal processing (DSP) algorithms all affect the measured variance, the authors derive an expression for the effective SNU σ_SNU that depends on the LO photon number, the LO envelope, the detector impulse response, and the DSP weighting coefficients. This allows the raw detector output to be converted into a physically meaningful quadrature measurement that faithfully reflects the underlying continuous‑mode field.

The security proof proceeds by constructing an entanglement‑based (EB) representation that is equivalent to the prepare‑and‑measure (PM) scheme. Bob prepares a two‑continuous‑mode squeezed vacuum (TCMSV) with variance V_B, keeps one mode, and sends the other to Alice. Alice likewise prepares a TCMSV with variance V_A, heterodynes one mode, and interferes the retained mode with the incoming mode on a beam splitter of transmittance T_A. The interference of continuous‑mode fields introduces four distinct mode‑matching coefficients: η_BA^m and η_AA^m for Alice’s detection, and η_BB^m and η_AB^m for Bob’s detection. These coefficients quantify the overlap between the actual measured TM and the ideal TM of each incoming field, and they are mathematically modeled as effective beam‑splitter losses. By incorporating these coefficients, the authors obtain a complete covariance matrix that includes both channel loss and mode‑matching inefficiencies.

Finite‑size effects are then rigorously treated. From the total number of exchanged signals N, a subset m is allocated to parameter estimation, leaving n = N – m for key generation. The authors adopt a worst‑case confidence‑interval approach: the estimated channel transmittance t̂ and excess noise σ̂² are treated as random variables following normal and chi‑square distributions, respectively. By splitting the total failure probability ε_PE equally between the two parameters, they derive lower bounds t_min and upper bounds σ²_max that hold with probability 1 – ε_PE. These bounds are inserted into the Holevo information χ_BE and the mutual information I_AB to compute a finite‑size secret‑key rate
K_finite = (n/N)