# Roofs and ConvexityAcademic research paper on "Mathematics"

CC BY
0
0
Share paper
Entropy
OECD Field of science
Keywords
{""}

## Academic research paper on topic "Roofs and Convexity"

﻿Entropy 2010,12, 1799-1832; doi:10.3390/e12071799

OPEN ACCESS

entropy

ISSN 1099-4300

www.mdpi.com/journal/entropy

Article

Roofs and Convexity

Armin Uhlmann

Institute for Theoretical Physics, University of Leipzig, PB 100 920, D-04009 Leipzig, Germany; E-Mail: armin.uhlmann@t-online.de

Received: 5 June 2010; in revised form: 5 July 2010 / Accepted: 9 July 2010 / Published: 20 July 2010

Abstract: Convex roof extensions are widely used to create entanglement measures in quantum information theory. The aim of the article is to present some tools which could be helpful for their treatment. Sections 2 and 3 introduce into the subject. It follows descriptions of the Wootters' method, of the "subtraction procedure", and examples on how to use symmetries.

Keywords: roofs; convex roof extensions; entanglement measures

1. Introduction

One often is in the position to know a quantity for pure states of a quantum system, say g, without a definite meaning in classical physics. Then one looks for a method to extend g to all mixed states, see [1-4]. Let G denote such a possible extension.

A reasonable approach is certainly to extend g "as linearly as possible" or, more correctly, "as affine as possible". The mathematical model for such a demand is a "roof" as presented in Section 2.

As it is difficult, to say the least, to imagine higher dimensional geometry, let us look at an elementary example, the real qubits. They fill a disk bounded by a circle. The circle represents the pure states. Considering g(n), with n pure, as the height of a wall at the point n. An extension G of g to the disk provides a covering of the ground floor. Let G(u) be a point of that covering. To be a roof in the sense of Section 2, we like to have: There is either a straight line or a plane coincident with the roof point u, G(u) and resting on the wall at two or at three points n, g(pij). If the line or plane is parallel to the ground floor, it is called flat. An uncomfortable feature is the rather large arbitrariness: There are plenty of roof extensions allowing, however, as a bonus, much room for playing. Under rather weak assumptions, there is a minimal as well as a maximal roof extension (Proposition 2.1).

Physically stronger motivated seem extensions G of g which are either convex or concave. Heuristically, the convex ones try to suppress the "classical noise" or else the "classical information" by the tendency to attach lower values to the states "far" from the pure ones. The concave extension stress the "classical part", possessing lower values in the vicinity of the pure states.

It is a well known fact that there are maximal convex and minimal concave extensions. If it exists, the minimal roof extension is equal to the maximal convex extension and this facilitate calculations sometimes.

The maximal convex extension gu of g can be gained by

with pure states n, [5]. In quantum information theory this is nowadays a common procedure to define entanglement measures. Its first appearance is in the important paper [6] by C. H. Bennett, D. DiVincenzo, J. Smolin, and W. Wootters, and has been called entanglement of formation and is denoted by E(u). These authors considered states u of a bipartite quantum system. The role of g plays S(Trbn), the entropy S of the partial trace Trb, as a function of a pure bipartite states n.

In the present paper a trace preserving positive map T from the states of a quantum system into another one is called a stochastic map. A channel is a completely positive stochastic map. If in the definition of entanglement of formation, E, a stochastic channel T is used in place of the partial trace Trb, we call the resulting quantity the entanglement of T and denote it by ET. For a channel, ET is equivalent (in many ways) to the restriction of E onto a face of a bipartite state space of sufficiently high dimension, [7]. In this way, T is seen as a sub-channel of the partial trace: The tensor product is partitioned into subspaces on which the sub-channels are defined. A 1-qubit channel, for example, can be represented by a 2 x m bipartite quantum systems as the restriction of the partial trace over the larger dimensional part onto the density operators supported by a suitable 2-dimensional subspace.

Clearly, ET is of interest in its own as part of the x*-function x* = ST — ET with (ST)(u) = S(T(u)) the maximum of which is the Holevo capacity [8] of T.

Since the importance of E has been realized in [6], several other measures of similar structure have been introduced and discussed, replacing the von Neumann entropy S by another function on the state space of the output system. The perhaps mostly discussed examples are the "tangle" tt and the "concurrence" CT. The connection between them is CT(n)2 = tt(n) for all pure states n. Sometimes one also needs a minimal concave extension ("entanglement of assistance"). All these quantities have been defined by global variational problems of type (1), (2).

A further, even earlier source for the said procedure roots in the problem of defining a "quantum dynamic entropy", generalizing the Kolmogorov-Sinai one. In the approach [9] of A. Connes, H. Narnhofer, and W. Thirring several similar global variational problems wait to be solved. One of them is the search for the convex roof defined by g(u) = S(Dn(u)), S again von Neumann's entropy and Dn the diagonal map, setting all off-diagonal entries of a matrix to zero. The problem initiated the paper [10] of F. Benatti, H. Narnhofer, and A. Uhlmann and further ones.

where the inf is running through all convex decompositions

It is true that complete solutions for these extensions are only known in the lowest non-trivial dimensions. In the present paper general tools are presented to facilitate the treatment of convex or concave roofs. The general aspects are mainly in the Sections 2 and 3. It includes the foliation of the input state space into "convex leaves" onto which the roof becomes affine and, in particular nice situations, even constant, [10,11].

Section 4 is devoted to the Wootters' way [12-14] of presenting the entanglement of formation explicitly, see also [15].

Section 5 shows a more recent way to compute the concurrence of a 1-qubit stochastic map by a substraction procedure. For the concurrence of 2 x m quantum systems it allows to compute the concurrence of any rank two quantum state. An elegant way to do so was opened by Hildebrand, [16,17], using the so-called "S-lemma"of Yakobovich, see [18]. Another one has been chosen by Hellmund and Uhlmann, [19], who use the description of general 1-qubit maps given by Gorini and Sudershan, [20].

For the tangles the pioneering work goes back to Coffman, Kundu, and Wootters, [21], who already remarked that optimal decompositions of length two should be sufficient in the 1-qubit case. That the "substraction procedure" works can be read off from a paper of Osborne and Verstraete, [22]. Here we describe analytical results for axial symmetric channels. There are also results for the 3-tangle roof problem, [25].

Most results, if not numerically, are found by the help of symmetries. Besides the already quoted ones, an essential step has been done by K. G. Vollbrecht and R. F. Werner, [26], and B. M .Terhal and K. G. Vollbrecht [27]. Meanwhile it became a very large domain of research, exceeding the frame of the present paper. Hence, in Section 6, only some aspects, connected with maximal symmetric states, are touched.

Some notations: We use H for Hilbert spaces, B(H) for its algebra of operators, Q(H) for the set of density operators supported by H. We also say "state" for "density operator" and "state space" for Q(H). As a convex set, Q(H) is embedded in Herm(H), the real linear space of Hermitian operators. The symbol Q is also used for a general compact convex sets in a real linear space. Following [3], the extremal points of a convex set will be called "pure" ones mostly. They are usually symbolized by the letter n. We follow [28] in using n(x) = — x logx and S(u) = Tr n(u), the von Neumann entropy.

2. Roofs, Roof Extensions

We are now going to give an exact meaning to the word "roof". For this purpose we assume G to be a real valued function on a compact convex set Q, contained in a finite dimensional real linear space.

Definition 2.1a: Roof points

u e Q is called a roof point of G, if there is at least one extremal convex decomposition

such that

If this takes place, we call the decomposition (3) optimal with respect to G or, equivalently, G-optimal. The number of terms in (3) with pj = 0 is the length of the decomposition.

Definition 2.1b: Flat roof points

A roof point u of G is called flat, if there is a G-optimal decomposition (3) fulfilling

G(u) = G(ni) = G(^) = ... (5)

i.e. all the values G(nj) are equal one to another [29].

Let f (x) be a real function defined on the range of G. The main merit of a flat roof point u of G is the simple fact, that it remains a flat roof point for f (G): f (G(nj)) = f (G(u)) for all j and (4) remains true for f (G). In other words, the flat points of p ^ G(p) are also flat roof points of p ^ f (G(p)).

Definition 2.2: Roofs, flat roofs

A real function G on Q is a roof if every u e Q is a roof point of G. G is called a flat roof if all roof points are flat ones.

In important applications the point of view is a bit different: A function n ^ g(n) is given on the set Qpure of pure states, or, more generally, on the set of extremal states of an arbitrary compact convex set. Then one asks for meaningful extensions G which coincides with g on Qpure. In such a generality the problem is too arbitrarily posed and one asks for restrictions to such an extension. Remarkable ones are the roof extensions. They interpolate the values of g "as linearly (or as affine) as possible".

Definition 2.3: Roof extensions

Let n ^ g(n) be a real function on Qpure. A roof G is called a roof extension of g, if G(n) = g(n) for pure states.

Now observe the following simple fact: The maximum (the minimum)

max{G1,..., Gn} respectively min{G1,..., Gn}

of finitely many roof extensions of g is a roof again.

Indeed, assume for roof extensions G1,..., Gn of g and u e Q the value G1(u) is not less than the other values Gj(u). Then one selects a G1-optimal decomposition for max{G1,..., Gn}.

The reasoning above fails for infinitely many roof extensions. The proof of the following is postponed to that of proposition 3.5.

Proposition 2.1

