Papers
Topics
Authors
Recent
Search
2000 character limit reached

High Performance Information Reconciliation for QKD with CASCADE

Published 30 Jul 2013 in quant-ph | (1307.7829v1)

Abstract: It is widely accepted in the quantum cryptography community that interactive information reconciliation protocols, such as cascade, are ineffcient due to the communication overhead. Instead, non-interactive information reconciliation protocols based on i.e. LDPC codes or, more recently, polar codes have been proposed. In this work, we argue that interactive protocols should be taken into consideration in modern quantum key distribution systems. In particular, we demonstrate how to improve the performance of cascade by proper implementation and use. Our implementation of cascade reaches a throughput above 80 Mbps under realistic conditions. This is more than four times the throughput previously demonstrated in any information reconciliation protocol.

Citations (43)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.