Quantum Separability in Polynomial Time

Abstract

The quantum separability problem asks whether a bipartite density matrix is separable or is $\hat{I}\cdot$-far from every separable state. We give a randomized polynomial-time algorithm for this problem for every fixed constant gap $\hat{I}\cdot >0$, when distance is measured in the Euclidean norm.