Let g be a real continuous function on Qpure(H) and G a roof extension of g. For all u e Q(H) there exist optimal decompositions (3), (4) the length of which does not exceed (dim H)2 + 1. There is a minimal and a maximal roof extension of g.

2.1. Examples

Roof extensions exist in abundance. To see this and also the difficulties, which we may get into, let us consider a few examples showing some typical constructions. We remain within the state space Q(H), dim H = d and we start with d = 2.

Example 2.1: A Bloch ball construction

Seen from convex analysis, the space Q of all 1-qubit density operators is a 3-dimensional ball, the Bloch ball. Qpure is the Bloch sphere, the surface of the Bloch ball.

Now assume there is a function g on the Bloch sphere and we like to find roof extensions G of g. Particular nice ones are gained as following: We take a bundle of straight lines such that every point u of the Bloch ball is coincident with exactly one line, say , of the bundle. If u is not pure, then hits the Bloch sphere at exactly two points, say n and n2. Hence, u is a convex combination of them. Now we define

G(u) = pg(ni) + (1 — p)g(n2) if u = pni + (1 — p)ff2 (6)

Because there is just one line from our bundle going through u, we get a well-defined roof.

Let us now specify our example by choosing a bundle of parallel lines. It belongs exactly one main axis of the Bloch ball to the bundle. We may assume that it is the x3-axis with respect to the Bloch coordinates xi , x2 , x3 of a general Pauli representation

u = ^(1 + XiCTi + X2^2 + X3^3) (7)

The line is now fixed by the values x1 and x2, letting the third Bloch coordinate arbitrary. crosses the Bloch Sphere at the pure states n± with the Bloch coordinates x1, x2, y3 = ±(1 — x2 — x2)1/2. Hence

n± = ^(1 + xi0"! + x202 ± [1 — x2 — x2]1/203), u = + (1 — p)ff- (8)

with 0 < p < 1. Expressing now g in terms of Bloch coordinates, we obtain the roof

G(u) = G(x1, x2) = pg(x1, x2, 1 — x2 — x2) + (1 — p)g(x1, x2, — ^J 1 — xi — x2) (9)

The example is further specified by choosing for g the Shannon entropy of the diagonal elements of u. Then G becomes the roof

ET (u) = H(1 + ^ — x2 — x2 , 1 — ^ — x2 — x2) (10)

T(u) denotes the diagonal part of u and H the Shannon entropy of the diagonal elements. That this is the solution for the entanglement of the diagonal channel, has been suggested by Levitin, [30] and Thirring [31]. (10) provides a roof extension as described above. Indeed, it is a flat roof depending on 1 — x2 — x2, hence a function of the Euclidean distance \Jx2 + x2 of u from the x3-axis. It is

<0|u|1> = xi — ix2 , xi + x2 = 4| (0, u |1)|2 (11)

Therefore, the concurrence of the diagonal map for qubits can be written

Ct(u) = | <0|u|1> | (12)

It is easily to be seen that C is a flat convex roof. It possesses quite large domains where it is just affine: Cut the Bloch ball with a plane containing the x3-axis. We get a disk, cut by the x3-axis into two half-disks. The concurrence is affine on every such half-disk.

Indeed, if T is a 1-qubit channel with two different pure fix points, one can observe a similar phenomenon. (The disks will be cut by the axis through the fix points.)

Example 2.2

There is a constructions, similar to the previous one: Given any function f (x3) on the x3-axis. We construct a roof by

A(u) = f (X3), X3 = <0|u|0> — <1|u|1> (13)

More generally, given a bundle of planes so that every point of the Bloch ball is coincident with one and only one of these planes. A function, constant on planes, is a roof. This can be achieved by choosing a function f on the x3-axis and attaching to every plane the value of f at its crossing with this axis.

Similar constructions are possible with higher dimensional balls (ellipsoids). However, on higher dimensional state spaces things are essential more complicated due to the subtle structure of the set of their pure states.

Example 2.3: Affine functions on the state space An affine function on Herm(H) is of the form

X ^ /(X) := a + TrXA (14)

with an Hermitian operator A and a real number a. It is sometimes useful to write (14) in the form

/(X) = Tr XB, B = A + a 1

The function (14) is trivially a roof: If we have any extremal decomposition (3) one immediately gets /(p) = Pj/(nj). Thus, every extremal decomposition is optimal. We easily conclude that with G also G + / is a roof.

A bit more tricky is the assertion that every function (14) is a flat roof on the state space Q(H). We prove this by induction to the dimension of the Hilbert space. We start with the qubit case. We can choose a basis in H such that A = a + aV3 and

u = 2(1 + x^1 + x3^3)

It suffices to prove the assertion for A = a3, resulting in /(X) = Tr a3X = x3. With an unimodular number e we consider the pure states

u± = 2(1 + x1°"1 ± ey 1 — x1 — x^ + x3^)

so that our affine function is constant at the segment pu+ + (1 — p)u-. The segment contains u for

p =1/2.

Varying e we see the following: To every affine function l as in (14) there is an axis through the Bloch ball such that l is constant on every plane perpendicular to that axis. We can say something more: Given u e Q and two affine functions, j, j = 1, 2, we use the constants j (u) = Cj to define two planes by lj (X) = Cj. Because the two planes contain u, they intersect along a line, say , containing u. The intersection of with the Bloch sphere provides two pure states which define a flat optimal decomposition of u.

Proposition 2.2

Affine functions on Q(H), dim H < ro, are flat roofs. Given two affine functions and a density operator u, there is a common flat optimal decomposition of u.

Proof. The 2-dimensional case has already been proved. Let lj (X) = a + Tr AjX, j = 1, 2, denote two affine functionals and choose u e Q(Hd). Assume the assertion is true for dim H < d. If u is from the boundary of Q(Hd) we are done by our induction hypothesis. Otherwise we consider the linear subspace L of Herm(Hd) orthogonal to A1 and A2, i.e., of all Y satisfying Tr AjY = 0, j = 1, 2. Consider the affine space Lw = u + L. It contains u and it is lj (Y) = lj (u) for all Y e Lw. The intersection K = Q n£w is compact and its extremal points belong to the boundary of Q(Hd). Therefore, we get a decomposition

u = pj uj, rank(uj) < d

and, furthermore, lj (u) = lj (uj) because of uj e K. However, the support of any uj is of dimension

less than d. Therefore, there are extremal decompositions

uj = pjknjk, lj (uj ) = l(njfc)

for all j and all k with pure states njk. Thus

u = Y^ PjY Pjknjk jk

is a flat optimal decomposition of u for l1 as well for l2. Thus the proposition is proved. □

The following is a corollary.

Proposition 2.3

Let f (x1, x2) be a function defined on the range of two affine functions, l1 and l2. Then

F(u) := f(li(u),l2(u)) (15)

is a flat roof.

Example 2.4: An application to the diagonal map

We like to apply the proposition above to the diagonal map

X ^ Dn(X) = diag(X) (16)

which which is a channel on Q(H). diag(X) denotes the diagonal part of X obtained by replacing all off-diagonal elements of X by zeros. Proposition 2.3 proves that the von Neumann entropy

u ^ S(Dn(u)) = 5n(<j|u|j>) (17)

is a flat roof for n = 2, 3. For n = 3 one replaces the third diagonal element, x33, by 1 — x11 — x22 to see that proposition 2.3 suffices to verify the assertion.

We like to prove the flatness of (17) for all dimensions. This will be done in example 3.2 later on.

Example 3

A general way to obtain roof extensions in state spaces is presented next. It allows for further modifications, but it is difficult to be controlled explicitly.

Let g be a continuous real function on Qpure and u e Q. Every basis |^1>,..., gives rise to a decomposition

u = 5 ><^j |Vu (18)

of positive rank one operators. After normalization of the rank one operators we get extremal convex decomposition of u,

u = 5 Pj Pj = <*M* > (.9)

In the following definitions we vary over all bases.

G1<u) = msn 5 pjg( ) (-)

where pj is as in (19). Because continuity of g is assumed, and the set of bases is compact, the minimum in (20) will be attained. Thus, G1 is a roof extension of g. One gets another roof extension by

= maxPjg( > (21)

One cannot guaranty the roof property without continuity of g.

(21) and (20) are global optimization problems for which there are no explicit expressions known in most cases. There are, however, algorithms to approximate them numerically.

3. Roofs and Convexity

We start with some definitions and elementary, mostly well-known statements around maximal convex and minimal concave extensions. The second subsection is concerned with sufficient conditions for the existence of convex and concave roofs and their main properties.

3.1. Convex and Concave Extensions

Let Q be a compact convex set and g a real function defined on the set Qpure of its extremal points.

Definition 3.1: Convex (concave) extensions

A convex function G is called a convex (respectively concave) extension of g if G is convex (respectively concave) and coincides on Qpure with g.

Between any convex, concave or roof extension of a function g the inequalities

Gconvex < Groof < Gconcave (22)

are valid. Indeed, with an optimal decomposition (3) for Groof we get

Groof (u) = £ pj Groof (nj) = £ pj Gconvex(nj)

because the extensions coincide on Qpure. The right sum cannot be smaller than Gconvex(u) by convexity. Similarly one argues in the concave case.

The proof of (22) is valid pointwise, leading to

Proposition 3.1

Let Gconvex be a convex, Gconcave a concave, and G any extension of g. If u is a roof point of G, then

Gconvex(u) < G(u) < Gconcave(u) (23)

Let Gconvex and Gconcave be as in the above proposition and assume in addition equality in (23), Gconvex(u) = Gconcave(u). For all convex combination

u = pjuj, uj e Q, pj > 0,

we conclude

£ pj Gconvex(uj) > Gconvex (u) = Gconcave (u) > £ pj Gconcave (uj) (24)

because of (22) the conclusion is Gconvex(uj-) = Gconcave(uj-) for all j.

To express this finding we need some standard terminology. A subset K c Q is called a face of Q if u e K and (24) necessarily implies uj e K for all j. Faces are convex subsets of Q. If not only Q but also Qpure is compact then faces are compact and any face K is convexly generated by Qpure n K. The intersection of faces is either empty or a face again. The smallest face containing u will be called u-face of Q and denoted by facew [Q]. If K is a face and u not a point of the boundary of K, then K is the u-face of Q.

Now we express the finding above by

Proposition 3.2

Coincide a convex and a concave extension of g at u e Q, then they coincide on the u-face of Q. The least upper bound of a set of convex functions is convex again. Hence, given g on Qpure, there is a unique largest convex extension of g from Qpure to Q. Similarly there exists a smallest concave extension of g. It is convenient to introduce an extra notation for these extensions:

Definition 3.2: gn and gu

Let g be a real function on Qpure. We denote by gu the largest convex and by gn the smallest concave extension of g to Q,

gu = largest convex extension of g from Qpure to Q , gn = smallest concave extension of g from Qpure to Q .

We also write G = Gu (or G = Gn) if G is the largest convex (or the smallest concave) extension of the restriction of G onto Qpure.

Proposition 3.3

Let G be an extension of g and u one of its roof points. If G is convex, then G(u) = gu(u). If G is concave, then G(u) = gu(u).

If a convex (resp. concave) roof extension of g exists, then it is unique. Because G is convex, G < gu. Because u is a roof point, (23) asserts G(u) > gu(u).

Is there a convex extension at all for a given g ? If there is one then there is also a largest one, i.e. gu exists. The answer to the question is affirmative and has been given in [5] by a variational characterization which is well known in quantum information theory as a recipe to construct entanglement measures:

gu(u) = infj^ Pj g(nj) (25)

gn(u) = supj^ Pj g(nj) (26)

where the "inf", respectively "sup", is running over all extremal convex decompositions

u = ^ Pjn, n e Qpure (27)

Indeed, if G is an extension of g which is convex, the right side of (25) must be always larger than G(u). On the other hand, given ui and u2, one can find decompositions (27) for them differing an arbitrary small amount e > o from gu (u1) respectively gu(u2). They may be composed from the pure states and probabilities p^-, i = 1, 2. Then

2e + pgu(ui) + (1 - p)gu(u2) > PPi,jg(ni,j) + - P)g(n2,fc)

and this is not smaller than gu(Pu1 + (1 — p)u2). Because e can be arbitrary near to zero, gu is convex. The concave case can be settled by a similar reasoning or by

— gu = (—g)n, —gn = (—g)u (28)

Remark: Hulls of functions

The convex hull of G is the largest convex function which is smaller than G. The concave hull of G is the smallest concave function which is larger than G. In (25) and (26) one uses the values of G at the pure states only. Because the hull construction must respect values on the whole of Q, there are more constraints to be fulfilled.

The expressions (25) and (26) are similarly structured as those of the convex and the concave hulls of a function G on Q. One mimics the proofs and gets

conv[G](u) = inf £ pj G(uj) (29)

conc[G](u) = sup^^ pj G(uj) (30)

where, as in (24), one has to run through all convex combinations

u = pj uj, uj e Q, pj > 0

Obviously, conv[G] is smaller than Gu and conc[G] is larger than Gn. This quite simple reasoning provides also

Proposition 3.4

If G is a concave or a roof extension of g then gu = conv[G]. If G is a convex or a roof extension of g then gn = conc[G].

As a matter of fact one can do similar hull constructions with any subset of Q which convexly generates Q. This has been emphasized in [26].

3.2. Convex and Concave Roofs

If there is a convex roof extension of g, then it equal to gu. There is a sufficient condition to guaranty the roof property of gu and of gn.

Proposition 3.5

Let Q be a convex set. Assume both, Q and Qpure, are compact and g continuous on Qpure. Then gu

and gn are roofs. According to proposition 3.3 they are the minimal respectively maximal roof extensions of g.

Remember that Qpure is compact if Q = Q(H) and H is finite dimensional. The requirement of continuity of g is often satisfied in physically motivated applications, though not always. A counter example is the Schmidt number in bipartite quantum systems. In this case it is not known whether gu and gn are roofs. Nevertheless. the assumptions needed are rather weak ones. We met them already in proposition 2.1.

The proof will be "constructive" in a certain sense. It is arranged to sharpen "theorem 1" in [10]: If we know an optimal decomposition with pure states n1, n2,..., then every convex combination of them

is optimal. In particular, the (convex or concave) roof is affine on the convex set generated by the pure

states n1, n2,____Restricted to this this set, the graph of G is a piece of an affine space. The whole graph

of G appears as composed of flat pieces [32]. If one would know a covering of Q by those "convex leaves", one could compute gu from the values of g at Qpure. Things are similar for gn.

To start proving propositions 3.5 and 2.1 let us repeat the assumptions. Q is a compact convex set in a real linear space L of finite dimension, the set Qpure of all pure (i.e., extremal) points of Q is compact. g is a real continuous function on Qpure. The dimension of Q as a set in L is denoted by n. It is the dimension of the affine space generated by Q.

Remark: The space Q(H) of density operators is embedded in Herm(H). The latter is of dimension d2 if dim H = d. The affine space generated by Q(H) is the hyperplane of Hermitian operators of trace one. The dimension of Q(H) is n = d2 — 1.

We enlarge L to the linear space L' = L © IR. Its elements, X © A, will be written in vector form {X, A} with two components, X e L and A e IR. We need the set

E = { n, g(n) }, n e Qpure (31)

E is a compact set by our assumption. Hence its convex hull, denoted by Q[g], is a compact convex set. The set of extremal points of Q[g] is E. (If one of the elements of E would be a convex combination of the others, the same would be true for the corresponding pure states, contradicting our assumptions.)

Choose u e Q and consider in L © IR the straight line consisting of the points {u, A}, A e IR. The line intersects with Q[g] along a compact segment

{u, A} e Q[g] ^ Ao(u) < A < Ai(u) (32)

A satisfies (32) if and only if there is an extremal decomposition

{u, A} = £ pj {nj ,g(nj)} = { u, £ pj g(n) }, nj e Qpure (33)

Therefore,

gu(u) = Ao(u) < A < Ai(u) = gn(u) (34)

and there exist extremal decompositions of u with equality in (25) respectively (26). Therefore, gu and gn are roofs and proposition 3.5 has been proved.

If G is a roof extension of g, the point {u, G(u)} is contained in Q[g]. Hence it can be represented by a convex combination of elements from E. As the dimension of Q[g] is n +1, there are, by a theorem of Caratheodory, pure convex decomposition of length n + 2. This proves proposition 2.1: For Q = Q(H) it follows n + 2 = (d2 — 1) + 2.

On the other hand, a point {u, gu (u)} belongs to a face of the boundary of Q[g]. Its dimension cannot exceed n. Thus there are, again by Caratheodory, pure decompositions of length n + 1. For Q(H) this gives an achievable length d2, an often used fact [33].

Definition 3.2: convex leaves

Let G be a real function on Q. A subset K c Q is called a convex leaf of G if (a) K is compact and convex,

(b) K is the convex hull of K n Qpure,

(c) G is convexly linear on K, i.e.

gE Pj Pj) = Y1 Pj G(pj) if all Pje K

