Two-qubit trace-norm geometric discord: the complete solution

We present the complete solution of the problem of determination of trace-norm geometric discord for arbitrary two-qubit state. Final answer is achieved due to effective reduction of the problem to the study of critical points of certain mapping depending on projectors. Our results are illustrated on various, also new, families of two-qubit states and compared to already known special solutions.


Introduction
It is a common belief that question of the explicit quantitative characterization of correlations for a two-qubit systems can always be answered, but actually in many cases we land on a uncharted territory, where the explicit answer is not known [1][2][3]. One of these situations is the strict solution of the question of trace-norm quantum geometric discord D 1 for an arbitrary state of the two-qubit system. The two-qubit system is the simplest non-trivial compound system which we have at our disposal to study quantum correlations and all relevant tools invented to measure them [1]. The geometric quantum discord measured by means of the distance induced by the trace norm seems to be one of the solid candidates. Contrary to the geometric discord defined by means of the Hilbert-Schmidt distance, it is well defined and satisfies requirements of the bona fide measure of quantum correlations. As it is well known, the Hilbert-Schmidt distance yields to an anomalous behavior related to it geometric discord D 2 , but it has an attractive property that it can be calculated relatively easy. The procedure for calculating geometric discord involves the minimization which for generic states for the trace distance is rather challenging. As we have shown for qutrits and higher-dimensional bipartite systems it can be hardly operationally/analytically performed, except for selected families of states [4].
In the present work we show how explicitly the D 1 can be determined and we reveal the geometry of the problem of minimization, which in turn deepens the understanding of the intrinsic geometry of the two-qubit quantum state space. For the Hilbert-Schmidt distance quantum discord D 2 such a question has been answered in a compact form by Dakić et al. [5], namely the explicit formula for the D 2 has been obtained. The ease of computation does not heal the non-physical behavior of the D 2 under the local evolution of the system [6] and its non-contractibility under completely positive trace preserving mappings.
The trace-norm measurement-induced geometric discord is well-defined correlation measure. For two qubits it is also equal to the standard geometric discord defined as the distance from a given state to the set of classical-quantum states [7,8] and it is more convenient to use quantity based on the disturbance induced by measurement. Such quantity will be simply called geometric quantum discord. However, its calculation is still rather challenging, and by now no explicit answer for arbitrary two-qubit state has been known. According to our best knowledge supported by the recent review on the quantum correlations and geometric quantum discord [3], prior to the present work only few answers were found for selected families of states: (a) for the Bell diagonal states (or states with maximally mixed marginals) [9], (b) for the X-shaped states [10], (c) for the states with the correlation matrix having only one nonzero singular value and arbitrary Bell vectors of the marginals-such class contains, in particular, so-called quantum-classical states [10].
The objective of this study is to provide the complete solution of the problem of giving the explicit value of geometric quantum discord D 1 (ρ) for arbitrary two-qubit state ρ.
We find the answer to the minimization problem which has nice geometric meaning.
As an illustration, we analyze previously known partial solutions for above-mentioned families of states and indicate mechanism making that these solutions were so much simpler. The paper is organized as follows: In Sect. 2, we briefly review basic notions and fix the relevant notation. Then, in Sect. 3, we prove the theorem giving characterization of the central formula for the trace norm of the disturbance of the system by a local projective measurements. To guide the reader gently to the full solution, in Sect. 4, we compute the D 1 (ρ) for the relatively large family of states for which the minimization procedure is not necessary at all or is straightforward. Section 5 is central for the final result; there we study the critical points of the trace-norm disturbance mapping and obtain that there are two possibilities: singular critical points and smooth critical points. As a preliminary application, we apply new results to the states with maximally mixed marginals. In Sect. 6 we prove the main result: the determination of the trace-norm geometric discord in general case. Finally, Sect. 7 will allow reader to make contact with known solutions and go beyond the family of the X-shaped states. We finish the paper with some conclusions and comments on the main findings and obstructions to their extensions to higher-dimensional systems.

Preliminary notions
In the description of two-qubit systems we follow general formulation of d-level quantum systems introduced in [4], specified to the case d = 2.

