Abstract
We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.
- Received 4 August 2009
DOI:https://doi.org/10.1103/PhysRevA.81.052310
©2010 American Physical Society