Related papers: Optimal super dense coding over memory channels

We derive one-shot upper bounds for quantum noisy channel codes. We do so by regarding a channel code as a bipartite operation with an encoder belonging to the sender and a decoder belonging to the receiver, and imposing constraints on the…

We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We…

We present an experimental method to detect lower bounds to the quantum capacity of two-qubit communication channels. We consider an implementation with polarisation degrees of freedom of two photons and report on the efficiency of such a…

The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have…

We introduce the notion of distributed quantum dense coding, i.e. the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders…

The set of quantum Gaussian channels acting on one bosonic mode can be classified according to the action of the group of Gaussian unitaries. We look for bounds on the classical capacity for channels belonging to such a classification.…

We analyze quantum communication properties of phase-covariant channels depending on their degree of non-unitality. In particular, we derive analytical formulas for minimal and maximal channel fidelity on pure states and maximal output…

As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy:…

We investigate a quantum coding for quantum communication over a PD (partially degradable) degradable quantum channel. For a PD channel, the degraded environment state can be expressed from the channel output state up to a degrading map. PD…

We argue that a fundamental (conjectured) property of memoryless quantum channels, namely the strong superadditivity, is intimately related to the decreasing property of the quantum relative entropy. Using the latter we first give, for a…

A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a…

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…

Given a quantum Markovian noise model, we study the maximum dimension of a classical or quantum system that can be stored for arbitrarily large time. We show that, unlike the fixed time setting, in the limit of infinite time, the classical…

We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and…

We study universal decoding over unknown discrete additive channels determined by a finite-state (unifilar) random process. Aiming at low-complexity decoders, we study variants of noise-guessing decoders that use estimators for the…

We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below…

Using combinatorial arguments, we determine an upper bound on achievable rates of stabilizer codes used over the quantum erasure channel. This allows us to recover the no-cloning bound on the capacity of the quantum erasure channel, R is…

Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while…

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 provide a generalization of quantum polar codes to quantum channels with qudit-input, achieving the symmetric coherent information of the channel. Our scheme relies on a channel combining and splitting construction, where a two-qudit…