K is called complete, if all pure states which can appear in an optimal decomposition of any p e K are contained in K.

Proposition 3.6

With the assumptions of proposition 3.5 it holds: For gu (respectively gn) and any u e Q there are complete convex leaves containing u.

It makes sense to call the set of all complete convex leaves of G the convex foliation of G or, shortly, the G-foliation.

Proof. The proposition will be proved for gu. The case of gn is similar. There is an affine functions / such that

/ < gu, 1(u) = gu(u) (35)

We define a subset K of Q by

K = {p 11(p)= gu(p) } (36)

Proposition 3.6.a: (36) is a complete gu-leaf.

Clearly, u e K. Let us choose p e K. For an optimal pure decomposition, p = Pjn, one obtains

gu(nj) = gu(p) = 1(p) = pj 1(nj)

However, /(nj) < gu(nj) by assumption. By the equation above, all these inequalities must be equalities. Hence, the pure composers nj of every optimal decomposition of any p e K are contained in K, i.e., K is complete. Now choose another p' e K and let p' = Pknk be an optimal decomposition. For 0 < p < 1 we get, applying first our assumption and then convexity of gu,

1(pp + (1 — p)p') < gu(pp + (1 — p)p') < pgu(p) + (1 — p)gu(p')

By the assumption the right hand side can be written

p/(p) + (1 — p)l(p') = /(pp + (1 — p)p')

and is equal to the left expression. Hence, equality must hold and K must be a convex set. We have seen already that every p e K can be represented by a convex combination of elements from K n Qpure. Because g is continuous, the set of all n satisfying g(n) = /(n) is compact. Hence, K is compact. Indeed, it is convexly generated by a compact set.

We repeat a further standard notation. An element p of a convex set K is called K-inner or "convexly inner" if for any v e K follows (1 + s)p — sv e K and small enough positive s. Geometrically, the line segment from v to p can be prolonged a bit without leaving K. There is also a topological

characterization: A K-inner point is an inner point of K with respect to the affine space generated by K. (Example: The invertible density operators are the convexly inner points of Q(H).)

The intersection of complete convex leaves is either empty or it is a complete convex leaf. Hence there is a minimal complete convex leaf containing a given u e Q, the u-leaf of gu. It is convexly generated by all those n e Qpure which can appear in an optimal decomposition of u.

The u-leaf is the largest convex leaf containing u as convexly inner point.

Now let K1 be the u1-leaf and K2 that of u2. If u1 is a convexly inner point of K2, then K1 c K2. In particular, K1 = K2 if and only if they contain a point which is commonly inner. Let us draw a corollary:

If K2 is properly larger than K1, the convex dimension of K2 must be strictly larger than that of K1.

A chain K1 c K2 c ..., consisting of different complete gu-leaves, cannot contain more than n + 1 members. As above, n denotes the convex dimension of Q. The maximal number of different leaves in any chain is called the depth of the gu-foliation. As said above, the gu-foliation consists of all complete gu-leaves.

In the case Q = Q(H), the depth if bounded by d2. If the roof is an affine function, see example 2.3, exactly the faces of Q are its leaves and the bound is reached.

Let us look again to the setting above in more geometric terms. We shall see that the u-leaves of gu and gn correspond uniquely to the faces of Q[g].

The triple {Q[g], Q, n} is a fiber bundle with bundle space Q[g], base space Q, and projection

n : {u,A} ^ u (37)

In this scheme a roof G becomes a cross section, say sG, by setting

u ^ sG(u) = {u, G(u)} e Q[g] (38)

we get n(sG(u)) = u, which is necessary for a bundle structure.

The boundary, dQ[g], of Q[g] is the union of three disjunct sets:

d0Q[g] = {{u,gu(u)}| gu(u) = gn(u)} (39)

d-Q[g] = {{u,gu(u)}| gu(u) = gn(u)} (40)

d+Q[g] = {{u,gn(u)}| gu(u) = gn(u)} (41)

The cross section (38) with G = gu maps Q onto d0Q[g] U d-Q[g] while the cross section with G = gn maps the base space onto d0Q[g] U d +Q[g].

The fibres degenerate to a point at the boundary part (39) and can be identified with a subset of Q. By proposition 3.2 that subset consists of the pure point and possibly of some faces at which gu = gn, and all roof extensions of g coincide and are affine.

Let us consider a face K contained in the "lower" part d-Q[g] of the boundary (40). K is convex by definition and compact because of the compactness of Q[g]pure. Therefore, the projection K of K to Q, n K = K, is convex and compact, see (37). We use the supposed face property: £> e K implies

£> = ^^ pjilj ^ e K (42)

if all pj > 0. Writing this out in the manner £> = {u, gu(u)}, and so on, we arrive at

{u,gu(u)} = ^Pj{uj,gu(uj)} = {u, ^Pjgu(uj)} (43)

Now we can state Proposition 3.7

There is a one-to-one correspondence between the faces of Q[g] contained in d°Q[g] U d-Q[g] and the complete convex leaves of gu. The cross section sG, with G = gu, maps complete convex leaves of gu onto faces of Q[g]. The bundle projection n returns them back to Q. For the concave roof things are similar.

3.3. Illustrating Examples

Example 3.1: Minimum and maximum of g

On Qpure let gmin be the minimum of g and gmax its maximum. The convex hull of the set

{n e Qpure | g(n) = gmin} (44)

is a complete convex leaf of gu. The convex hull of the set

{n e QpUre | g(n)= gmax} (45)

is a complete convex leaf of gn.

Let us again consider the diagonal map D(X) = diag(X) as in (16) and its von Neumann entropy S(D(.)), see (17). g(n) = S(D(n)) is the output entropy of the pure state n. The Hilbert space dimension is denoted by d. As well known, the minimum output entropy is zero and the maximal

one log d.

Things become more refined by restricting the channel onto a face of Q. As an example we take a short look at the (d — 1)-dimensional subspace H° which is orthogonal to the vector |<^) = d-1/2 |j). H° consists of vectors aj |j) such that aj = 0. H° supports some pure states satisfying D(n) = d-11 and the maximal output entropy is log d again.

