Algorithm for characterizing stochastic local operations and classical communication classes of multiparticle entanglement
Quantum Physics
2012-09-11 v2
Abstract
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to prove that a quantum state lies within a given convex set. Our algorithm generalizes a recent algorithm for proving separability of quantum states [J. Barreiro et al., Nature Phys. 6, 943 (2010)]. We give several examples which show the wide applicability of our approach. We also propose a procedure to determine a vicinity of a given quantum state which still belongs to the considered convex set.
Cite
@article{arxiv.1203.5872,
title = {Algorithm for characterizing stochastic local operations and classical communication classes of multiparticle entanglement},
author = {Hermann Kampermann and Otfried Gühne and Colin Wilmott and Dagmar Bruß},
journal= {arXiv preprint arXiv:1203.5872},
year = {2012}
}
Comments
10 pages, 4 figures