Probabilistic unitary maps and probabilistic unitary quantum channels are introduced, many quantum information applications, including (unambiguous) teleportation, can be described as probabilistic unitary quantum channels. Some properties of probabilistic unitary maps and probabilistic unitary quantum channels are derived. The property of a probabilistic unitary quantum channel ensures certain simple form for the measurements involved in realizing the probabilistic unitary quantum channel. The relation between a probabilistic unitary quantum channel and a uniformly entangled state is established. The combined operation of a noisy quantum channel and the error correction operation is a probabilistic unitary channel, from this point of view the condition for the errors to be correctable is easily derived. The condition for the errors caused by a noisy channel to be correctable with any nonzero probability is also obtained. Dense coding with a partially entangled state can also be viewed as a probabilistic unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained. 1
Optimal dense coding using a partially-entangled pure state of Schmidt rank
D and a noiseless quantum channel of dimension
D is studied both in the deterministic case where at most
Ld messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability ${\ensuremath{\tau}}_{x}$) Bob knows for sure that Alice sent message
x, and when it fails (probability $1\ensuremath{-}{\ensuremath{\tau}}_{x}$) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For $\overline{D}\ensuremath{\leqslant}D$ a bound is obtained for
Ld in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes et al. [Phys. Rev. A71, 012311 (2005)]. For
D>D it is shown that
Ld is strictly less than
D2 unless
D is an integer multiple of
D, in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for $\overline{D}\ensuremath{\leqslant}D$, assuming ${\ensuremath{\tau}}_{x}>0$ for a set of
DD messages, and a bound is obtained for the average $⟨1∕\ensuremath{\tau}⟩$. A bound on the average $⟨\ensuremath{\tau}⟩$ requires an additional assumption of encoding by isometries (unitaries when
D=D) that are orthogonal for different messages. Both bounds are saturated when ${\ensuremath{\tau}}_{x}$ is a constant independent of
x, by a protocol based on one-shot entanglement concentration. For
D>D it is shown that (at least)
D2 messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.
The limits of classical information theory are stretched at several points by the consideration of quantum mechanics. Entanglement in itself is a unique phenomenon, and its application has enabled solutions such as super-dense compression, teleportation or super-activation of quantum channels. Noisy classical channels can only be made error-free by adding redundancy, and even this can only be done for certain channels. However, in this article, we examine an equally unique possibility, namely, what properties can make the quantum channels error-free without adding redundancy just by using appropriate quantum transformations. We will show the quantum coding required for this and illustrate its efficiency through examples.
Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding.
In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.
Probabilistic quantum error correction is an error-correcting procedure which uses postselection to determine if the encoded information was successfully restored. In this work, we analyze the probabilistic version of the error-correcting procedure for general noise. We generalize the Knill-Laflamme conditions for probabilistically correctable errors. We show that for some noise channels, the initial information has to be encoded into a mixed state to maximize the probability of successful error correction. Finally, the probabilistic error-correcting procedure offers an advantage over the deterministic procedure. Reducing the probability of successful error correction allows for correcting errors generated by a broader class of noise channels. Significantly, if the errors are caused by a unitary interaction with an auxiliary qubit system, we can probabilistically restore a qubit state by using only one additional physical qubit.