scispace - formally typeset
Open AccessJournal ArticleDOI

Quantum key distribution using gaussian-modulated coherent states

Reads0
Chats0
TLDR
This work proposes and experimentally demonstrate a quantum key distribution protocol based on the transmission of gaussian-modulated coherent states and shot-noise-limited homodyne detection, which is in principle secure for any value of the line transmission, against gaussian individual attacks based on entanglement and quantum memories.
Abstract
Quantum continuous variables are being explored as an alternative means to implement quantum key distribution, which is usually based on single photon counting. The former approach is potentially advantageous because it should enable higher key distribution rates. Here we propose and experimentally demonstrate a quantum key distribution protocol based on the transmission of gaussian-modulated coherent states (consisting of laser pulses containing a few hundred photons) and shot-noise-limited homodyne detection; squeezed or entangled beams are not required. Complete secret key extraction is achieved using a reverse reconciliation technique followed by privacy amplification. The reverse reconciliation technique is in principle secure for any value of the line transmission, against gaussian individual attacks based on entanglement and quantum memories. Our table-top experiment yields a net key transmission rate of about 1.7 megabits per second for a loss-free line, and 75 kilobits per second for a line with losses of 3.1 dB. We anticipate that the scheme should remain effective for lines with higher losses, particularly because the present limitations are essentially technical, so that significant margin for improvement is available on both the hardware and software.

read more

Citations
More filters
Journal ArticleDOI

Quantum Information with Continuous Variables

TL;DR: In this article, the authors present the Deutsch-Jozsa algorithm for continuous variables, and a deterministic version of it is used for quantum information processing with continuous variables.
Journal ArticleDOI

The security of practical quantum key distribution

TL;DR: Essential theoretical tools that have been developed to assess the security of the main experimental platforms are presented (discrete- variable, continuous-variable, and distributed-phase-reference protocols).
Journal ArticleDOI

Gaussian quantum information

TL;DR: This review focuses on continuous-variable quantum information processes that rely on any combination of Gaussian states, Gaussian operations, and Gaussian measurements, including quantum communication, quantum cryptography, quantum computation, quantum teleportation, and quantum state and channel discrimination.

Gaussian quantum information

TL;DR: In this article, a review of the state of the art in continuous-variable quantum information processing can be found, ranging from the basic theoretical tools and landmark experimental realizations to the most recent successful developments.
Journal ArticleDOI

Fundamental limits of repeaterless quantum communications.

TL;DR: The fundamental rate-loss tradeoff affecting any protocol of quantum key distribution is determined, which sets the limits of point-to-point quantum communications and provides precise and general benchmarks for quantum repeaters.
References
More filters
Journal ArticleDOI

A mathematical theory of communication

TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI

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.
Journal ArticleDOI

Broadcast channels with confidential messages

TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
Journal ArticleDOI

Universal classes of hash functions

TL;DR: An input independent average linear time algorithm for storage and retrieval on keys that makes a random choice of hash function from a suitable class of hash functions.
Related Papers (5)