Two qubits
Qubit is a two-level quantum system. The corresponding Hilbert space equals to C 2 , and the observables are given by Hermitian elements of full matrix algebra M 2 (C). As a basis in M 2 (C), we use standard Pauli matrices σ 1 , σ 2 , σ 3 and the identity matrix 1 2 . In the following we will use the notation Then, from the properties of Pauli matrices it follows that The set E 2 of all states of two-level system can be parametrized as follows: where ||n|| ≤ 1. So E 2 is given by the unit ball in R 3 and the pure states correspond to the unit sphere ||n|| = 1. Consider now two qubits A and B. It is convenient to parametrize the set of states of composite system as follows: where x, y ∈ R 3 and K = (K jk ) is the correlation matrix. Notice that The parametrization (2.3) is chosen in such a way that the marginals tr A ρ and tr B ρ are given by the vectors x and y as in (2.2). Let us discuss now the adjoint representation of the group SU (2). LetÛ ∈ SU(2) and define 3 × 3 matrix U by The matrix U is real and orthogonal. In this way to eachÛ ∈ SU(2) there corresponds U ∈ SO(3). In contrast to general case, when d = 2 such obtained group is exactly equal to the group SO (3). Consider now the local transformations of the state of two qubits ρ →Û * ⊗V * ρÛ ⊗V ,Û ,V ∈ SU(2) (2.4) The corresponding vectors x, y and the correlation matrix K transform as follows: where U , V are the adjoint representations ofÛ ,V , respectively. Since in the case of qubits we can use the full group of orthogonal transformations to diagonalize correlation matrix, any two-qubit state is locally equivalent to the state with diagonal K .

Trace-norm geometric discord
Let ρ be a state of bipartite system AB. When we perform local measurement on the subsystem A, the state ρ may be disturbed due to such measurement. The tracenorm (one-sided) measurement-induced geometric discord is defined as the minimal disturbance induced by projective measurement P A on subsystem A, computed using the trace distance in the set of states. It can be compared with the standard geometric discord equal to the distance from a given state to the set of classical-quantum states [5]. At it was already stated in Introduction, in the case of qubits these two notions coincide, and it is more convenient to use the quantity based on the disturbance induced by the measurement which will be simply called trace-norm geometric discord. The formal definition is as follows [9]: where ||A|| 1 = tr |A|.
In the case of qubits, the local projective measurement P A is given by the onedimensional projectors P 1 , P 2 on C 2 , such that One-dimensional projectors P k can be always chosen as where Define now a real orthogonal projector P on R 3 Pm, σ = P( m, σ ), m ∈ R 3 (2.8) If P 0 denotes such projector given by (2.7), where we take P 0 1 and P 0 2 , then P 0 = diag(0, 0, 1) and Define also orthogonal complements to P 0 and P Notice that in this case the projectors M run over the whole set of projectors with dimension 2. Now we compute the disturbance of the state (2.3) caused by measurement P A . We have where e k , k = 1, 2, 3 are the vector of the canonical basis of R 3 . So where Q is obtained from Q by taking vector x = U x and matrix K = U K V T instead of x and K .

Trace norm of disturbance S(M)
In this section we find the elegant formula for the trace norm of the disturbance S(M) (see [10] for the other version of such formula).
where || · || denotes the Euclidean norm in R 3 and E = adj K is the adjunct matrix of the correlation matrix K (i.e., the transpose of its cofactor matrix).
Proof We start the proof of this theorem with the formula for Q(M) = S(M)S(M) . By a direct computation we obtain where F k are the generators of SO(3), given by which satisfy covariance relations To further simplify (3.2) consider locally equivalent state for which the correlation matrix is diagonal. So, for a proper transformations U 0 , V 0 ∈ SO(3), we have and I 0 is diagonal Let E 0 = adj(I 0 ) be the adjunct matrix of I 0 . Then where ε 1 = i 2 i 3 , ε 2 = i 1 i 3 , ε 3 = i 1 i 2 . First, we show the identity . The formula (3.4) follows since For any orthogonal transformation V define the mapping τ V : M 2 (C) → M 2 (C) as follows: Now using the identity (3.4) we can transform the formula (3.2) to obtain Observe that where vector v is given by the third column of the matrix V . Similarly Let us now introduce the matrix This matrix has a block diagonal form with blocks The spectral analysis of R 0 (M) is easy since characteristic polynomials for the blocks are given by where the +(−) sign corresponds to the lower (upper) block. One can also check that the vectors I 0 Mx 0 and E 0 v are orthogonal, so The formula (3.8) can be further simplified, and we arrive at (3.9) Now applying the inverse to the transformation (3.3), we finally obtain the formula (3.1).

