Search

Hastings recently provided a proof of the existence of channels which violate the additivity conjecture for minimal output entropy. In this paper we present an expanded version of Hastings' proof. In addition to a careful elucidation of the details of the proof, we also present bounds for the minimal dimensions needed to obtain a counterexample., Comment: 38 pages

We give an intuitive method — using local, cyclic replica symmetry — to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying replica condensation. The condensation property ensures exponential tree decay. We illustrate our method in a low-temperature Ising system, but expect that one can use a similar method in other random field and quantum field problems. While considering the illustration, we prove an elementary upper bound on the entropy of random lattice surfaces.

We study the regularized average Renyi output entropy $\bar{S}_{r}^{\reg}$ of quantum channels. This quantity gives information about the average noisiness of the channel output arising from a typical, highly entangled input state in the limit of infinite dimensions. We find a closed expression for $\beta_{r}^{\reg}$, a quantity which we conjecture to be equal to $\Srreg$. We find an explicit form for $\beta_{r}^{\reg}$ for some entanglement-breaking channels, and also for the qubit depolarizing channel $\Delta_{\lambda}$ as a function of the parameter $\lambda$. We prove equality of the two quantities in some cases, in particular we conclude that for $\Delta_{\lambda}$ both are non-analytic functions of the variable $\lambda$., Comment: 32 pages, several plots and figures; positivity condition added for Theorem on entanglement breaking channels; new result for entrywise positive channels