相关论文: Probabilistic Dense Coding Using a Non-symmetric M…

In this work, we consider two-sender, one-receiver communication over a discrete memoryless multiple-access channel without feedback, where two senders may cooperate on channel coding by using preshared resources, such as shared randomness,…

We establish two complementarity relations for the relative entropy of coherence in quantum information processing, i.e., quantum dense coding and teleportation. We first give an uncertaintylike expression relating local quantum coherence…

In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that these codes outperform individual block codes in certain…

An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications. General properties and some examples with…

As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this work, we study a generalized version of this…

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…

Highly efficient quantum dense coding for continuous variables has been experimentally accomplished by means of exploiting bright EPR beam with anticorrelation of amplitude quadratures and correlation of phase quadratures, which is…

Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, non-binary LDPC codes, and polar coding.

We consider the problem of transmission of several distributed sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient…

We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first…

We construct a new entanglement-assisted quantum polar coding scheme which achieves the symmetric coherent information rate by synthesizing "amplitude" and "phase" channels from a given, arbitrary quantum channel. We first demonstrate the…

We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the…

Suppose that two senders each obtain one share of the output of a classical, bivariate, correlated information source. They would like to transmit the correlated source to a receiver using a quantum multiple access channel. In prior work,…

We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…

Classical, i.e. non-quantum, communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to…

We introduce the notion of hidden quantum correlations. We present the mean values of observables depending on one classical random variable described by the probability distribution in the form of correlation functions of two (three, etc.)…

Superdense coding uses entanglement as a resource to communicate classical information securely through quantum channels. A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal…

A probability density characterization of multipartite entanglement is tested on the one-dimensional quantum Ising model in a transverse field. The average and second moment of the probability distribution are numerically shown to be good…