Solving the minimization problem in the simple case
To compute the geometric discord of a given state, we have to find minimum of the mapping M → ||S(M)|| 1 . In general it is a hard problem and its general solution will be described in the next sections. Now, let us consider a class of two-qubit states for which the solution of this problem is straightforward. This class (denoted by E 0 ) contains the states (2.3) with arbitrary Bloch vectors x, y and the correlation matrix of the form where V 0 is some orthogonal matrix and t is a real parameter. From general properties of the two-qubit states, it follows that t belongs to the interval |t| ≤ 1, but the actual value of t depends on the choice of the matrix V 0 and vectors x, y. To apply the formula (3.1), notice that and minimal value is achieved for such M which projects on x ⊥ in R 3 . Thus, we have Theorem 4.1 For every state ρ ∈ E 0 , geometric discord is given by Characterization of the class E 0 is not an easy task. Partial information can be obtained considering locally equivalent states with diagonal correlation matrix. Therefore, let us consider the correlation matrix K of the form In the following we restrict our analysis to I 1 = 1 3 and I 2 = diag(1, −1, 1). In the first case we obtain the family of states Similarly, in the second case, we have Notice that the relation between parameters a, b, w, z and Bloch vectors x, y is as follows: and To obtain more specific information we must restrict the number of parameters. The simplest is the case when Bloch vectors equal to zero vector. Then, (4.1) contains the one-parameter family of Werner states On the other hand, (4.2) contains the family of isotropic states Isotropic states can be obtained as a mixture of maximally mixed state ρ ∞ = 1 4 1 4 and maximally entangled state + given by i.e., On the other hand, the Werner statesρ W with reversed parametrization (t → −t) can be obtained as the mixture of ρ ∞ and the state − , where So both states are locally equivalent. More interesting is the case of states with non-trivial Bloch vectors. For simplicity we consider the vectors of the form In this case the properties of the states (4.1) and (4.2) differ significantly. In particular, On the other hand, the positivity region for ρ 2 is given by the conditions

Formulation of the problem
In this section we start to analyze the real problem of finding minimum of the trace norm ||S(M)|| 1 in general case. As a first step, we will study critical points of the mapping M → ||S(M)|| 1 . Since the projector The vector v is given by the third column of the matrix V ∈ SO(3) relating P and P 0 (2.9). To study critical points of trace norm of disturbance, it is useful to consider the auxiliary function g defined on the unit sphere S 2 ⊂ R 3 with values in R 2 . The function is defined as follows: and Notice that using the functions (5.2) and (5.3), the formula (3.1) can be rewritten as In the following we will consider the mapping g as a function of two-dimensional projectors M or vectors v ∈ S 2 . The formulas (5.2) and (5.3) can be further simplified if we introduce the following operators W y z = z, y y, y, z ∈ R 3 (5.4) and where x is a Bloch vector. Now we obtain and From Eq. (5.6) we obtain, in particular, that where λ 1 ≤ λ 2 ≤ λ 3 are the eigenvalues of real nonnegative matrix L + . The relation (5.8) allows to obtain the first general result concerning the value of geometric discord D 1 (ρ). Namely we have From the relation (5.8) we can also derive well-known exact formula for Hilbert-Schmidt norm geometric discord D 2 (ρ) [5]. By definition Obviously, for any two-qubit state The right-hand side of (5.9) in some cases gives not only the lower bound but the exact value of discord D 1 . It can happen for such states ρ for which The order of eigenvalues of (5.11) depends on θ . For θ ∈ [0, π/4] sin 4 θ ≤ sin 2 θ cos 2 θ and for such θ On the other hand, one can check that so in this case we obtain only the lower bound. Now for θ ∈ (π/4, π/2] sin 2 θ cos 2 θ ≤ sin 4 θ and for such θ which equals to the value of D 1 (ρ θ ).

