An Improved Semidefinite Programming Hierarchy for Testing Entanglement

@article{Harrow2015AnIS,
  title={An Improved Semidefinite Programming Hierarchy for Testing Entanglement},
  author={A. Harrow and Anand Natarajan and Xiaodi Wu},
  journal={Communications in Mathematical Physics},
  year={2015},
  volume={352},
  pages={881-904}
}
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… Expand
Semidefinite Programming Strong Converse Bounds for Classical Capacity
Semidefinite optimization for quantum information
Epsilon-net method for optimizations over separable states
Semidefinite programming converse bounds for classical communication over quantum channels
  • X. Wang, Wei Xie, R. Duan
  • Computer Science, Mathematics
  • 2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
Non-Asymptotic Entanglement Distillation
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness
...
1
2
...

References

SHOWING 1-10 OF 99 REFERENCES
Complete family of separability criteria
Estimating operator norms using covering nets
Strong NP-hardness of the quantum separability problem
Quantum de Finetti theorem measured with fully one-way LOCC norm
All Languages in NP Have Very Short Quantum Proofs
  • Hugue Blier, A. Tapp
  • Mathematics, Computer Science
  • 2009 Third International Conference on Quantum, Nano and Micro Technologies
  • 2009
Epsilon-Net Method for Optimizations over Separable States
Near-Optimal and Explicit Bell Inequality Violations
...
1
2
3
4
5
...