There is a reasonable conjecture, saying that the minimal output entropy is independent of d and equal to log 2. There are d(d — 1)/2 pure states j, j < k. The matrix elements anm of j are 1/2 for n = m = j and n = m = k. They are —1/2 for n = j, m = k and m = j, n = k, and all other entries are zeros. Hence it is evident that S(diag(njk)) = log 2 and, therefore,

Ed(p) < log2, p = ^(1 — |^|)

because we can represent p by a convex combination of the pure states The conjecture asserts that the decomposition is an optimal one. The conjecture rests on the fact that for no other state than ffjfc, supported by H°, the output of the diagonal map is of rank two. Then one applies a theorem of Michelson and Jozsa, see appendix of [34], reducing in the case at hand the minimization of the entropy to that of minimizing the second elementary symmetric function or, equivalently, to the minimization of the concurrence. For d =2 this is trivial, for d =3 it can be done, for d > 3 it is yet a conjecture.

Under the assumption, the conjecture is true, the convex set generated by the j is a complete leaf. The minimal length of an optimal decomposition of p is equal to d(d — 1)/2.

Example 3.2: Again the diagonal map

We return to the example 2.4 to prove the flatness of the Entropy (17) of the diagonal map (16). Hence, since we know from von Neumann's work the concavity of u ^ S(D(u)), flatness of (17) proves the diagonal map a flat concave roof for all dimensions d of H. In other words, for

g(n) = S(diag(n)), n e Q(H) (46)

it follows for any density operator u

gn(u) = S (diag(u)) (47)

Proposition 3.8

Choose u e Q(H). The set Kw of all states p with diag(p) = diag(u) is a complete convex leaf of (47). gn is a flat concave roof.

The set Kw is compact, convex, and S(D(.)) is constant on it. Transversal to the sets Kw the function S(D(.)) is strictly concave. This excludes that two density operators with different diagonals can belong to a convex leaf. Hence, the sets Kw are convex leaves.

4. Wootters' Method

We are going to describe the fundamental idea in [13], see also [12], and its generalizations [14]. After a short introduction to anti-linearity, which is on the heart of the method, we present slightly simplified proofs for a class of convex and concave roofs. For reasons of uniqueness we sometimes write (.,.) for the scalar product instead of Dirac's (. |.).

The use of anti-linearity [35] goes back, at least in physics, to Wigner. He applied it to the time reversal symmetry [36] and he discovered the structure of anti-unitary operators, [37]. A highlight in the further development of this line of thinking is the proof of the CPT-theorem within Wightman's axiomatic quantum field theory.

4.1. Anti-Linearity in Short

We start with some elementary remarks. An anti-linear operator, say \$, obeys the rule

\$( «1^1) + a2|02>) = aj\$|01) + a2\$|02) (48)

An important fact follows immediately: Because of c\$ = \$c* the eigenvalues of \$ form a set of circles. Indeed, if |x) is an eigenvector of \$ with eigenvalue a, then e|x), |e| = 1, is an eigenvector with eigenvalue e*a. Consequently, most of the unitary invariants of linear operators are undefined for anti-linear ones. The trace, for example, does not exist for anti-linear operators. The Hermitian adjoint of an anti-linear operator \$ is defined by

(01, \$t 02> = (02,\$01) (49)

There is to set a caution mark: Do not apply an anti-linear operator to a bra in the usual Dirac manner! By (49) one may get absurd results.

A useful class of anti-linear operators are the Hermitian ones. By (49) any matrix representation must result in a complex symmetric matrix. About symmetric matrices see [38]. It follows that the Hermitian anti-linear operators constitute a complex linear space of dimension d(d + 1)/2 if dim H = d.

An anti-unitary, V, is an anti-linear operator which is unitary, i.e., satisfies V t = V-1 .A conjugation, 6, is an anti-unitary which is Hermitian. It implies 62 = 1. In accordance with what has been said about eigenvalues, one can find an orthogonal basis |01),... such that 6|0j) = ej |0j) with arbitrarily chosen unimodular numbers ej.

A conjugation 6 distinguishes a real Hilbert subspace H© of H consisting of all 6-real vectors, 6№) = №).

There is a polar decomposition, § = V|§|, for any anti-linear operator §. |§| denotes the positive root (\$t\$)1/2 and V is an anti-unitary operator. The proof is similar to the linear case [39].

Now we turn to the case of an anti-linear Hermitian operator § = §t. It commutes with the positive (linear!) operator §2 and, therefore, with |§| = (§2)1/2. With a non-singular § we perform 6 = §-1|§| the square of which is 1. As it is Hermitian too, it is a conjugation. We conclude

§ = 6|§| = |§|6, 6 = 6t = 6-1 (50)

By continuity, or by a more detailed analysis, (50) can be verified for all Hermitian and anti-linear §. 4.2. Building Roofs with an Anti-Linear Hermitian §

Let § be Hermitian and anti-linear on a Hilbert space H of dimension d. This setting provides a function

g(n) = n = MM (51)

on the pure states of Q(H). Now gn and gu are well defined and we shall prove:

Proposition 4.1

Let g be as in (51). If |A1 > A2 > ...} denote the eigenvalues of I^/U^^/wI, then

gu(u) = max{0, A1 - £ Aj}, (52)

g» = £ Aj (53)

gu and gn are flat roofs.

At first we simplify the assertion by starting with

