We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some possible applications of our result. We also show that our scheme allows a reasonable distribution of channel capacity over two senders.
The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The first describes the region of rates at which one sender can send classical information while the other sends quantum information. The second describes those rates at which both senders can send quantum information. For each of these situations, an example of a channel is given for which the associated region admits a single-letter description. This is the authors Ph.D. dissertation, submitted to the Department of Electrical Engineering at Stanford University in March, 2005. It represents an expanded version of the paper quant-ph/0501045, containing a number of tutorial chapters which may be of independent interest for those learning about quantum Shannon theory.
The amount of information transmissible through a communications channel is determined by the noise characteristics of the channel and by the quantities of available transmission resources. In classical information theory, the amount of transmissible information can be increased twice at most when the transmission resource (e.g. the code length, the bandwidth, the signal power) is doubled for fixed noise characteristics. In quantum information theory, however, the amount of information transmitted can increase even more than twice. We present a proof-of-principle demonstration of this super-additivity of classical capacity of a quantum channel by using the ternary symmetric states of a single photon, and by event selection from a weak coherent light source. We also show how the super-additive coding gain, even in a small code length, can boost the communication performance of conventional coding technique.
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we conclude that a classical feedback channel does not improve the classical capacity of a quantum erasure channel, and by taking into account energy constraints, we conclude the same for a pure-loss bosonic channel. The method for establishing the aforementioned entropy bound involves identifying an information measure having two key properties: 1) it does not increase under a one-way local operations and classical communication channel from the receiver to the sender and 2) a quantum channel from sender to receiver cannot increase the information measure by more than the maximum output entropy of the channel. This information measure can be understood as the sum of two terms, with one corresponding to classical correlation and the other to entanglement.
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.
Quantum communications using continuous variables are quite mature experimental techniques and the relevant theories have been extensively investigated with various methods. In this paper, we study the continuous variable quantum channels from a different angle, i.e., by exploring master equations. And we finally give explicitly the capacity of the channel we are studying. By the end of this paper, we derive the criterion for the optimal capacities of the Gaussian channel versus its fidelity.