相关论文: Complementarity and additivity for depolarizing ch…

We consider the tensor product of the completely depolarising channel on $d\times d$ matrices with the map of Schur multiplication by a $k \times k$ correlation matrix and characterise, via matrix theory methods, when such a map is a mixed…

The Pauli channel acting on 2 x 2 matrices is generalized to an n-level quantum system. When the full matrix algebra M is decomposed into pairwise complementary subalgebras, then trace-preserving linear mappings from M to M are constructed…

Concurrence and further entanglement quantifyers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit-channels. There is a…

In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of…

Problem of classification of parallel quantum channels for information transfer is studied by method of ladder operators. Detailed compared to http://arxiv.org/abs/quant-ph/0702076 presentation of method of ladder operators is given.…

A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar…

We prove additivity of the minimum output entropy and the Holevo capacity for rotationally invariant quantum channels acting on spin-1/2 and spin-1 systems. The physical significance of these channels and their relations to other known…

Quantum channels depending on a number of classical control parameters are considered. Assuming the stochastic fluctuations of the control parameters in the small errors limit it is shown that the channel fidelity is equal to the average…

Transformations for enhancing sparsity in the approximation of color images by 2D atomic decomposition are discussed. The sparsity is firstly considered with respect to the most significant coefficients in the wavelet decomposition of the…

To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra…

We study extensions of a quantum channel whose one-way capacities are described by a single-letter formula. This provides a simple technique for generating powerful upper bounds on the capacities of a general quantum channel. We apply this…

In this letter, a methodology is proposed to improve the scattering powers obtained from model-based decomposition using Polarimetric Synthetic Aperture Radar (PolSAR) data. The novelty of this approach lies in utilizing the intrinsic…

The polar transformation of a binary erasure channel (BEC) can be exactly approximated by other BECs. Ar{\i}kan proposed that polar codes for a BEC can be efficiently constructed by using its useful property. This study proposes a new class…

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…

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also another channel with independent additive Gaussian noise (the feedback channel), and the transmitter observes without delay…

This work presents a differentiable geometric parameterization of quantum channels in Kraus representation, which can be efficiently probed to find an unknown quantum channel. We explore its feasibility in finding the quasi inverse…

Complementation, the inverse of the reduced product operation, is a technique for systematically finding minimal decompositions of abstract domains. File' and Ranzato advanced the state of the art by introducing a simple method for…

We discuss the estimation of channel parameters for a noisy quantum channel - the so-called Pauli channel - using finite resources. It turns out that prior entanglement considerably enhances the fidelity of the estimation when we compare it…

We introduce the concepts of cohering and de-cohering power of quantum channels. Using the axiomatic definition of coherence measure, we show that the optimizations required for calculations of these measures can be restricted to pure input…

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…