On the capacity of the erasure channel and the construction of an [epsilon]-randomizing map

The quantum information theory is the counterpart of the classical information theory in quantum computation, and it has raised many questions regarding the transmission and security of the information in quantum computers. This thesis studies the efficiency of such processes and contributes to two separate area of quantum information theory. The first half of this thesis presents a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we reduce the proof of a new upper bound for the capacity of the channel to a conjecture. The proposed upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Hence, the proof of the separation between quantum capacities assisted by backward classical communication and two-way classical communication is also reduced to the conjecture. The second half of this thesis studies the construction of an c-randomizing map that uses Pauli operators. An e-randomizing map transforms any n-qubit state to an almost random state - a state that is within e-distance of the completely random state, in the trace norm. We show that at least O( Ta ) Pauli operators are required for the construction of an e-randomizing map. This proves the lower bound on the length of a private key required for a private communication as min {2n, n+log23 log(1/c)}+O(1). Our result matches the previous upper bound of n + 21og(1/c) + 0(1) for the optimal key length, in the order of n.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Mathematics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2008

Author dc:creator

• Lim, Joungkeun

Advisor dc:contributor.advisor

• Peter Shor.

• Mathematics.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/45347

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/45347