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

Quantum Information Processing

Derivation of the Lewenstein–Sanpera Decomposition via Semidefinite Programming

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

Published Aug 1, 2005• 9 citations
Publisher
DOI
10.1007/s11128-005-5657-0

Related papers

Remarks on the Lewenstein–Sanpera decomposition

Mingjun Shi, Jiangfeng Du

arXiv:quant-ph/0012145•Physics Letters A•Jul 1, 2001•2 citations

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

Guo Chuan Thiang, Philippe Raynal, Berthold‐Georg Englert

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.

arXiv:0909.4599•Physical Review A•Nov 11, 2009•5 citations

Semidefinite programming and combinatorial optimization

Franz Rendl

Applied Numerical Mathematics•Mar 1, 1999•52 citations

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•5 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

Semidefinite programming and its applications to approximation algorithms

Thomas Hofmeister, Martin Hühne

Lecture notes in computer science•Jan 1, 1998•1 citation
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.