Derivation of the Lewenstein-Sanpera Decomposition via Semidefinite Programming

Authors:
M. A. Jafarizadeh;M. Mirzaee;M. Rezaee
Affiliations:
-;-;-
Venue:
Quantum Information Processing
Year:
2005

Citing 5
Cited 0

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Semidefinite programming

SIAM Review
Convex Optimization

Convex Optimization
Quasi-maximum-likelihood multiuser detection using semi-definiterelaxation with application to synchronous CDMA

IEEE Transactions on Signal Processing
Design of orthogonal pulse shapes for communications viasemidefinite programming

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many theoretical proposals appeared recently, semidefinite programming was considered as a way to express quantum entanglement. Using semidefinite optimization method, we prove the Lewenstein---Sanpera lemma in a simple elegant manner. Particularly, using this method we obtain Lewenstein---Sanpera decomposition for some examples such as: generic two qubit state in Wootters's basis, Iso-concurrence state, Bell decomposable state and 2 驴 3 Bell decomposable state.