Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0909.4599 · Physical Review A

Optimal Lewenstein-Sanpera decomposition of two-qubit states using semidefinite programming

Guo Chuan Thiang, Philippe Raynal, Berthold‐Georg Englert

Published Nov 11, 2009• 5 citations
arXivHTMLPDF

Abstract

We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera decomposition (LSD) of two-qubit states. We first provide a simple and natural derivation of the Wellens-Ku\ifmmode \acute{s}\else \'{s}\fi{} equations for full-rank states. Then, we obtain a set of necessary and sufficient conditions for the optimal decomposition of rank-3 states. This closes the gap between the full-rank case, where optimality conditions are given by the Wellens-Ku\ifmmode \acute{s}\else \'{s}\fi{} equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an analytic expression for the optimal LSD of a special class of rank-3 states. Finally, our formulation ensures efficient numerical procedures to return the optimal LSD for any arbitrary two-qubit state.

DOI
10.1103/physreva.80.052313

Related papers

Degree of separability of bipartite quantum states

Guo Chuan Thiang

We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified with the degree of separability of the state. In a recent work, the problem was solved for two-qubit states using semidefinite programming. In this paper, we describe a procedure to obtain the optimal decomposition of a bipartite state of any finite dimension via a sequence of semidefinite relaxations. The sequence of decompositions thus obtained is shown to converge to the optimal one. This provides a systematic method to determine the so-called optimal Lewenstein-Sanpera decomposition of any bipartite state. Numerical results are provided to illustrate this procedure, and the special case of rank-2 states is also discussed.

arXiv:1005.3675•Physical Review A•Jul 26, 2010•4 citations

BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD

M. A. Jafarizadeh, Mehdi Mirzaee, M. Rezaee

The present methods for obtaining the optimal Lewenestein–Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein–Sanpera decomposition by using semi-definite programming. In particular, we obtain the optimal Lewenstein–Sanpera decomposition for some examples such as: the Bell decomposable state, the iso-concurrence state, the generic two-qubit state in the Wootters basis, the 2⊗3 Bell decomposable state, the d⊗d Werner and isotropic states, a one parameter 3⊗3 state, and finally a multi-partite isotropic state.

arXiv:quant-ph/0606075•International Journal of Quantum Information•Dec 1, 2004•11 citations

L-S decomposition for 2x2 density matrix by using Wootters's basis

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

An analytical expression for optimal Lewenstein-Sanpera (L-S) decomposition of a generic two qubit density matrix is given. By evaluating the L-S decomposition of Bell decomposable states, the optimal decomposition for arbitrary full rank state of two qubit system is obtained via local quantum operations and classical communications (LQCC). In Bell decomposable case the separable state optimizing L-S decomposition, minimize the von Neumann relative entropy as a measure of entanglement. The L-S decomposition for a generic two-qubit density matrix is only obtained by using Wootters's basis. It is shown that the average concurrence of the decomposition is equal to the concurrence of the state. It is also shown that all the entanglement content of the state is concentrated in the Wootters's state |x_1> associated with the largest eigenvalue \lambda_1 of the Hermitian matrix \sqrt{\sqrt{rho}\tilde{rho}\sqrt{rho}} . It is shown that a given density matrix rho with corresponding set of positive numbers \lambda_i and Wootters's basis can transforms under SO(4,c) into a generic 2x2 matrix with the same set of positive numbers but with new Wootters's basis, where the local unitary transformations correspond to SO(4,r) transformations, hence, \rho can be represented as coset space SO(4,c)/SO(4,r) together with positive numbers lambda_i.

Quantum Information and Computation•May 1, 2003•10 citations