§w := VU§VÜ §I = (VU§u§ V^)1/2 (54)

Up to normalization every pure decomposition of u can be gained from a decomposition of the unit operator 1,

u = Vunj-^/U, 1 = nj (55)

(51) is 1-homogeneous on the positive rank one operators. Comparing (55) with (25) and (26), it can be seen that

gu(u) = inf £ I^j, §w^)| , gn (u) = sup £ I^j, §w^)| (56)

where we have to run through all rank one decompositions of 1,

£ №>(№ I = 1 (57)

Now is Hermitian and anti-linear. Therefore there is to any chosen set of phase factors ei, e2,... a basis <p2, ... satisfying

K1 ^> = A,^), ^) = Ajej^) (58)

and the conjugation 6 in the polar decomposition multiplies the j-th basis vector by e,.

For the next step we assume the existence of a real d x d Hadamard matrix. Then we can choose a basis (Ixi)} fulfilling

because of the orthogonality and a2ki = 1 we get for all k

d (Xk, Xk> = £ afciafc, > = £ e,A, (60)

Therefore, by (51), we get

2» <|£ e,A, |< gn(u) (61)

By varying the unimodular numbers e,, which could be chosen arbitrarily, one arrives at

gu(u) < max{0, Ai - J] A,}, gn(u) >£ A, (62)

Assuming equality in (62), we see from (60) that u is a flat point of gn and of gu. If gu(u) > 0, then we choose e1 = 1 and e, = —1 for j > 1 to obtain from (58) an optimal basis {|xk}. In the concave case we set e, = 1 for all j.

Now we are going to prove equality in (62), starting with gu. We clearly get an estimation from below in (56) by

inf | £ a| , a = (№k>| (63)

Sandwiching with the eigenbasis (58) it yields

£o = £^ ^ >> = £e,A, >> ,fc ,fc

and this shows, summing first over k,

| £ | = | £ e, A, | k k

Its minimum is attained by the largest of the two numbers 0 and A1 — A2 — ... and the first equation in (54) is true.

Now we prove equality in (62) for gn. the second equation of (56). It is

|(№k№k>| = |(№k, |0W|№k>|, |№k> = 6|№k>

We apply Cauchy's inequality. The result is

, l^)l2 < №, l^)<^k, l^>

and, because 6 is an involution, hence anti-unitary, we arrive at

Summing up we get the trace of \$ | which upper bounds gn(w).

Up to now the proof of proposition 4.1 rests on particular bases {|xk)}. They exist if there is a real d x d Hadamard matrix, d = dim H. To overcome the restriction we go to a larger Hilbert space, H ©H°, for which the proposition has been proved. Then we restrict to the face of density operators supported by the original Hilbert space H. Because a (flat) roof remains a (flat) roof if restricted to a face, the proof will become complete.

To do so, we choose d' = dim H © H° sufficiently large and extend \$ to \$' by requiring \$'|-0°) = 0 for all |^°) e H°. We then choose any conjugation 6° on H° and use 6' = 6 © 6°. Now, if there is a real d' x d' Hadamard matrix, we are done.

Hadamard matrices exist in dimensions d' = 2m. This suffices for the proof.

Proposition 4.2

Let g(n) = Then gu and gn allow for flat optimal decompositions of length d' where

d < d' = 2m. More generally, if d < d' and there is a real d' x d' Hadamard matrix, then there are flat optimal decompositions of length d'.

4.3. Cases of Application

Indeed, the question is now: How to find a suitable anti-linear Hermitian operator \$ to calculate concurrence, tangle, and entanglement entropy (as particular cases of entanglement of formation) in 2 x n systems. Clearly, this can be fully successful for flat roofs only. Let T be a trace preserving positive map from the states

into the 1-qubit state space Q(H2). Because the trace of the output, Tr T(w) is one, T(w) is characterized, up to a unitary transformation, by one variable. It is common to use 4 det T(w) or its square root to be this variable. Let us abbreviate the convex roofs on Qd, playing a role below. By

(65) is the concurrence, (66) the 1-tangle, and (67) the entanglement of T. (67) is the entanglement of formation if T is a partial trace of a bipartite quantum system. By its very definition we need only the values of det T and of ST for pure input states.

u G dim H = d

CT = 2(V det T )u, (det T)(u) = det T (u) tt = 4(det T )u

Et = (ST )u, ST (u) = S (T (u))

(66) (67)

There are some general relation between these three roofs. The first is typical also for more general settings: CT is a positive convex function and so does its square. For pure input states the tangle and the squared concurrence coincide. Hence, because tt is maximal within all convex extensions, it is not less than Cf. On the other hand, if u turns out to be a flat point of CT, than this remains true for its square. Thus,

Proposition 4.3

For stochastic maps with 1-qubit outputs it holds

Tf (u) > Cf (u)2 (68)

and equality takes place for flat roof points of CT .

Let us now switch to ST. With use the abbreviations n(x) = — x log x and

1 — , „ f1+ У^ 1 „,2 , „2

£(x) = , 1 = x2 + y2 (69)

£ is defined and continuous for — 1 < x < 1 and it is strictly convex. Therefore, £ is the sup of a family of functions ax + b. Inserting a convex function C defined on any convex set with values —1 < C < 1, we get £(C) by a sup of convex functions aC + b. Therefore, £(C) is a convex function on the domain of definition of C.

We apply this fact to the concurrence CT yielding:

u ^ £t(u) := £( Ct(u)) (70)

is a convex function on Vld. CT for pure states n we get ^^det T(n). We insert in (70),

1 — — 4 det T (n^ ^1 + — 4 det T (n)

£f(n) = n(-2-) + n(-2-)

and one identifies the arguments in n as the two eigenvalues of T (n).

£t(n) = S(T(n)), n e Hd'pure (71)

proves £T to be a convex extension of the pure states output entropies. Reasoning as for proposition 4.3 results in

Proposition 4.4

For stochastic maps with 1-qubit outputs it holds

Et(u) > £( Ct(u)) (72)

Equality takes place if u is a flat roof point.

It should be underlined hat there are more and different estimations for concurrence and entanglement of formation in higher dimensions, see [40-44]. In [56] there is an application to states with only two different, but arbitrarily degenerated eigenvalues.

4.4. How to Find \$

There is a general recipe to get the wanted anti-linear operator for channels T mapping the states of a quantum system Hd to 1-qubit states. Assume a Kraus representation

T(X) = £ A,XAt, A, : Hd ^H2 (73)

There is an additional condition to be fulfilled: T must be Kraus representable with not more than two Kraus operators. But at first we remain within the more general (73).

The key to the following is the existence of the "time reversal" or "spin flip" anti-unitary operator 0f on H2,

0f(c°|0) + ci|1)) = c1|0) - c*|1) (74)

Apart from the obvious

the relation

— 1 — —

j = 1(A-Afc - A* Aj ) (77)

0fYf0fY = -(det Y) I2 (75)

is valid for all operators Y e B(H2). Up to a multiplicative constant, only the spin flip commutes with all U e SU(2), It is really a very special anti-unitary operator.

The task is in inserting Y = T(X) into (75) and to get something similar for det T. This goes through particulary nice if X is of rank one, X = |^2)(^1|. Calculations show

detT(|^2)(^i|) = £ <^i,\$jfc^1) <^2,\$j^2>*, e Hd (76)

The anti-linear Hermitian operators \$jk are defined by

using the Kraus operators A, from any Kraus representation (73) of T. The operators \$jk are Hermitian and anti-linear.

In the lucky case of channels (73) with just two Kraus operators, A1 and A2, we get only one operator \$ by (75) and, hence,

V det T (№)M) = |(^,\$^)| (78)

and, by proposition 4.1, we are done.

Wether and how one can replace the operation X ^ \$X\$ by an anti-linear stochastic map to obtain a more general roof construction, is unknown. An (implicit) attempt is in [46] by taking X ^ (Tr X) 1—X as an higher dimensional substitute for the flip operation.

4.5. Applications

The partial trace of a 2-quibt system can be represented by two Kraus operators: Looking at the operators over H2 ® H2 as block matrices, the partial trace over the second part is the map

X = ( X°° X°1) —^ X°° + X11 = Y (79)

One immediately sees a possible choice for the Kraus operators,

Ai = {12, 02}, A2 = -2 {02, 12} (80)

Now we can compute \$ according to (77). We get, eventually up to a sign, Wootters' conjugation,

\$ = ^w,

/0 0f\

4\$ = 0w = i _ 0fJ = 0f 0 0f (81)

Remark: The concurrence of a 2-qubit system is a flat convex roof. Generally, complete convex leaves consists of a set of flat ones.

Let us choose two operators, A1 = A, A2 = B, from B(H2) so that (73) becomes a 1-qubit channel. Then there are only two eigenvalues, À1, À2, of 1^/0*\$ to respect and (52) simplifies to

g» = |À2 _ Ài| (82)

One has to solve a quadratic equation to get the general expression

1 CT(w)2 = Tr (w\$w\$) _ 2(det X) (det \$2)1/2 (83)

There are standard forms for 1-qubit channels, [20,47-49]. For channels with two Kraus operators one can assume

A = ( ^ 0 ) , B = ( 0 6°i ) (84)

V 0 «11 / Vbio 0 y

up to unitary equivalence. With this choice \$ acts as

\$(co|0> + C1|l>) = (&1oaooCo)*|0) _ (6o1a11C1)*|l) (85)

After inserting in the relevant expressions one observes that the concurrence is the restriction of a semi-norm to the state space. Indeed, one obtains, [50,51],