Singular critical points
We see that the problem of finding minimum of the mapping M → ||S(M)|| 1 is relatively easy when it is achieved on the set and where we dropped the term proportional to 1 − ||v|| 2 . Using (5.13) and (5.14) one can show that the set (5.12) can be discrete or it can be equal to the whole sphere S 2 . It follows from the following lemma, which can be proved by a direct computation.
Remark 5. 1 One can check that in the discrete case, the set D can contain only one or two projectors, if we identify the vectors v and −v.
For the further analysis it is crucial to have a convenient criterion that enables to decide whether the value of D 1 (ρ) is achieved at a critical point belonging to the set D or S 2 \ D. To obtain such criterion, consider the function For any t * > 0 consider the function And finally, define the family of regions t * , t * ≥ 0 such that 0 = and for t * > 0 Suppose now that the function g 1 restricted to D achieves at some vector v * ∈ D its absolute minimum. Let Ran g be the range of the function g. The values of D 1 (ρ) are achieved at v * ∈ D if and only if So we obtain for all v ∈ S 2 , and

Remark 5.2
Notice that if the conditions (5.16) and (5.17) are not satisfied, then the value g 1 (v * ) gives the upper bound for D 1 (ρ), i.e., Now we determine the minimal value g 1 (v * ). To this end, consider the following cases: 1. λ 1 > λ 2 > λ 3 . The solutions of (5.15) are given by Note that λ 2 ≥ 0. The equality (5.19) is valid in any orthonormal basis. But if we choose the basis of ordered and normalized eigenvectors of L − , then is also valid and we obtain 3. λ 1 = λ 2 = λ 3 . In this case D = S 2 and the formula (5.19) is valid.
So we have the following

Proposition 5.2 For all vectors
where int denotes the intermediate value and λ 1 , λ 2 , λ 3 are the eigenvalues of the matrix L − .

Remark 5.3
Notice that if the Bloch vector x is zero vector, then the function g 1 is constant on the set D and equals to 2 int {λ 1 , λ 2 , λ 3 }, where λ 1 , λ 2 , λ 2 are the eigenvalues of the matrix K K T .

Smooth critical points
Smooth critical points v 0 ∈ S 2 \ D satisfy Applying differential analysis to the set S 2 \ D one can find all smooth critical points of the mapping M → ||S(M)|| 1 . Let To find critical points of g we look for the possible solutions of the equation is a solution of (5.23) if there exists a real number μ such that v is a solution of the above eigenvector problem. Applying the above results one can prove the following theorem: i.e., v is the solution of (5.23) if and only if On the other hand, the information about the Lagrange multiplier ω can be recovered from Eq. (5.25) that leads to G μ P v = ω P v (5.26)

