No-signaling quantum key distribution: solution by linear programming

From MaRDI portal
Publication:2018187

DOI10.1007/S11128-014-0880-1zbMATH Open1311.81095DBLPjournals/qip/HwangBK15arXiv1202.3822OpenAlexW2064852719WikidataQ59443962 ScholiaQ59443962MaRDI QIDQ2018187FDOQ2018187


Authors: Joonwoo Bae, Nathan Killoran, Won Young Hwang Edit this on Wikidata


Publication date: 13 April 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We outline a straightforward approach for obtaining a secret key rate using only no-signaling constraints and linear programming. Assuming an individual attack, we consider all possible joint probabilities. Initially, we study only the case where Eve has binary outcomes, and we impose constraints due to the no-signaling principle and given measurement outcomes. Within the remaining space of joint probabilities, by using linear programming, we get bound on the probability of Eve correctly guessing Bob's bit. We then make use of an inequality that relates this guessing probability to the mutual information between Bob and a more general Eve, who is not binary-restricted. Putting our computed bound together with the Csisz'ar-K"orner formula, we obtain a positive key generation rate. The optimal value of this rate agrees with known results, but was calculated in a more straightforward way, offering the potential of generalization to different scenarios.


Full work available at URL: https://arxiv.org/abs/1202.3822




Recommendations




Cites Work






This page was built for publication: No-signaling quantum key distribution: solution by linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018187)