相关论文: An entropy inequality for q-ary random variables a…
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…
In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamio{\l}kowski state. The second one is based on the relative entropy…
For any given channel $W$ with classical inputs and possibly quantum outputs, a dual classical-input channel $W^\perp$ can be defined by embedding the original into a channel $\mathcal N$ with quantum inputs and outputs. Here we give new…
We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with…
We investigate decoherence induced by a quantum channel in terms of minimal output entropy and of map entropy. The latter is the von Neumann entropy of the Jamiolkowski state of the channel. Both quantities admit q-Renyi versions. We prove…
The minimum entropy output is computed for rotationally invariant quantum channels acting on spin-1/2 and spin-1 systems. For the case of two parallel such channels and initial entangled (singlet) state the entropy of the output is higher…
We investigate the Weyl channels being covariant with respect to the maximum commutative group of unitary operators. This class includes the quantum depolarizing channel and the "two-Pauli" channel as well. Then, we show that our estimation…
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…
Many important properties of quantum channels are quantified by means of entropic functionals. Characteristics of such a kind are closely related to different representations of a quantum channel. In the Jamio{\l}kowski-Choi representation,…
Quantum entropy inequalities are studied. Some quantum entropy inequalities are obtained by several methods. For entanglement breaking channel, we show that the entanglement-assisted classical capacity is upper bounded by $\log d$. A…
The channel capacity for the binary symmetric channel is investigated based on the symmetrized definition of the mutual information, which is arising from an attempt of extension of information content based on the nonadditivity. The…
Being attracted by the property of classical polar code, researchers are trying to find its analogue in quantum fields, which is called quantum polar code. The first step and the key to design quantum polar code is to find out for the…
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…
We introduce two additive invariants of output quantum channels. If the value of one these invariants is less than 1 then the logarithm of the inverse of its value is a positive lower bound for the regularized minimum entropy of an output…
The additivity of minimal output entropy is proved for the Weyl channel obtained by the deformation of a q-c Weyl channel. The classical capacity of channel is calculated.
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output $p$-norm can be…
It has been shown that an extension of the basic binary polar transformation also polarizes over finite fields. With it the direct encoding of q-ary sources and channels is a process that can be implemented with simple and efficient…
We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel.
A family of quantum cloning machines is introduced that produce two approximate copies from a single quantum bit, while the overall input-to-output operation for each copy is a Pauli channel. A no-cloning inequality is derived, describing…
We define and study the properties of channels which are analogous to unital qubit channels in several ways. A full treatment can be given only when the dimension d is a prime power, in which case each of the (d+1) mutually unbiased bases…