相关论文: On 1-qubit channels
We consider generalizations of depolarizing channels to maps in which the identity channel is replaced by a convex combinations of unitary conjugations. We show that one can construct unital channels of this type for which the input which…
Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo-Werner…
Computing the classical capacity of a noisy quantum channel is crucial for understanding the limits of communication over quantum channels. However, its evaluation remains challenging due to the difficulty of computing the Holevo capacity…
We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of…
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a…
We introduce an infinite sequence of quantum channels for which the Holevo capacity is additive. The channel series is closely related to the quantum channels arising from universal quantum cloning machines. The additivity proof is…
We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum…
It is conjectured that the Holevo capacity of a product channel \Omega \otimes \Phi is achieved when product states are used as input. Amosov, Holevo and Werner have also conjectured that the maximal p-norm of a product channel is achieved…
We study private quantum channels on a single qubit, which encrypt given set of plaintext states $P$. Specifically, we determine all achievable states $\rho^{(0)}$ (average output of encryption) and for each particular set $P$ we determine…
We give an elementary self-contained proof that the minimal entropy output of arbitrary products of channels $\rho \mapsto \frac{1}{d-1}(1-\rho^T)$ is additive.
Entropic quantifiers of states lie at the cornerstone of the quantum information theory. While a quantum state can be abstracted as a device that only has outputs, the most general quantum device is a quantum channel that also has inputs.…
The thermodynamic resourcefulness of quantum channels primarily depends on their underlying causal structure and their ability to generate quantum correlations. We quantify this interplay within the resource theory of athermality for…
We describe analytical properties of the average output entropy of a quantum channel as a function of a pair (channel, input ensemble). In particular, tight semicontinuity bounds for this function with the rank/energy constraints are…
The information carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space,…
The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…
Classical messages can be sent via a noisy quantum channel in various ways, corresponding to various choices of signal states of the channel. Previous work by Holevo and by Schumacher and Westmoreland relates the capacity of the channel to…
We realize Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on the IBM quantum computers. These channels correspond to interaction between the qutrit and its environment that result in the globally unitarily…
We show that the recently discovered universal upper bound on the thermal conductance of a single channel comprising particles obeying arbitrary fractional statistics is in fact a consequence of a more general universal upper bound,…
We find a tight upper bound for the classical capacity of quantum thermal noise channels that is within $1/\ln 2$ bits of Holevo's lower bound. This lower bound is achievable using unentangled, classical signal states, namely displaced…
We introduce a condition for memoryless quantum channels which, when satisfied guarantees the multiplicativity of the maximal l_p-norm with p a fixed integer. By applying the condition to qubit channels, it can be shown that it is not a…