Optimal Lewenstein–Sanpera decomposition for some bipartite systems

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of a product set) on the separable–entangled boundary, the optimal Lewenstein–Sanpera (LS) decomposition (with respect to an arbitrary separable set) can be obtained via a direct optimization procedure for a generic entangled density matrix. On the basis of this, we obtain the optimal LS decomposition for some bipartite systems such as 2 ⊗ 2 and 2 ⊗ 3 Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one-parameter and three-parameter local operations and classical communications (LOCC), d ⊗ d Werner and isotropic states and a one-parameter 3 ⊗ 3 state. We also obtain the optimal decomposition for multi-partite isotropic states. It is shown that in all 2 ⊗ 2 systems considered here the average concurrence of the decomposition is equal to the concurrence. We also show that for some 2 ⊗ 3 Bell decomposable states, the average concurrence of the decomposition is equal to the lower bound of the concurrence of the state presented recently in Lozinski et al (2003 Preprint quant-ph/0302144), so an exact expression for concurrence of these states is obtained. It is also shown that for a d ⊗ d isotropic state where decomposition leads to a separable and an entangled pure state, the average I-concurrence of the decomposition is equal to the I-concurrence of the state.

arXiv:quant-ph/0304019•Journal of Physics A Mathematical and General•Feb 11, 2004•10 citations

Optimal unambiguous discrimination of quantum states

M. A. Jafarizadeh, Mahdi Rezaei, Naser Karimi +1 more

Unambiguous discrimination between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this study, using the connection between Lewenstein-Sanpera decomposition (LSD) and optimal unambiguous state discrimination (OPUSD), an analytic relation for the feasible region of $N$ linearly independent quantum states is presented in terms of inner product of reciprocal states. Then, for the real inner product of states, an exact analytic solution for the OPUSD problem involving an arbitrary number of pure linearly independent quantum states is presented using the Karush-Kuhn-Tucker convex optimization method. In another approach, an analytic relation for the feasible region for an arbitrary number of pure linearly independent quantum states is presented in terms of the inner product of states. To this end, the relevant semidefinite programming task is reduced to a linear programming (LP) one with a feasible region of polygon type which can be solved via simplex method. Moreover, using the obtained feasible region, an exact analytic solution to an OPUSD problem involving two and three pure linearly independent quantum states is provided.

arXiv:0708.2323•Physical Review A•Apr 16, 2008•40 citations

Designing optimal quantum detectors via semidefinite programming

Yonina C. Eldar, Alexandre Megretski, George C. Verghese

We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing among a collection of quantum states, represented by a set of density operators. We show that the design of the optimal detector can be formulated as a semidefinite programming problem. Based on this formulation, we derive a set of necessary and sufficient conditions for an optimal quantum measurement. We then show that the optimal measurement can be found by solving a standard (convex) semidefinite program. By exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum, the optimal measurement can be computed very efficiently in polynomial time within any desired accuracy. Using the semidefinite programming formulation, we also show that the rank of each optimal measurement operator is no larger than the rank of the corresponding density operator. In particular, if the quantum state ensemble is a pure-state ensemble consisting of (not necessarily independent) rank-one density operators, then we show that the optimal measurement is a pure-state measurement consisting of rank-one measurement operators.

