Range criterion and classification of true entanglement in a2×M×Nsystem

2005/06/30 by Lin Chen, Yi-Xin Chen · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #quant-ph

paper · pdf · doi:10.1103/physreva.73.052310

published as Phys. Rev. A73(2006)052310 · 7 papes, no figure, Revtex. This is the published version

openalex publication_date 2006/05/15 · arxiv created 2006/05/23 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

We propose a range criterion that is a sufficient and necessary condition satisfied by two pure states transformable into each other under reversible stochastic local operations assisted by classical communication. We also provide a systematic method for seeking all kinds of true entangled states in the 2\ifmmode×\else\texttimes\fiM\ifmmode×\else\texttimes\fiN system, and can effectively distinguish them by means of the range criterion. The efficiency of the criterion and the method is exhibited by the classification of true entanglement in some types of tripartite systems.

Citations

• Three qubits can be entangled in two inequivalent ways

Cited by

• The parametric symmetry and numbers of the entangled class of 2 × M × N system
• Inductive classification of multipartite entanglement under stochastic local operations and classical communication