Related papers: Channel simulation with quantum side information
We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of the other. Yard et al. proved that the capacity region of…
We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to…
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…
We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10],…
We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information…
A fundamental quantity of interest in Shannon theory, classical or quantum, is the error exponent of a given channel $W$ and rate $R$: the constant $E(W,R)$ which governs the exponential decay of decoding error when using ever larger…
We propose a protocol for multipartite secret sharing of quantum information through an \textit{amplitude damping} quantum channel. This network is, for example, of two organizations communicating with their own employees connected via…
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…
The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce…
Completely depolarising channels are often regarded as the prototype of physical processes that are useless for communication: any message that passes through them along a well-defined trajectory is completely erased. When two such channels…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
In problems of lossy source/noisy channel coding with side information, the theoretical bounds are achieved using "good" source/channel codes that can be partitioned into "good" channel/source codes. A scheme that achieves optimality in…
We investigate the problem of strategic point-to-point communication with side information at the decoder, in which the encoder and the decoder have mismatched distortion functions. The decoding process is not supervised, it returns the…
We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity…
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…
We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff…
A general quantum channel consisting of a decohering and a filtering element carries one qubit of an entangled photon pair. As we apply a local filter to the other qubit, some mutual quantum information between the two qubits is restored…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…