An Improved Semidefinite Programming Hierarchy for Testing Entanglement
DownloadAccepted version (764.0Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
© 2017, Springer-Verlag Berlin Heidelberg. We present a stronger version of the Doherty–Parrilo–Spedalieri (DPS) hierarchy of approximations for the set of separable states. Unlike DPS, our hierarchy converges exactly at a finite number of rounds for any fixed input dimension. This yields an algorithm for separability testing that is singly exponential in dimension and polylogarithmic in accuracy. Our analysis makes use of tools from algebraic geometry, but our algorithm is elementary and differs from DPS only by one simple additional collection of constraints.
Date issued
2017Department
Massachusetts Institute of Technology. Center for Theoretical PhysicsJournal
Communications in Mathematical Physics
Publisher
Springer Nature
Citation
Harrow, A. W., A. Natarajan, and X. Wu. "An Improved Semidefinite Programming Hierarchy for Testing Entanglement." Communications in Mathematical Physics 352 3 (2017): 881-904.
Version: Author's final manuscript
ISSN
1432-0916