Related papers: Coding Theorems for Quantum Channels
Information theory establishes the ultimate limits on performance for noisy communication systems [Shannon48]. An accurate model of a physical communication device must include quantum effects, but typically including these makes the theory…
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…
We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting".…
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…
Optical communication channels are ultimately quantum-mechanical in nature, and we must therefore look beyond classical information theory to determine their communication capacity as well as to find efficient encoding and decoding schemes…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…
We survey what is known about the information transmitting capacities of quantum channels, and give a proposal for how to calculate some of these capacities using linear programming.
Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…
Quantum information theory predicts that when the transmission resource is doubled in quantum channels, the amount of information transmitted can be increased more than twice by quantum channel coding technique, whereas the increase is at…
In this thesis, we are interested in the limits of quantum communication with and without entanglement, and with and without noise assumptions on the communication setup. When a sender and a receiver are connected by a communication line…
We define classical-quantum multiway channels for transmission of classical information, after recent work by Allahverdyan and Saakian. Bounds on the capacity region are derived in a uniform way, which are analogous to the classically known…
Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel…
An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…
We give a non-technical introduction of the basic concepts of Quantum Information Theory along the distinction between possible and impossible machines. We then proceed to describe the mathematical framework of Quantum Information Theory.…
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…
A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error…
Gaussian quantum channels have recently attracted a growing interest, since they may lead to a tractable approach to the generally hard problem of evaluating quantum channel capacities. However, the analysis performed so far has always been…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept…