Algorithm for characterizing stochastic local operations and classical communication classes of multiparticle entanglement
arXiv:1203.5872 · doi:10.1103/PhysRevA.86.032307
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.
10 pages, 4 figures
References in corpus (28)
- Quantum entanglement
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Three qubits can be entangled in two inequivalent ways
- Entanglement detection
- On the volume of the set of mixed entangled states
- Unextendible Product Bases and Bound Entanglement
- Four qubits can be entangled in nine different ways
- Classification of mixed three-qubit states
- Separability of very noisy mixed states and implications for NMR quantum computing
- Distinguishing separable and entangled states
- Taming multiparticle entanglement
- Separability criteria for genuine multiparticle entanglement
- Classification of multi-qubit mixed states: separability and distillability properties
- Largest separable balls around the maximally mixed bipartite quantum state
- Quantum inseparability as local pseudomixture
- Optimal spin squeezing inequalities detect bound entanglement in spin models
- Experimental multiparticle entanglement dynamics induced by decoherence
- Estimating entanglement measures in experiments
- Entanglement of three-qubit Greenberger-Horne-Zeilinger-symmetric states
- Typical entanglement in multi-qubit systems
- Optimal Detection of Entanglement in GHZ States
- Generation and detection of bound entanglement
- A complete criterion for separability detection
- Experimental generation of pseudo bound entanglement
- Detecting separable states via semidefinite programs
- A Decomposition of Separable Werner States
- Separable balls around the maximally mixed state for a 3-qubit system
- Quantum Sign Permutation Polytopes
Cited by in corpus (19)
- Scaling of genuine multiparticle entanglement at a quantum phase transition
- Estimating entanglement monotones with a generalization of the Wootters formula
- Characterizing multipartite entanglement classes via higher-dimensional embeddings
- Convex optimization over classes of multiparticle entanglement
- Dissociation and annihilation of multipartite entanglement structure in dissipative quantum dynamics
- Multiparticle entanglement as an emergent phenomenon
- Building separable approximations for quantum states via neural networks
- Experimental construction of a W-superposition state and its equivalence to the GHZ state under local filtration
- Bipartite entanglement-annihilating maps: necessary and sufficient conditions
- Detecting Entanglement of Unknown Quantum States with Random Measurements
- Certifying Quantum Separability with Adaptive Polytopes
- Bound entangled Bell diagonal states of unequal local dimensions, and their witnesses
- Partial Multipartite Entanglement in the Matrix Product State Formalism
- Device-Independent Test for Genuine Multipartite Entanglement
- Separable ellipsoids around multipartite states
- Multiparticle Entanglement Resolution Analyzer based on Quantum-Control-Assisted Uncertainty Relation
- Multiparty Entanglement Microscopy of Quantum Ising models in 1d, 2d and 3d
- Algorithm for evaluating distance-based entanglement measures
- Small quantum networks in the qudit stabilizer formalism