Khalique, Aeysha (2008)
Robustness bounds and practical limitations of quantum key distribution.
Technische Universität Darmstadt
Ph.D. Thesis, Primary publication
|
Aeysha Khalique: Robustness bounds and practical limitations of quantum key distribution -
PDF
(Portable Documnet File)
PhdThesis1.pdf Copyright Information: CC BY-NC-ND 2.5 Generic - Creative Commons, Attribution, NonCommercial, NoDerivs . Download (1MB) | Preview |
Item Type: | Ph.D. Thesis | ||||
---|---|---|---|---|---|
Type of entry: | Primary publication | ||||
Title: | Robustness bounds and practical limitations of quantum key distribution | ||||
Language: | English | ||||
Referees: | Drossel, Prof. Dr. Barbara ; Roth, Prof. Dr. Robert | ||||
Date: | 2 July 2008 | ||||
Place of Publication: | Darmstadt | ||||
Date of oral examination: | 25 June 2008 | ||||
Corresponding Links: | |||||
Abstract: | Quantum information theory is a modern branch of theoretical physics. One of its main goals is to interpret concepts of quantum physics. This leads to a deeper understanding of quantum theory. The most common examples of practical applications of basic quantum theory are quantum computation and quantum cryptography. Quantum cryptography provides secure communication between legitimate users even in the presence of an adversary by making possible the distribution of a secret key. It then allows error correction and privacy amplification, which is elimination of adversary information, through classical communication. In this thesis two important aspects of quantum key distribution are covered, namely robustness bounds with respect to provable entanglement for ideal protocols and practical quantum key distribution using two-way classical communication. In part one of the thesis, ideal quantum key distribution protocols and their robustness in terms of provable entanglement are discussed. The robustness bounds are proved for most general coherent attacks. These bounds for provable entanglement are already known to be 25% for the four-state protocol and 33% for the six-state protocol. We anticipate to provide a region in which the legitimate users share entanglement. This region is large for the four-state protocol and is reduced to a smaller region for the six-state protocol because of additional constraint on it. We also investigate the information cost which the adversary has to pay in order to reach these bounds. In part two we adopt a more practical approach. We investigate the limitation on distance of secure communication because of practical restrictions. In particular we investigate the restrictions due to the lack of single photon sources, the lossy channel and faulty detectors. These practical limitations have already been observed using one-way classical communication between legitimate users. It has been observed that it is actually the dark count rate that limit the distance up to which legitimate users can share a secret key. We have used two-way classical communication to postpone the effect of dark counts and increase the distance to considerable amount. For the purpose we have considered an optimal attack with respect to the disturbance that an eavesdropper creates while attacking. Any other format of attacking will increase the disturbance. We show that using two-way classical communication for post processing we can increase the distance of secure communication considerably. |
||||
Alternative Abstract: |
|
||||
Uncontrolled Keywords: | quantum key distribution, quantum information, protocol, practical limitations achievable distances, key rates, classical communication, tagged qubits | ||||
Alternative keywords: |
|
||||
URN: | urn:nbn:de:tuda-tuprints-10329 | ||||
Classification DDC: | 500 Science and mathematics > 500 Science 500 Science and mathematics > 530 Physics 500 Science and mathematics > 510 Mathematics |
||||
Divisions: | 05 Department of Physics | ||||
Date Deposited: | 17 Oct 2008 09:23 | ||||
Last Modified: | 07 Dec 2012 11:54 | ||||
URI: | https://tuprints.ulb.tu-darmstadt.de/id/eprint/1032 | ||||
PPN: | 20174774X | ||||
Export: |
View Item |