A ug 2 00 6 The Convex Closure of the Output Entropy of Infinite Dimensional Channels and the Additivity Problem

نویسنده

  • M. E. Shirokov
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On approximation of infinite-dimensional quantum channels

Abstract—We develop an approximation approach to infinite-dimensional quantum channels based on a detailed investigation of continuity properties of entropic characteristics of quantum channels and operations (trace-nonincreasing completely positive maps) as functions of a pair “channel, input state.” Obtained results are then applied to the problems of continuity of the χ-capacity as a functio...

متن کامل

Simplification of Additivity Conjecture in Quantum Information Theory

We simplify some conjectures in quantum information theory; the additivity of minimal output entropy, the multiplicativity of maximal output p-norm and the superadditivity of convex closure of output entropy. We construct a unital channel for a given channel so that they share the above additivity properties; we can reduce the conjectures for all channels to those for unital channels.

متن کامل

ua nt - p h / 05 09 10 1 v 3 6 O ct 2 00 5 On complementary channels and the additivity problem

We explore complementarity between output and environment of a quantum channel (or, more generally, CP map), making an observation that the output purity characteristics for complementary CP maps coincide. Hence, validity of the mutiplicativity/additivity conjecture for a class of CP maps implies its validity for complementary maps. The class of CP maps complementary to entanglement-breaking on...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Additivity and Distinguishability of Random Unitary Channels

A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output p-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006