Efficient reconciliation protocol for discrete-variable quantum key distribution
David Elkouss,Anthony Leverrier,Romain Alléaume,Joseph J. Boutros +3 more
- 28 Jun 2009
- pp 1879-1883
TL;DR: In this paper, a low density parity check (LDPC) code optimized for the binary symmetric channel (BSC) was proposed for discrete-variable QKD protocols.
read more
Abstract: 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 binary symmetric channel (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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Physical-Layer Security: From Information Theory to Security Engineering
Matthieu R. Bloch,Joao Barros +1 more
- 22 Sep 2011
TL;DR: In this article, the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication are presented, using a bottom-up approach from the link level all the way to end-to-end architectures.
860
Satellite-Based Continuous-Variable Quantum Communications: State-of-the-Art and a Predictive Outlook
TL;DR: The imminent extension of space-based quantum communication to the continuous-variable regime offers the potential for increased communication performance, and represents the next major step forward for quantum communications and the development of the global quantum Internet.
•Posted Content
Security in Quantum Cryptography.
TL;DR: In this article, the authors review the physical notion of security, focusing on quantum key distribution and secure communication, and show that the security of quantum cryptography relies entirely on the laws of quantum mechanics.
177
High performance error correction for quantum key distribution using polar codes
TL;DR: Polar codes for quantum key distribution exhibit excellent decoding speed, much higher than large, irregular Low Density Parity Check (LDPC) codes implemented on similar hardware, and competitive with implementations of the same codes on high-end Graphic Processing Units (GPUs).
126
•Posted Content
Quantum Communication Using Semiconductor Quantum Dots
TL;DR: In this article, a review of quantum communication using quantum-light sources based on epitaxial semiconductor quantum dots is presented, focusing on implementations of, and building blocks for, quantum communication.
121
References
•Book
Low-Density Parity-Check Codes
Robert G. Gallager
- 01 Jan 1963
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Quantum Cryptography
TL;DR: The author revealed that quantum teleportation as “Quantum one-time-pad” had changed from a “classical teleportation” to an “optical amplification, privacy amplification and quantum secret growing” situation.
The wire-tap channel
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
7.9K
Quantum cryptography
TL;DR: A protocol for coin-tossing by exchange of quantum messages is presented, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.
6.2K