DocumentCode
3269008
Title
Entanglement witnesses and semidefinite programming
Author
Parrilo, Pablo A. ; Doherty, Andrew C. ; Spedalieri, Federico M.
Author_Institution
Autom. Control Lab., ETH, Zurich, Switzerland
Volume
4
fYear
2002
fDate
10-13 Dec. 2002
Firstpage
4575
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.
Keywords
optimal control; quantum entanglement; computational criteria; duality structure; entanglement witnesses; positive partial transpose; quantum states; semidefinite programming; squares decomposition; Automatic control; Automatic programming; Heart; Laboratories; Probability distribution; Quantum computing; Quantum entanglement; Quantum mechanics; Sufficient conditions; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2002, Proceedings of the 41st IEEE Conference on
ISSN
0191-2216
Print_ISBN
0-7803-7516-5
Type
conf
DOI
10.1109/CDC.2002.1185097
Filename
1185097
Link To Document