arXiv subjects

Gabriele Staffieri

Publications and source records attributed to Gabriele Staffieri.

3 recordsLinked to original sources

arXiv2026

Preprocessing noise in finite-size quantum key distribution

It is known that preprocessing noise may boost quantum key distribution by expanding the range of values of tolerated noise. For BB84, adding trusted noise may allow the generation of secret keys even for qubit error rate (QBER) beyond the 11% threshold in the asymptotic regime. Here we study the effect of preprocessing noise in the finite-size regime where only a limited number of signals are exchanged between Alice and Bob. We compute tight numerical lower bounds in terms of the sandwiched R\'enyi entropy of order alpha, optimized via a two-step Frank-Wolfe algorithm, in the presence of a trusted flipping probability q. We find that trusted noise improves the key rate only for a finite interval of alpha, from the alpha -> 1 limit up to alpha approx 1.4. By optimizing on the value of alpha, we determine finite-size key rates for different values of the QBER, observing enhancement due to trusted noise both in asymptotic and finite-size regimes. Finally, we determine the maximum tolerable QBER as a function of the block size.

quant-ph↗

arXiv2026

Finite-size security of QKD: comparison of three proof techniques

We compare three proof techniques for composable finite-size security of quantum key distribution under collective attacks, with emphasis on how the resulting secret-key rates behave at practically relevant block lengths. As a benchmark, we consider the BB84 protocol and evaluate finite-size key-rate estimates obtained from entropic uncertainty relations (EUR), from the asymptotic equipartition property (AEP), and from a direct finite-block analysis based on the conditional min-entropy, which we refer to as the finite-size min-entropy (FME) approach. For BB84 we show that the EUR-based bound provides the most favorable performance across the considered parameter range, while the AEP bound is asymptotically tight but can become overly pessimistic at moderate and small block sizes, where it may fail to certify a positive key. The FME approach remains effective in this small-block regime, yielding nonzero rates in situations where the AEP estimate vanishes, although it is not asymptotically optimal for BB84. These results motivate the use of FME-type analyses for continuous-variable protocols in settings where tight EUR-based bounds are unavailable, notably for coherent-state schemes where current finite-size analyses typically rely on AEP-style corrections.

quant-ph↗

arXiv2025

Finite-size secret-key rates of discrete modulation continuous-variable quantum key distribution under Gaussian attacks

Quantum conditional entropies play a fundamental role in quantum information theory. In quantum key distribution, they are exploited to obtain reliable lower bounds on the secret-key rates in the finite-size regime, against collective attacks and coherent attacks under suitable assumptions. Here we consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states, and the receiver Bob decodes by homodyne or heterodyne detection. We compute the Petz-R\'enyi and sandwiched R\'enyi conditional entropies associated with these setups, assuming either a passive eavesdropper or one that injects thermal photons into the channel, who gathers the quantum information leaked through a lossy communication line of known or bounded transmittance. Whereas our results do not directly provide reliable key-rate estimates, they do represent useful ball-park figures. We obtain analytical or semi-analytical expressions that do not require intensive numerical calculations. These expressions serve as bounds on the key rates that may be tight in certain scenarios. We compare different estimates, including known bounds that have already appeared in the literature and new bounds. The latter are found to be tighter for very short block sizes.

quant-ph↗