First application: states with maximally mixed marginals
General analysis of Eqs. (5.23) or (5.25) will be presented in the next section; here we consider the first application to the states with maximally mixed marginals (MMM states), i.e., such states ρ that In this case the Bloch vectors x and y are zero vectors. Let K be the correlation matrix of MMM state ρ. Using the local transformation one can bring the matrix K K T to the diagonal form diag (i 2 . Now Eq. (5.15) for the set D has a form  2 1 or μ = i 2 2 , which is in a contradiction with the assumption that μ / ∈ {i 2 1 , i 2 2 , i 2 3 }. So we conclude that the square of the discord can be achieved in the set μ ∈ {i 2 1 , i 2 2 }, since i 2 3 can be excluded because of the lower bound given by Theorem 5.1 Similarly, one also obtains the formula (5.29) in the case when i 2 The set D is equal to the whole sphere S 2 , the function (5.22) is constant, and we again obtain (5.29). Thus, we confirm the known result (see, e.g., [9])

Main result: determination of quantum discord in general case
In this section we use Eq. (5.25) to solve the main problem, namely to find the value of geometric discord in general case. It is convenient to consider the matrix (5.24) with respect to ordered basis of orthonormal eigenvectors of the operator L − . (We will assume that λ 1 ≥ λ 2 ≥ λ 3 .) When we also neglect the parts which commute with the projectors P v , we obtain the matrix In the following we will also use the matrices = − ( λ 1 − λ 2 ) 1 3 and Notice that if L − has a degenerate spectrum, the form of the operator G μ is particularly simple and the desired minimal value of M → ||S(M)|| 1 can be found in a straightforward way.

Non-degenerate spectrum of L −
Assume that λ 1 > λ 2 > λ 3  Proof Suppose that critical points do not satisfy the condition v 1 v 2 v 3 = 0 and moreover let v 3 x 1 − v 1 x 3 = 0. The condition v 1 v 2 v 3 = 0 implies that the critical points are outside the set D. Notice that μ + x, v 2 ≥ 0. Since (5.25) is satisfied, the following strict inequality is true By a direct computation one can find the representation of μ along the critical points of the function g, described by the condition To find the critical points of the mapping M → ||S(M)|| 1 we use the condition (5.22), which now reads To obtain the result, let us assume that Eq. (6.1) has a non-empty set of solutions. Then, we get that But this representation can not be valid outside the set D and we obtain the contradiction with our assumption. Let now Eq. (6.2) has the non-empty set of solutions. Then, we get and after simplifications we obtain But this is impossible, as this leads to the condition v 2 = 0. Finally, let v 3 x 1 −v 1 x 3 = 0. Then, Eq. (5.25) gives This condition together with (5.22) leads again to v 2 = 0.
The assumption of non-degeneracy of the spectrum of L − is relevant in the above result. On the other hand, the proof suggests that the location of critical points of the mapping M → ||S(M)|| 1 given by Proposition 6.1 is not optimal. Indeed, if, for example, x 1 = 0, the critical points cannot satisfy v 1 = 0 if v 2 v 3 = 0. Similarly, if x 3 = 0, the critical points never lay on the big circle v 3 = 0 with v 1 v 2 = 0, unless λ 1 + λ 3 > 2 λ 2 and the following condition is satisfied The additional information of this kind can simplify the determination of quantum discord in some situations. Nevertheless, we will not discuss this improvements here and focus on the direct method of finding the absolute minimum of the mapping M → ||S(M)|| 1 . Now we can go to the solution of the main problem. This is a problem of minimizing the quadratic form μ, restricted to the big circles. The calculations are elementary but tedious, so we do not present all details.
1. Let us start with v 1 = 0. One can find Inserting the minimum μ min one gets 3. Let finally v 2 = 0. This case is not so straightforward. One needs to introduce the additional parameter. We start with the formula To describe the absolute minimum of the function (6.3), we need to consider auxiliary functions. The complexity of formulae below mainly follows from the presence of the absolute value in (6.3). Let us define functions p(θ ) and r (θ ), as follows: The common domain of p(θ ) and r (θ ) is the closed interval [−π, π]. To define these functions we need the gap angle ϕ gap ∈ (0, π/2), determined by the equation Moreover, let σ : [−π, π] → [−1, 1] be any function such that and O gap be the open set Now we are ready to define Finally, let θ * and θ * * be the angles defined below in two steps. First, let x 1 x 3 = 0. Define , , sin θ * * = − If x 1 x 3 = 0, we pass to the one-sided limits x 1 → 0 ± or x 3 → 0 ± (or both) in the formulas (6.4) and (6.5). The left and right limits can only differ by sign, but this has no importance as the functions p(θ ) and r (θ ) give the same result in these situations.
To obtain the upper bound for quantum discord, define and Then, one can show that The above analysis leads to the following result.
Theorem 6.1 In the case of non-degenerate spectrum of the matrix K K T − W x , the value of trace-norm geometric discord is given by with μ * , μ * * given by (6.6) and (6.7), respectively.

Degenerate spectrum of L −
When there is any degeneracy in the spectrum of L − , the analysis simplifies significantly. From the above discussion we obtain:

Examples
In this section we present the applications of Theorems 6.1 and 6.2 to the cases already known in the literature as well as to the new examples of states. But we start with considering again, from the wider perspective, the results obtained in Sects. 4 and 5.4.

The class E 0
In this case the correlation matrix is of the form K = t V 0 , where V 0 is orthogonal and the Bloch vectors x and y are arbitrary. Thus So we can apply Theorem 6.2 to obtain D 1 (ρ) = |t|

The class of MMM states
In this case Bloch vectors x and y are zero vectors, so Let λ 1 ≥ λ 2 ≥ λ 3 be the eigenvalues of K K T . When the eigenvalues are degenerate, we apply Theorem 6.2 and obtain D 1 (ρ) = √ λ 2 . In the non-degenerate case we must apply Theorem 6.1 and the computation is more involved. Observe that in the case of MMM states where obviously μ * * = λ 2 . To show that μ * also equals to λ 2 one checks that θ * = 0. Then so by (6.6), μ * = λ 2 . Thus

Pure states
It is well known that up to the local equivalence, every pure state has the form The corresponding correlation matrix and Bloch vector are given by an we can apply Theorem 6.2 to obtain On the other hand, the measure of entanglement defined by negativity gives the same value.

The class containing quantum-classical states
Now we apply our results to the class of states with arbitrary Bloch vector x and correlation matrix having only one nonzero singular value. Such class, in particular, contains quantum-classical states [10]. We can always assume that One can check that possible critical points lay on the big circle v 2 = 0 or are given by (0, ± 1.0). By a direct inspection one gets that the minimal value can be achieved only on the circle v 2 = 0. So we are left with one-dimensional minimization problem. This can be done by a direct analysis (see [10]), but we apply our general result. To find value of D 1 (ρ) we need only μ * and μ * * which take the form with θ * ∈ (ϕ gap , ϕ gap ) and θ * * ∈ (−π/2, −ϕ gap ) ∪ (ϕ gap , π/2). After a direct but quite lengthy computations one finds that the absolute minimum is given by μ * and the value of discord reads Notice that this formula is in a full agreement with the result obtained in [10].

Summary
Let us now summarize the results reported in the article. First, we have obtained new compact and elegant formula for the trace norm of the disturbance S(M) of the general two-qubit state. We want to emphasize that to obtain this result we have used the qubit structure of subsystems in the crucial way. In the general qudit case we were able only to find simplified formula for the square of the modulus of disturbance and only for the special classes of states [4]. It seems that the computation of trace norm of S(M) in general case is a highly non-trivial or even not possible at all. Then, we have applied the formula for ||S(M)|| 1 to compute the value of geometric discord in the situation when the minimization procedure is not needed at all or is straightforward. This is the case of the class of states with arbitrary Bloch vectors and the correlation matrix proportional to some orthogonal matrix in three dimensions, i.e., K = t V 0 . In particular, for such states with zero Bloch vectors, ||S(M)|| 1 = |t| and D 1 (ρ) = |t|. The presence of nonzero Bloch vectors only slightly changes the trace norm, and the minimization can be done in elementary way. This again must be contrasted with the general qudit case, where the similar results are valid only for vanishing Bloch vectors and the classes of Werner and isotropic states [4]. As a first step toward the computation of D 1 (ρ) in general case, we considered critical points of the mapping M → ||S(M)|| 1 . To solve this problem, we introduce the function g defined on the unit sphere S 2 ⊂ R 3 with values in R 2 . Any critical point of the mapping M → ||S(M)|| 1 is a critical point of the function g, and the properties of this function can be used to isolate singular and smooth critical points. It is remarkable that the information about critical points is encoded in the spectrum of the matrix L − = K K T − W x . One of the most important results of our study says that when this spectrum is non-degenerate, the critical points are located on big circles in S 2 . It means that the problem of finding geometric discord reduces to minimization of the quadratic form restricted to big circles. The complete