Related papers: Arbitrarily Small Amounts of Correlation for Arbit…

We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error…

In this paper we analyze the capacity of a general model for arbitrarily varying classical-quantum channels (AVCQCs) when the sender and the receiver use correlation as a resource. In this general model, a jammer has side information about…

We derive a regularized formula for the common randomness assisted entanglement transmission capacity of finite arbitrarily varying quantum channels (AVQC's). For finite AVQC's with positive capacity for classical message transmission we…

This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give…

If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information…

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…

We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…

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,…

We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing…

Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…

Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived…

We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer…

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender…

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

We show that the communication cost of quantum broadcast channel simulation under free entanglement assistance between the sender and the receivers is asymptotically characterized by an efficiently computable single-letter formula in terms…

We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver chosen from a list of n spatially separated parties. The choice of receiver is unknown to the sender, but is known…

Necessary and sufficient conditions for approximation of a general channel by a general source are proved. For the special case in which the channel input is deterministic, which corresponds to source simulation, we prove a stronger…

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength…