Practical construction of positive maps which are not completely positive
arXiv:2001.01181
Abstract
This article introduces PnCP, a MATLAB toolbox for constructing positive maps which are not completely positive. We survey optimization and sum of squares relaxation techniques to find the most numerically efficient methods for this construction. We also show how this package can be applied to the problem of classifying entanglement in quantum states.
arXiv comment19 pages, 5 figures; associated Matlab package is available from https://bitbucket.org/Abhishek-B/pncp/
References in corpus (5)
- Separability criterion and inseparable mixed states with positive partial transposition
- Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
- PENLAB: A MATLAB solver for nonlinear semidefinite optimization
- Sums of squares and varieties of minimal degree
- Construction of noisy bound entangled states and the range criterion