Related papers: The Simultaneous Identification Capacity of the Cl…

We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…

We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…

We prove the equivalence of an arbitrary single-mode Gaussian quantum channel and a newly defined fiducial channel preceded by a phase shift and followed by a Gaussian unitary operation. This equivalence implies that the energy-constrained…

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…

We establish Ahlswede dichotomy for arbitrarily varying classical-quantum wiretap channels. This means that either the deterministic secrecy capacity of an arbitrarily varying classical-quantum wiretap channel is zero or it equals its…

It is shown that the capacity of a classical-quantum channel with arbitrary (possibly mixed) states equals to the maximum of the entropy bound with respect to all apriori distributions. This completes the recent result of Hausladen, Jozsa,…

We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum…

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 determine the capacity of the classical compound quantum wiretapper channel with channel state information at the transmitter. Moreover we derive a lower bound on the capacity of this channel without channel state information and…

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we…

Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how…

We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the…

A critical aspect of next-generation wireless networks is the integration of quantum communications to guard against quantum computing threats to classical networks. Despite successful experimental demonstrations, integrating quantum…

For a continuous-input-continuous-output arbitrarily distributed quantum channel carrying classical information, the channel capacity can be computed in terms of the distribution of the channel envelope, received signal strength over a…

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably…

A quantum communication channel can be put to many uses: it can transmit classical information, private classical information, or quantum information. It can be used alone, with shared entanglement, or together with other channels. For each…

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…

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

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…