Published May 6, 2002
| public
Journal Article
Open
Distinguishing Separable and Entangled States
Chicago
An error occurred while generating the citation.
Abstract
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the more complicated tests are strictly stronger. The new criteria are tractable due to powerful computational and theoretical methods for the class of convex optimization problems known as semidefinite programs. We successfully applied the results to many low-dimensional states from the literature where the PPT test fails. As a by-product of the criteria, we provide an explicit construction of the corresponding entanglement witnesses.
Additional Information
©2002 The American Physical Society Received 12 December 2001; published 23 April 2002 It is a pleasure to acknowledge conversations with Hideo Mabuchi, John Doyle, John Preskill, and Patrick Hayden. This work was supported by the Caltech MURI Center for Quantum Networks, the NSF Institute for Quantum Information, and the Caltech MURI Center for Uncertainty Management for Complex Systems.Files
DOHprl02.pdf
Files
(95.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:4a2c2224baf1701951763fe20f9a40f4
|
95.5 kB | Preview Download |
Additional details
- Eprint ID
- 2032
- Resolver ID
- CaltechAUTHORS:DOHprl02
- Created
-
2006-03-02Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field