ct(X) = | |&1oaoo|xoo + I^an^n + zxw _ z*xo1 | (86)

z is one of the roots of

z2 = aooan&o1fr1o (87)

5. A Subtraction Procedure

We start with a simple example not covered by Wootters' method and showing the principle. The idea is to subtract from det T(X) a suitable multiple of det(X) to get the squared concurrence or the tangle of a stochastic 1-qubit map T. We choose for T the map

xoo XoA _^ / xoo + (1 _ 7)X11 0 \ (88)

X1o £11/ V 0 7x11/

and consider

7£ooX11 + 7(1 _ 7)x21 _ w(xoo£11 _ £o1 £1o) (89)

With w = y, we arrive at the squared concurrence of T,

4 ct(X)2 = y(1 — Y)x21 + YX°1X1° (90)

At first (90) is a positive semi-definite quadratic form implying that its square root is convex. Secondly, by its very construction it coincides for pure states n with 4 det T (n). Finally, on the state space, it is a roof. To indicate a general way to proof the roof property we polarize (90) and get

(X, Y)T := y(1 — Y)x11y11 + 1Y(x°1 y1° + X1°y°1) (91)

which is a positive semi-definite bilinear form in the space of Hermitian matrices. For the pure state n° = |0)(0| (90) becomes zero. Applying the Schwarz inequality we get (X, n°) = 0 for all X. Hence, with any pure state n,

ws = (1 — s)n° + sn (ws, ws) = s2(n,n) (92)

Taking the root we see that s ^ ws, 0 < s < 1, is a convex leaf of CT for every n. Now the assertion is proved and, the more, CT is not a flat roof.

One may ask, whether one can diminish w a bit without destroying convexity on Q. Let us use in (89) the new value w' = y2. Then (89) becomes

Yx°°x11 + y(1 — Y )xh — Y2(x°°x11 — X°1X1°)

Different to the former case we restrict ourselves to Q(H2) and respect the condition x°° + x11 = 1. After some manipulations we arrive at a convex roof which coincides with det T(n) for pure states. Up to a factor it must be the tangle of T on Q.

4 TT (X) = Y (1 — Y )x11 + Y2x°1X1° (93)

The tangle is affine on the set of density operators with x°1 = constant. As the square of the concurrence is equal to the tangle for pure states, we have the inequality tt(w) > CT(w)2 for mixed states.

That the ansatz (89) is working generally for the concurrence has been shown first in [16,17,52], by means of the "S-lemma of Yakobovich" and, using the explicit expression for general stochastic 1-qubit maps of [20], in [19]. The case of the tangle can be read off from [22].

5.1. Concurrence of Stochastic 1-Qubit Maps

Let T be a stochastic, i.e., a positive trace preserving map. We prove

Proposition 5.1

There is a real number 0 < w < 1 such that for all p e Q(H2)

1 Ct (p)2 = det T (p) — w det p (94)

At first we show the w-bounds. With w < 0, (94) becomes the sum of two concave functions on Q and CT could not be convex. To prove 1 > w we insert p° = (1/2)1 and get det T(p°) > w/4. However, det T(p°) < 1/4 is required by stochasticity. w > 1 would be a contradiction.

Next, we consider the expression (94) on the Bloch space of all Hermitian operators of trace one,

X = 2(1 + Xi 0"! + £2^2 + £303) (95)

The determinant of X is a quadratic function

det X = ^(1 — £2 — x2 — x3)

in the Bloch coordinates. The same is with det T(X). In the terminology of the S-lemma, the quadratic function det T(X) is called co-positive with det X because from det X > 0 it follows det T(X) > 0 under the constraint Tr X = 1.

The S-lemma, [18], states the following: Let q1 and q2 be two quadratic functions on IRn, not necessarily homogeneous. If q1(x) > 0 implies q2(x) > 0 then q2 is co-positive with q1.

S-lemma

Let q1 be strictly positive at least at one point. Then there exists a real number w such that

q2(x) — wq1(x) > 0 for all £ G IRn (96)

if and only if q2 is co-positive with q1.

Now it is proved: The right expression of (94) can be made non-negative with suitable numbers w for all Hermitian trace one operators. Then, substituting £ ^ £/x0 and multiplying by we see that

det Tr(X) — w det X > 0 (97)

becomes a positive semi-definite and homogeneous polynomial in the variables £0, £1, £2, £3 for some w. Polarizing (97) as in (91) yields a positive semi-definite symmetric form (X, Y)w satisfying

(X, X )w = det T (X) — w det X (98)

We now may assume (97) for all values w which are bounded by 1 > w1 > w > w2 > 0. We can further assume that (X, Y)w is degenerated for w = w1 and for w = w2. But wether degenerate or not, (97) implies Cauchy's inequality

|(X,Y)w|2 < (X,X)w(Y,Y)w (99)

In particular, if Y = v is in the null-space, (v, v)w = 0, then det T(v) = w det v and det T(v) > w' det v for all allowed w', i.e.,

(w — w') det v > 0, w1 > w' > w2 (100)

Furthermore, (v, X)w = 0 for all Hermitian X.

We like to show: If w = w2 every density operator p is a roof point.

We have to distinguish several cases. The first one is Tr v = 0. Then, with p G H, we define

ps = p + sv (101)

On this line (ps,ps)W is independent of s. Therefore, because of (94), its intersection with H is a flat convex leaf of CT.

Being Hermitian and not identical zero, Tr v = 0 results in det v < 0. Because of (100) one concludes

w = w2.

For the next cases we suppose Tr v =1 and start with

ps = (1 — s)v + sp (102)

Then (ps, ps)W = s2. If the sign of s does not change while ps is inside the Bloch ball, we can take the root and get a convex leaf. This takes place if v is not an inner point of Q, i.e., not a properly mixed state.

The condition is certainly satisfied if det v = 0 and v is a pure state. The condition implies the w-independence of (v, v)w which becomes equal to det T(v). As there is only one convex roof CT it is w1 = w2 necessarily [23].

v is outside Q if det v = 0. We conclude w = w2 from (100) and we get convex leaves by intersecting the lines (102) with the Bloch ball.

In addition one observes: det v = 0 is necessary for w1 > w2. Indeed, by (100) we see (v, v)w = 0 can be satisfied if either w = w1 and det v > 0 or by w = w2 and det v < 0. Now, all relevant cases are discussed and proposition 5.1 is proved. In the course of the proof one obtains two more general insights:

Proposition 5.2

The concurrence of stochastic 1-qubit maps is the restriction of a Hilbert semi-norm to the state space. Every state allows for an optimal decomposition of length two.

5.2. Axial Symmetric Maps, Concurrence

We shall list the subtraction parameter w for the class of axial symmetric stochastic maps. A standard form for them reads

T(X)= (ax°° + (1 — Y)x11 ) (103)

V £xw YX11 + (1 — a)x°° J

with real non-negative parameters a, £, y. The trace preserving is obvious. Positivity requires 0 < a <

1, 0 < y < 1, and

£2 < ^max := 1 + 2aY — a — y + 2^a(1 — a)Y(1 — Y) (104)

T is a channel, hence completely positive, if £2 < aY. To express w one needs the "critical" £c

£c := 1 + 2aY — a — y — 2^a(1 — a)Y(1 — Y) (105)

Then, see [52],

w = max{£2 ,£c2} (106)

At the bifurcation point £ = £c the T-concurrence is affine on Q. For £ > £c the roof is flat. Otherwise it looks similar to the particular one (88). See [52] for more details.

5.3. Axial Symmetric Maps, Tangle

The tangle for stochastic 1-qubit maps can be found in [16,17]. For 1-qubit channels it is already in [22]. These tangles always allow for optimal decompositions of length two.

The axial symmetric maps (103) can be treated explicitly. The following is due to [53]. Case A: If |£| > |a + 7 — 11 one has to use w = £2. It results in

4 TT (X) = 1 — £2 — (a — y )2 — 2(a — 7 )(a + Y — 1)£3 + [£2 — (a — Y — 1)2]£2 (107)

Case B: Here |£| = |a + 7 — 11, a bifurcation point in the parameter space. w = £2 results in

1 TT (X) = 1 — £2 — (a — y)2 — 2(a — Y)(a + 7 — 1)£3 (108)

and the tangle becomes affine on the Bloch ball.

Case C: If |£| < |a + 7 — 1| then w = (a + 7 — 1)2 and we obtain

1 tt(X) = 1 — (a + y — 1)2 — (a — £)2 — 2(a — 7)(a + 7 — 1)£3 + [(a + 7 — 1)2 — £2](r2 + £2) (109) 6. Symmetries

The use of symmetries is almost obligatory in the treatment of roofs. We present only a small, hopefully helpful, part of it, mainly abstracted from [10,26,27,54,55]. See also [45].

Let H(H) be the space of states supported by the Hilbert space H of dimension d, and g a real continuous function on Hpure.

A symmetry of H is a transformation

u ^ uV := VuV-1 (110)

V is a unitary or an anti-unitary operator inducing the symmetry (110). We need the group r of all V such that

n G Hpure g(nV)= g(n) (111)

r is the invariance group of g. A quite obvious statement reads

Proposition 6.1:

If r is the invariance group of g, then

gu(uV )= gu(u), g>V ) = g» (112)

for all V G r and all u G H.

Let K be a convex leaf of gu. Obviously,

KV = {uV | u G K} (113)

is a convex leaf of gu again. Hence, K ^ KV permutes the convex leaves.

An interesting subgroup of r is the stabilizer group

Tk = {V e r | KV = K} (114)

This is a compact group with an invariant Haar measure. say dKV. We can perform the invariant integration ("twirling") over rK,

w —► Wk = J WvdK V (115)

There is only one rK-invariant element in the convex hull of all wv . It is wk . The map w ^ wk contracts K onto the set

Kstable = {w e K | w = J wvdK V} (116)

This set, being convex and compact, is the convex hull of its extremal invariant states. Extremal invariant states can be represented by nK with pure n e K. Invariant states which are not extremal, cannot be represented in such a way.

Proposition 6.2:

Let K be a convex leaf of gu and rK its stabilizer group. Then K n Qpure consists of rK-orbits.

Every extremal rK-invariant state of K is of the form nK, n pure.

Every rK-invariant states of K is a convex combination of extremal rK-invariant states.

6.1. Entanglement of the Diagonal Channel

In example 3.2 we considered the concave roof of (46),

g(n) = S(diag(n)), n e Q(H)

Now we look at the convex roof gu, i.e., at the entanglement of D(w) = diag(w).

With the exception of d = 2 one does not know the structure of . But there are some insights on highly symmetric, "isotropic" quantum states.

The channel D will be described by the help of a basis | j), j = 1,..., d. To it we associate the vector

w> = ^ ) (117>

The invariance group, r, of (117) consists of the permutations of the chosen basis, eventually followed by the conjugation 6 defined by 6|j) = |j) for all j. The density operator w commutes with r if its matrix elements satisfy

