We study the optimal rates of emulation (also called interconversion) between quantum channels. When the source and the target channels are idempotent, we give a single-letter expression for the zero-error emulation capacity in terms of structural properties of the range of the two channels. This expression shows that channel emulation is not reversible for general idempotent channels. Furthermore, we establish a strong converse rate that matches with the zero-error emulation capacity when the source or the target channel is either an identity or a completely dephasing channel.

We consider a quantum system described by a quantum channel $Φ$ that is applied at every time step and study the time evolution of its information capacities. When $Φ$ is a GNS-symmetric channel (this includes Pauli channels, for example), we give explicit exponential convergence bounds for the classical and quantum capacities. These bounds are in terms of entropic properties of $Φ$. We further illustrate how these results help quantify the performance of active versus passive error-correction setups.

A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the previous bounds known. We prove that a primitive positive map E acting on Mdthat satisfies the Schwarz inequality becomes strictly positive after at most 2(d-1)2iterations. This is to say that after 2(d-1)2iterations, such a map sends every positive semidefinite matrix to a positive definite one. This finding does not depend on the number of Kraus operators as the map may not admit any Kraus decomposition. The motivation of this work is to provide an answer to a question raised by Sanz-García-Wolf and Cirac in their work on quantum Wielandt bound.