Home | About Journal | Web Links | E-mail Alerts | RSS RSS Icon | Browse
Previous Article Next Article

General algorithm for manipulating nonlinear and linear entanglement witnesses by using exact convex optimization

Source: Phys. Rev. A 80, 052307 (2009); doi:10.1103/PhysRevA.80.052307

Published 9 November 2009

KEYWORDS and PACS
Keywords
PACS
  • 03.67.Mn
    Entanglement measures, witnesses, and other characterizations (quantum information)
  • 03.65.Ud
    Entanglement and quantum nonlocality
  • YEAR: 2009
PUBLICATION DATA
Publisher:
AIP is a member of CrossRef APS
M. A. Jafarizadeh,1,2,3 K. Aghayar,1 and A. Heshmati1
1Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran
2Institute for Studies in Theoretical Physics and Mathematics, Tehran 19395-1795, Iran
3Research Institute for Fundamental Sciences, Tabriz 51664, Iran

We consider the problem of obtaining the entanglement witnesses for a given quantum system. We present a method to convert this problem to a standard convex optimization problem by defining a feasible region. Then we develop a generic two-step algorithm for this problem which can be applied to the entanglement detection of N-partite quantum system. This permits an organized construction of nonlinear and linear entanglement witnesses for a given quantum system. To demonstrate the capability of this approach, we apply our results to several three-qubit systems which in some cases lead to necessary and sufficient conditions for separability. ©2009 The American Physical Society
History: Received 1 June 2009; published 9 November 2009
Permalink: http://link.aps.org/abstract/PRA/v80/e052307
ADVERTISEMENT