Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Entanglement witnesses and semidefinite programming

Author(s):

P.A. Parrilo, A. Doherty, F. Spedalieri
Conference/Journal:

IEEE Conference on Decision and Control, Las Vegas, USA
Abstract:

We study the application of sums of squares decompositions and semidefinite programming in the formulation of computational criteria for distinguishing entangled from separable quantum states. A hierarchy of tests is obtained, the simplest of which corresponds to the well-known positive partial transpose (PPT) sufficient criterion, with the more complicated tests being strictly stronger. The duality structure of the problem allows us to provide an explicit construction of the entanglement witnesses corresponding to our tests.

Year:

2002
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { ParDoh:2002:IFA_1035,
    author={P.A. Parrilo and A. Doherty and F. Spedalieri},
    title={{Entanglement witnesses and semidefinite programming}},
    booktitle={IEEE Conference on Decision and Control},
    pages={},
    year={2002},
    address={Las Vegas, USA},
    month=dec,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=1035}
}
Permanent link