相关论文: Simultaneous classical-quantum capacities of quant…
We study the k-pair communication problem for quantum information in networks of quantum channels. We consider the asymptotic rates of high fidelity quantum communication between specific sender-receiver pairs. Four scenarios of classical…
In this paper we propose a new model for arbitrarily varying classical-quantum channels. In this model a jammer has side information. We consider two scenarios. In the first scenario the jammer knows the channel input, while in the second…
With the rapid deployment of quantum computers and quantum satellites, there is a pressing need to design and deploy quantum and hybrid classical-quantum networks capable of exchanging classical information. In this context, we conduct the…
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward,…
Quantum networking allows the transmission of information in ways unavailable in the classical world. Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows…
We consider the problem of communicating over a classical-quantum (CQ) multiple access channel with random classical states non-causally available at the transmitter, referred to as a QMSTx. QMSTx is a classical-quantum multiple access…
We consider two-stage hybrid protocols that combine quantum resource and classical resource to generate classical correlations shared by two separated players. Our motivation is twofold. First, in the near future the scale of quantum…
Shannon's theory of information was built on the assumption that the information carriers were classical systems. Its quantum counterpart, quantum Shannon theory, explores the new possibilities arising when the information carriers are…
We consider the communication of classical and quantum information between two arbitrary observers in asymptotically flat spacetimes (possibly containing black holes) and investigate what is the energy cost for such information…
We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…
Classical feedback is defined here as the knowledge by the transmitter of the quantum state of the qubit received by the receiver. Such classical feedback doubles capacities of certain memoryless quantum channels without preexisting…
Noisy quantum channels may be used in many information carrying applications. We show that different applications may result in different channel capacities. Upper bounds on several of these capacities are proved. These bounds are based on…
It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We…
We investigate how special relativity influences the transmission of classical information through quantum channels by evaluating the Holevo bound when the sender and the receiver are in (relativistic) relative motion. By using the spin…
We consider the problem of transmitting classical information over a time-invariant channel with memory. A popular class of time-invariant channels with memory are finite-state-machine channels, where a \emph{classical} state evolves over…
Most coding theorems in quantum Shannon theory can be proven using the decoupling technique: to send data through a channel, one guarantees that the environment gets no information about it; Uhlmann's theorem then ensures that the receiver…
Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…
We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the…
This work addresses two problems in the context of two-party communication complexity of functions. First, it concludes the line of research, which can be viewed as demonstrating qualitative advantage of quantum communication in the three…
Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiver 1 can send classical messages to Receiver 2. Another…