Best separable approximation with semi-definite programming method

Simple item page
dc.creatorJafarizadeh, M. A.
dc.creatorMirzaee, M.
dc.creatorRezaee, M.
dc.date2006-06-08
dc.date.accessioned2026-07-07T07:19:00Z
dc.date.available2026-07-07T07:19:00Z
dc.descriptionThe 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 semidefinite programming. Specially, we obtain the optimal Lewenstein-Sanpera decomposition for some examples such as: Bell decomposable state, Iso-concurrence state, generic two qubit state in Wootters's basis, $2\otimes 3$ Bell decomposable state, $d\otimes d$ Werner and isotropic states, a one parameter $3\otimes 3$ state and finally multi partite isotropic state.
dc.description23 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0606075
dc.identifierhttp://arxiv.org/abs/quant-ph/0606075
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114508
dc.subjectQuantum Physics
dc.titleBest separable approximation with semi-definite programming method
dc.typetext

Files

Collections

arXiv