Semidefinite programming lower bounds on the squashed entanglement
arXiv:2203.03394
Abstract
The squashed entanglement is a widely used entanglement measure that has many desirable properties. However, as it is based on an optimization over extensions of arbitrary dimension, one drawback of this measure is the lack of good algorithms to compute it. Here, we introduce a hierarchy of semidefinite programming lower bounds on the squashed entanglement.
arXiv comment10 pages, comments welcome