A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Finite-size security proof for discrete-modulated CV-QKD under general attacks using dimension reduction and entropy accumulation yields positive rates at block sizes of order 10^8.
Overview of recent analytical and numerical developments in QKD security proofs that incorporate imperfections to re-establish security under realistic conditions.
citing papers explorer
-
Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization
A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
-
Effective discrete-modulated continuous variable QKD under general attacks
Finite-size security proof for discrete-modulated CV-QKD under general attacks using dimension reduction and entropy accumulation yields positive rates at block sizes of order 10^8.
-
Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
Overview of recent analytical and numerical developments in QKD security proofs that incorporate imperfections to re-establish security under realistic conditions.