Volume 57, Issue 1, January 2016
Index of content:
- SPECIAL ISSUE: OPERATOR ALGEBRAS AND QUANTUM INFORMATION THEORY
57(2016); http://dx.doi.org/10.1063/1.4926977View Description Hide Description
In this paper, we study the relationship between operator space norm and operator space numerical radius on the matrix space , when X is a numerical radius operator space. Moreover, we establish several inequalities for operator space numerical radius and the maximal numerical radius norm of 2 × 2 operator matrices and their off-diagonal parts. One of our main results states that if (X, (O n )) is an operator space, then for all .
57(2016); http://dx.doi.org/10.1063/1.4927070View Description Hide Description
We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transpose bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.
57(2016); http://dx.doi.org/10.1063/1.4928050View Description Hide Description
The additivity of the minimal output entropy and that of the χ-capacity are known to be equivalent for finite-dimensional irreducibly covariant quantum channels. In this paper, we formulate a list of conditions allowing to establish similar equivalence for infinite-dimensional covariant channels with constrained input. This is then applied to bosonic Gaussian channels with quadratic input constraint to extend the classical capacity results of the recent paper [Giovannetti et al., Commun. Math. Phys. 334(3), 1553-1571 (2015)] to the case where the complex structures associated with the channel and with the constraint operator need not commute. In particular, this implies a multimode generalization of the “threshold condition,” obtained for single mode in Schäfer et al. [Phys. Rev. Lett. 111, 030503 (2013)], and the proof of the fact that under this condition the classical “Gaussian capacity” resulting from optimization over only Gaussian inputs is equal to the full classical capacity. Complex structures correspond to different squeezings, each with its own normal modes, vacuum and coherent states, and the gauge. Thus our results apply, e.g., to multimode channels with a squeezed Gaussian noise under the standard input energy constraint, provided the squeezing is not too large as to violate the generalized threshold condition. We also investigate the restrictiveness of the gauge-covariance condition for single- and multimode bosonic Gaussian channels.
57(2016); http://dx.doi.org/10.1063/1.4926965View Description Hide Description
We study the continuity of an abstract generalization of the maximum-entropy inference—a maximizer. It is defined as a right-inverse of a linear map restricted to a convex body which uniquely maximizes on each fiber of the linear map a continuous function on the convex body. Using convex geometry we prove, amongst others, the existence of discontinuities of the maximizer at limits of extremal points not being extremal points themselves and apply the result to quantum correlations. Further, we use numerical range methods in the case of quantum inference which refers to two observables. One result is a complete characterization of points of discontinuity for 3 × 3 matrices.