Related papers: Probabilistic Dense Coding Using a Non-symmetric M…
We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…
The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this paper, we introduce natural probability distributions for covariant quantum channels.…
This paper is on identification of classical information by the use of quantum channels. We focus on simultaneous ID codes which use measurements being useful to identify an arbitrary message. We give a direct and a converse part of the…
Atmospheric turbulence is one of the lead disturbance factors for free-space quantum communication. The quantum states of light in such channels are affected by fluctuating losses characterized by the probability distribution of…
Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under LDPC network coding and joint decoding. The saddle point equations for…
Teleportation may be taken as sending and extracting quantum information through quantum channels. In this report, it is shown that to get the maximal probability of exact teleportation through partially entangled quantum channels, the…
Is there a meaningful quantum counterpart to public communication? We argue that the symmetric-side channel -- which distributes quantum information symmetrically between the receiver and the environment -- is a good candidate for a notion…
Suppose that there are $n$ Senders and $n$ Receivers. Our goal is to send long messages from Sender $i$ to Receiver $i$ such that no other receiver can retrieve the message intended for Receiver $i$. The task can easily be completed using…
Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…
We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to…
Quantum channel, as the information transmitter, is an indispensable tool in quantum information theory. In this paper, we study a class of special quantum channels named the mixed-permutation channels. The properties of these channels are…
I. This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of…
We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a…
This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with…
In this work we design a specific simulation tool for quantum channels which is based on the use of a control system. This allows us to simulate an average quantum channel which is expressed in terms of an ensemble of channels, even when…
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded,…
Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered. This describes a scenario where the quantum channel depends on the…
Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder…
The distribution function of the sum of i.i.d. random variables of the special form is considered. Such sum describes messages posterior probabilities for random coding in binary symmetric channel. Close non-asymptotic lower and upper…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…