(j |w|j) = ., (j |w|k) = X (118)

for all j and all k = j. x is a real number in the range

1 < x < 1 (119)

The restriction is due to the positivity of u. One often uses the fidelity parameter, F,

0 - F := Mu№> = (d —1)£ +1 - 1 (120)

d — 1

and we denote the corresponding r-invariant density operator by uF.

We choose an allowed value F and write Kw or K (F) for the complete convex leaf of uF with respect to . Now we state the following:

p g Kw ^ 6p = p6 (121)

6 is the conjugation about the basis {|j>}.

Proof: It suffices to prove the assertion for pure states. We assume that the pure states n and n' = 6n6 are both in Kw. The diagonal parts of them and of p = (1/2)(n + n') are the same. It follows (p) = (n) = (n') and, because we are inside a convex leaf, we get also gu(p) = (p). Hence, by proposition 3.2, = on the whole face containing n and n'. This is a contradiction if n = n'. Indeed, we proved something more:

Proposition 6.3:

Any two different pure states contained in a convex leaf of must have different diagonal parts. The r-invariant density operators are ordered by the fidelity parameters as indicated by (120). The more, F ^ uF is convexly linear in F. This fact allows to apply proposition 6.2.

Proposition 6.4:

Let K (F) denote the compact convex leaf of belonging to the r-invariant density operator uF. There is a subset R of the unit interval as follows:

a) Either we have F G R. Then K(F) consists of flat roof points only. There is no other maximal symmetrical state in K(F) than uF.

b) Or there are F-, F+ G R such that K(F) is the convex hull of K(F-) n K(F+). In the case d =3 and if

- < F < F** F** = -2 - - ' 9

or F = 0 case a) is true. There is an optimal vector of the form a|1> + b|2> + b|3> for any of these F-values. Kw = K(F) contains not more than three pure states. They become permuted by the action of the invariance group r.

For more details, also in higher dimensions, see [55].

6.2. An Embedding

There are numerous relations between different channels. Some of them provide insight in roof structures. Our main interest is again in the diagonal channels.

Let H and H' be Hilbert spaces of dimensions d and d' > d. There are embeddings of H into H' which relate the entanglement and of the corresponding diagonal maps, D and D'.

For their description we first choose d integers, mi,..., md, such that d' = mi + ... + md and enumerate the basis vectors of H' as

|jk), j = 1,..., d, k = 1,..., m j (122)

We further choose numbers

j, j = 1,...,d, k = 1,...,mj (123)

satisfying

£ j |2 = 1, j = 1,...,d (124)

These data provide a unitary embedding

|jV|j) = £ j | j, k) (125)

diag(X) = {xii,..., Xdd} (126)

we get

diag(VXVf) = {|yii|2Xii, . . . , |yimi |2Xii, |y2i|2X22, . . . |y2mi |2X22, . . .} (127)

One obtains for the entropy of the diagonal channel

mi m.2

Sd (VXVf) = £ n(|yik |2xii) + £ n(|y2fc |2X22) + ... (128)

fc=i fc=i

The functional equation n(xy) = yn(x) + xn(y) allows to rewrite the first sum in (128) into the form

£ |yifc|2n(xii) + xii £ n(|yifc|2)

and we get finally

SD'(VwVt) = SD(w) + £(j|w|j) £ n(|yjk|2) (129)

j=i fc=i

A convex roof remains a convex roof if we add a function linear in w. Plugging (129) into (25) directly provides:

Proposition 6.5:

If H is embedded unitarily in H' according to (125), then the entanglements of the diagonal channels are related by

Ed' (VwVt) = Ed (w) + l(w) (130)

and the linear function is given by

M = £0'Mj > £ n( j |2) (131)

j=i fc=i

Optimal decompositions are mapped onto optimal decomposition and convex leaves onto convex leaves. A particular simple example is the embedding

V |0> = |1>, V |1> = -1=(|2> + |3>) (132)

of H2 into H3. Pairs of pure state vectors, yielding flat optimal decompositions for the entanglement of

D2, are

ac|0> + a1|1>, a1|0> + a0|1> (133)

A particular case is a0 = a/1/3, a1 = \/2/3. Applying the map (132) results in the optimal pair

1(| 1> + |2> + |3>), 11> ^y6(|2> + |3>) (134)

Call n0 and n1 the pure states determined by the vectors (134). Then

diag(no) = {3,1, 3}, diag(n1) = {3, 6, 6} (135)

and the fidelity parameters (120) are 1 and F** = 8/9. Returning to the remarks after proposition 6.4, we see a reason why this value should be a bifurcation point for the behavior of maximal symmetric states and their convex leaves.

6.3. A Further Embedding

There are strong relations between the entanglement of the diagonal channels and the entanglement of formation, governed by embedding procedures. A nice and quite simple one is

V|j> = |jj> = |j> 0 |j> (136)

V is a unitary map of H onto the subspace H' of Ha 0Hb with basis {| jj>}. The embedding is of interest because of

D(X) := diag(X) = Tr6(VXVf), X G B(H) (137)

The relation implies

E((VuVf)) = Ed(u), u G H(H) (138)

and relates the entanglement ED of a diagonal map to the entanglement of formation E for bipartite states supported by H'. This is true for all dimensions d = dim H. The vector (117) becomes a completely entangled one, say |e>, if transformed by (136).

The crucial point is now that invariance group re of |e> — V|^> is much larger than VrV^, the invariance group of |^>. re contains the local unitary operators U 0 U and the swap operation. The involution V6)t = 6 0 6 is defined originally only on H'. The canonical extension to an involution 6e of all Ha 0 Hb can be gained by

6e|jk> = |kj > (139)

and the requirement of anti-linearity. 6e satisfies

6e(X 0 1)|e> = (Xf 0 1)|e> (140)

for all X e B(H°) [57].

Now one tries to enlarge convex leaves in H' by transforming them with operators from a suitable larger group r' C re. The involution 6e is a symmetry of the entanglement of formation. If a bipartite state p commutes with 6e, all elements of the convex leaf of p must commute with 6e.

One can understand quite well why for maximal symmetric states are so similar to the entanglement of formation for isotropic states. A detailed discussion is not in the frame of the present paper. However, an essential point in the considerations above is in the relation between the entanglement of diagonal channels and the entanglement of formation. This may be of use in future research: It seems easier to imagine the structure of the diagonal channel as that of the partial trace. Nevertheless, the degree of difficulty is about the same.

7. Summary and Outlook

Given values g(n) for pure states n, the direct way of solving the convex roof problem is the search for optimal decompositions. The most prominent and successful examples are the concurrence and the entanglement of formation for 2-qubit bipartite quantum systems. The method goes back to Wootters and is described in section 4. With it one gets analytical expressions and flat optimal decompositions. The flatness of the convex (and concave) roofs inherited from Wootters' method is rendering its use in higher dimensions.

A quite different way is to look for a maximal convex extension G of g : If for any other extension G' of g we find G'(w) > G(w) for a state w e Q, then G' cannot be convex.

A further, and more efficient reformulation of the convex roof problem asks for roof points, (see definition 2.1a), of a convex extension G of g. At a roof point w of a convex extension G one gets G(w) = gu(w) and the problem is solved for the particular state w. Similarly, if G would be a concave extension of g, then G(w) = gn(w) for a roof point of G.

This way of proving is used in the chapter on the "subtraction procedure". One of its merits is the control on the concurrence and on the 1-tangle of any rank two density operator of a 2 x m bipartite quantum system. The same is with the slightly more general class of stochastic, (just positive and trace preserving), 1-qubit channels.

Therefore, there is some hope to get the concurrence (and the 1-tangle) for all states of any 2 x m bipartite quantum system explicitly.

But even if this becomes true, it does not provide us with the entanglement of formation of a 2 x 3 system: The concurrence ceases to be flat. However, by proposition 4.1 one can obtain reasonable lower bounds.