arXiv:quant-ph/0205178•IEEE Transactions on Information Theory•Apr 1, 2003•168 citations
We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera decomposition (LSD) of two-qubit states. We first provide a simple and natural derivation of the Wellens-Ku\ifmmode \acute{s}\else '{s}\fi{} equations for full-rank states. Then, we obtain a set of necessary and sufficient conditions for the optimal decomposition of rank-3 states. This closes the gap between the full-rank case, where optimality conditions are given by the Wellens-Ku\ifmmode \acute{s}\else '{s}\fi{} equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an analytic expression for the optimal LSD of a special class of rank-3 states. Finally, our formulation ensures efficient numerical procedures to return the optimal LSD for any arbitrary two-qubit state.
We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified with the degree of separability of the state. In a recent work, the problem was solved for two-qubit states using semidefinite programming. In this paper, we describe a procedure to obtain the optimal decomposition of a bipartite state of any finite dimension via a sequence of semidefinite relaxations. The sequence of decompositions thus obtained is shown to converge to the optimal one. This provides a systematic method to determine the so-called optimal Lewenstein-Sanpera decomposition of any bipartite state. Numerical results are provided to illustrate this procedure, and the special case of rank-2 states is also discussed.
The present methods for obtaining the optimal Lewenestein–Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein–Sanpera decomposition by using semi-definite programming. In particular, we obtain the optimal Lewenstein–Sanpera decomposition for some examples such as: the Bell decomposable state, the iso-concurrence state, the generic two-qubit state in the Wootters basis, the 2⊗3 Bell decomposable state, the d⊗d Werner and isotropic states, a one parameter 3⊗3 state, and finally a multi-partite isotropic state.
An analytical expression for optimal Lewenstein-Sanpera (L-S) decomposition of a generic two qubit density matrix is given. By evaluating the L-S decomposition of Bell decomposable states, the optimal decomposition for arbitrary full rank state of two qubit system is obtained via local quantum operations and classical communications (LQCC). In Bell decomposable case the separable state optimizing L-S decomposition, minimize the von Neumann relative entropy as a measure of entanglement. The L-S decomposition for a generic two-qubit density matrix is only obtained by using Wootters's basis. It is shown that the average concurrence of the decomposition is equal to the concurrence of the state. It is also shown that all the entanglement content of the state is concentrated in the Wootters's state |x_1> associated with the largest eigenvalue \lambda_1 of the Hermitian matrix \sqrt{\sqrt{rho}\tilde{rho}\sqrt{rho}} . It is shown that a given density matrix rho with corresponding set of positive numbers \lambda_i and Wootters's basis can transforms under SO(4,c) into a generic 2x2 matrix with the same set of positive numbers but with new Wootters's basis, where the local unitary transformations correspond to SO(4,r) transformations, hence, \rho can be represented as coset space SO(4,c)/SO(4,r) together with positive numbers lambda_i.
It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of a product set) on the separable–entangled boundary, the optimal Lewenstein–Sanpera (LS) decomposition (with respect to an arbitrary separable set) can be obtained via a direct optimization procedure for a generic entangled density matrix. On the basis of this, we obtain the optimal LS decomposition for some bipartite systems such as 2 ⊗ 2 and 2 ⊗ 3 Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one-parameter and three-parameter local operations and classical communications (LOCC), d ⊗ d Werner and isotropic states and a one-parameter 3 ⊗ 3 state. We also obtain the optimal decomposition for multi-partite isotropic states. It is shown that in all 2 ⊗ 2 systems considered here the average concurrence of the decomposition is equal to the concurrence. We also show that for some 2 ⊗ 3 Bell decomposable states, the average concurrence of the decomposition is equal to the lower bound of the concurrence of the state presented recently in Lozinski et al (2003 Preprint quant-ph/0302144), so an exact expression for concurrence of these states is obtained. It is also shown that for a d ⊗ d isotropic state where decomposition leads to a separable and an entangled pure state, the average I-concurrence of the decomposition is equal to the I-concurrence of the state.
Unambiguous discrimination between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this study, using the connection between Lewenstein-Sanpera decomposition (LSD) and optimal unambiguous state discrimination (OPUSD), an analytic relation for the feasible region of NNN linearly independent quantum states is presented in terms of inner product of reciprocal states. Then, for the real inner product of states, an exact analytic solution for the OPUSD problem involving an arbitrary number of pure linearly independent quantum states is presented using the Karush-Kuhn-Tucker convex optimization method. In another approach, an analytic relation for the feasible region for an arbitrary number of pure linearly independent quantum states is presented in terms of the inner product of states. To this end, the relevant semidefinite programming task is reduced to a linear programming (LP) one with a feasible region of polygon type which can be solved via simplex method. Moreover, using the obtained feasible region, an exact analytic solution to an OPUSD problem involving two and three pure linearly independent quantum states is provided.
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing among a collection of quantum states, represented by a set of density operators. We show that the design of the optimal detector can be formulated as a semidefinite programming problem. Based on this formulation, we derive a set of necessary and sufficient conditions for an optimal quantum measurement. We then show that the optimal measurement can be found by solving a standard (convex) semidefinite program. By exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum, the optimal measurement can be computed very efficiently in polynomial time within any desired accuracy. Using the semidefinite programming formulation, we also show that the rank of each optimal measurement operator is no larger than the rank of the corresponding density operator. In particular, if the quantum state ensemble is a pure-state ensemble consisting of (not necessarily independent) rank-one density operators, then we show that the optimal measurement is a pure-state measurement consisting of rank-one measurement operators.