Related papers: Lower bound for the quantum capacity of a discrete…

Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for…

This paper provides new insight into the classical problem of determining both the capacity of the discrete-time channel with uniform output quantization and the capacity achieving input distribution. It builds on earlier work by Gallager…

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept…

There have been several upper bounds on the quantum capacity of the single-mode Gaussian channels with thermal noise, such as thermal attenuator and amplifier. We consider a class of attenuator and amplifier with more general noises,…

The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to…

We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in…

For the class of the memoryless binary-input channels which are not necessarily symmetric, we derive tight bounds on the capacity in terms of the Bhattacharyya parameter. As it turns out, the bounds derived under the symmetric channel…

We study encodings that give the best known thresholds for the non-zero capacity of quantum channels, i.e., the upper bound for correctable noise, using an entropic approach to calculation of the threshold values. Our results show that…

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

We study the performance of common quantum stabilizer codes in the presence of asymmetric and correlated errors. Specifically, we consider the depolarizing noisy quantum memory channel and perform quantum error correction via the five and…

We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure, we get codes with good parameters and a code whose parameters exceed the CSS quantum…

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

In this paper we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite…

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

A new bound for the quantum capacity of the $d$-dimensional depolarizing channels is presented. Our derivation makes use of a flagged extension of the map where the receiver obtains a copy of a state $\sigma_0$ whenever the messages are…

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…

For most discrete memoryless channels, there does not exist a linear code for the channel which uses all of the channel's input symbols. Therefore, linearity of the code for such channels is a very restrictive condition and there should be…

To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we…

We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined…