Quantum Kolmogorov Complexity and Quantum Key Distribution

Details Quantum Kolmogorov Complexity and Quantum Key Distribution Quantum Kolmogorov Complexity and Quantum Key Distribution

2008-11-15

arxiv.org/abs/0811.2460v5

Phys. Rev. A 79, 012324 (2009)

Physics

Quantum Physics

typos corrected

Scientific paper

10.1103/PhysRevA.79.012324

We discuss the Bennett-Brassard 1984 (BB84) quantum key distribution protocol in the light of quantum algorithmic information. While Shannon's information theory needs a probability to define a notion of information, algorithmic information theory does not need it and can assign a notion of information to an individual object. The program length necessary to describe an object, Kolmogorov complexity, plays the most fundamental role in the theory. In the context of algorithmic information theory, we formulate a security criterion for the quantum key distribution by using the quantum Kolmogorov complexity that was recently defined by Vit\'anyi. We show that a simple BB84 protocol indeed distribute a binary sequence between Alice and Bob that looks almost random for Eve with a probability exponentially close to 1.

Affiliated with

Also associated with

No associations

Rating

Quantum Kolmogorov Complexity and 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 Quantum Kolmogorov Complexity and Quantum Key Distribution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Kolmogorov Complexity and Quantum Key Distribution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39216