Efficient reconciliation protocol for discrete-variable quantum key distribution

Details Efficient reconciliation protocol for discrete-variable quantum key distribution Efficient reconciliation protocol for discrete-variable quantum key distribution

2009-01-14

arxiv.org/abs/0901.2140v1

Computer Science

Information Theory

Scientific paper

10.1109/ISIT.2009.5205475

Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.

Affiliated with

Also associated with

No associations

Rating

Efficient reconciliation protocol for discrete-variable quantum key distribution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient reconciliation protocol for discrete-variable quantum key distribution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient reconciliation protocol for discrete-variable quantum key distribution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-589168