Wootters' and the subtraction method seem to be quite different in spirit. Uniting the strength of both, would be very useful. Also one should look at the subtraction method in more general terms. One can get at least lower bounds on the concurrence for higher dimensional system as shown by two examples in [52]. A more systematic study of the issue seems prospective.

The use of symmetries is well know and efficient in general. In convex roof construction the symmetries of g as of a function on the pure states is what counts. If a state w is invariant with respect to a symmetry group r, its convex leaf, (see definitions 3.2), is the convex hull of a set of T-orbits consisting of pure states. The shapes of the leaves can be quite different. However, one would suppose a smooth

change of the leaves with the exception of some bifurcation points (or lines ... ) at which the dimension of the leaves is changing. Some help comes from embedding a lower dimensional problem into a higher dimensional one. This is shown for the entanglement of the diagonal channel: ET can be computed in any dimension on 2-dimensional subspaces which contain at least one pure diagonal state. On these subspaces ET is the sum of a flat convex roof and a linear function. The study of more examples is certainly desirable.

At this point we can return to the concurrence of the stochastic 1-qubit maps. For them CT is the restriction of a Hilbertian semi-norm to the state space. The proof of proposition 5.1 shows a one to one correspondence between the structure of the foliation and the null-space of the semi-norm. Two stochastic 1-qubit maps come with the same pattern of their convex leaves if the null-spaces of their semi-norms are identical. Indeed, it is the first class of channels and roofs with a complete classification of their convex leaves and their foliation.

Acknowledgements

I like to thank M. Hellmund for many valuable discussions. I wish to acknowledge the helpful and valuable advices of the referees and of P. Harremoes, Editor-in Chief of Entropy.

References and Notes

1. Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information; Cambridge University Press: Cambridge, UK, 2000.

2. Vidal, G. Entanglement monotones. J. Mod. Opt. 2000, 47, 355.

3. Bengtsson, I.; Zyczkowski, K. Geometry of Quantum States; Cambridge University Press: Cambridge, UK, 2007.

4. Horodecki, R.; Horodecki, P.; Horodecki, M.; Horodecki, K. Quantum entanglement. Rev. Mod. Phys. 2009, 81, 865-942.

5. Rockafellar, R.T. Convex Analysis; Princeton University Press: Princeton, NJ, USA, 1970.

6. Bennett, C.; DiVincenzo, D.; Smolin, J.; Wootters, W. Mixed state entanglement and quantum error correction. Phys. Rev. A 1996, 54, 3824-3851.

7. Hayden, P.; Leung, D.; Winter, A. Aspects of general entanglement. Comm. Math. Phys. 2007, 265, 95117.

8. Holevo, A.S. Quantum probability and quantum statistics (in Russian). Probl. Perdeachi Inf. 1973, 9,3.

9. Connes, A.; Narnhofer, H.; Thirring, W. Dynamical entropy of C*-algebras and von Neumann algebras. Comm. Math. Phys. 1987,112, 681-719.

10. Benatti, F.; Narnhofer, H.; Uhlmann, A. Decompositions of quantum states with respect to entropy. Rep. Math. Phys. 1996, 38, 123-141.

11. Uhlmann, A. Entropy and optimal decompositions of states relative to a maximal commutative subalgebra. Open Sys. Inf. Dyn., 1998, 5, 209-227.

12. Hill, S.; Wootters, W.K. Entanglemant of a pair of quantum bits. Phys. Rev. Lett. 1997, 78 5022-5025.

13. Wootters, W.K. Entanglement of formation of an arbitrary state of two qubits. Phys. Rev. Lett. 1998, 80, 2243-2248.

14. Uhlmann, A. Fidelity and concurrence between conjugated states. Phys. Rev. A 2000, 62, 032307.

15. Wootters, W.K. Entanglement of formation and concurrence. Quantum Inf. Comput. 2002, 1, 27-47.

16. Hildebrand, R. Concurrence of Lorentz-positive maps. arXiv: quant-ph/0612064; 2006.

17. Hildebrand, R. Concurrence revisted. J. Math. Phys. 2008, 48, 102108.

18. Polik, I.; Terlaky, T. A Survey of the S-Lemma. SIAM Rev. 2007, 3, 371-418.

19. Hellmund, M.; Uhlmann, A. Concurrence of stochastic 1-qubit maps. arXiv:0802.209 (quant-ph).

20. Gorini, V.; Sudarshan, E.C.G. Extreme affine transformations. Commun. Math. Phys. 1976, 46, 43-52.

21. Coffman, V.; Kundu, J.; Wootters, W.K. Distributet entanglement. Phys. Rev. A 2000, 61, 052306.

22. Osborne, T.; Verstraete, F. General monogamy inequaltiy for bipartite qubit entanglement. Phys. Rev. Lett. 2006, 96, 22503.

23. This does not affect the 1-tangle. Though (93) results from a subtraction procedure, it is not an application of the S-lemma: tt becomes negatve for x00 ^ ro.

24. If the null space is 2-dimensional the convex leaves of CT become 2-dimensional too. A 3-dimensional null-space forces CT to be constant.

25. Osterloh, A.; Siewert, J.; Uhlmann, A. Tangles of superpositions and the convex-roof extension. Phys. Rev. A 2008, 77, 032310.

26. Vollbrecht, K.G.; Werner, R.F. Entanglement measures under symmetry. Phys. Rev. A 2001, 64, 0623307.

27. Terhal B.M.; Vollbrecht, K.G. The entanglement of formation for isotropic states. Phys. Rev. Lett. 2000, 85, 2625-2628.

28. Ohya, M.; Petz, D. Quantum Entropy and Its Use; Springer: New York, NY, USA, 1993.

29. A flat roof point can allow for several optimal decompositions, some of them flat and some of them not flat.

30. Levitan, L.B. Entropy defect and information for two quantum states. Open Sys. Inf. Dyn. 1994, 2,319-329.

31. Thirring, W. 1994, unpublished.

32. This is the very reason the present author introduced the notation "convex roof".

33. If g is not continuous, an optimal decomposition may not exist, even if we allow for infinite length.

34. Mitchison, G.; Jozsa, R. Towards a geometrical interpretation of quantum information compression. Phys. Rev. A 2004, 69, 032304.

35. Anti-linear Operators are also called a "conjugate linear" ones.

36. Wigner, E.P. Über die Operation der Zeitumkehr in der Quantenmechanik. Nachr. Ges. Wiss. Göttingen, Math.-Physikal. Klasse 1932, 31, 546-559.

37. Wigner, E.P. Normal form of anitunitary operators. J. Math. Phys. 1960,1, 409-413.

38. Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: Cambridge, UK, 1990.

39. The polar decomposition for anti-linear operators is equivalent to the Takaki decomposing of symmetric matrices.

40. Chen, K.; Albeverio, S.; Fei, Sh.-M. Entanglement of formation of bipartite quantum states. Phys. Rev. Lett. 2005, 95, 21051.

41. Chen, K.; Albeverio, S.; Fei, Sh.-M. Concurrence of arbitrary dimensional bipartite quantum states. Phys. Rev. Lett. 2005, 95, 040504.

42. Lozmski, A.; Buchleitner, A.; Zyczkowski, K.; Wellens, T. Entanglement of 2xK quantum systems. Europhys. Lett. 2003, 62, 168.

43. Mintert, F.; Kus, M.; Buchleitner, A. Concurrence of mixed bipartite quantum states of arbitrary dimensions. Phys. Rev. Lett. 2005, 95, 260502.

44. Osborne, T. Entanglement for rank-2 mixed states. Phys. Rev. A, 2005, 72, 022399.

45. Fei, S.; Li-Jost, X. R-function related to entanglement of formation. Phys. Rev. A, 2006, 73, 024302.

46. Rungta, R.; Buzek, V.; Caves, C.M.; Hillery, M.; Milburn, G.J.; Wootters, W.K. Universal state inversion and concurrence in arbitrary dimensions. Phys. Rev. A 2001, 64, 042315.

47. Fujiwara, A.; Algoet, P. One-to-one parametrization of quantum channels. Phys. Rev. A 1999, 59, 3290-3294.

48. Ruskai, M.B.; Szarek, S.; Werner, E. An analysis of completely-positive trace-preserving maps on 2x2 matrices. Lin. Alg. Appl. 2002, 347, 159-187.

49. King, C.; Ruskai, M.B. Minimal entropy of states rmerging from noisy quantum channels. IEEE Trans. Info. Theor. 2002, 47, 1-19.

50. Uhlmann, A. On concurrence and entanglement of rank two channels. Open Sys. & Inf. Dyn. 2005,12, 1-14.

51. Uhlmann, A. Concurrence and foliations induced by some 1-qubit channels. Int. J. Theor. Phys. 2003, 42, 983-999.

52. Hellmund, M.; Uhlmann, A. Concurrence and entanglement entropy for stochastic 1-qubit maps. Phys. Rev. A 2009, 70, 052319.

53. Hellmund, M. personal communication, 2009.

54. Benatti, F.; Narnhofer, H.; Uhlmann, A. Optimal decompositions with respect to entropy and symmetries. Lett. Math. Phys. 1999, 47, 237-253.

55. Benatti, F.; Narnhofer, H.; Uhlmann, A. Broken symmetries in the entanglement of formation. Int. J. Theor. Phys. 2003,42, 983-999.

56. Fei, S.; Jost, J.; Li-Jost, X.; Wang, G. Entanglement of formation for a class of quantum states. Phys. Lett. A 2003, 310, 333.

57. 6e is the so-called modular conjugation with defining vector |e).