0503129v2

related topics
{entanglement, phys, rev}
{let, theorem, proof}
{state, states, entangled}
{group, space, representation}
{time, systems, information}
{phase, path, phys}
{observables, space, algebra}
{vol, operators, histories}

Characterization of combinatorially independent permutation separability criteria

Pawel Wocjan, Michal Horodecki

abstract: The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of at least one of the resulting operators is greater than one. If it is greater than one then the state is necessarily entangled. A shortcoming of the permutation separability criteria is that many permutations give rise to dependent separability criteria. Therefore, we introduce a necessary condition for two permutations to yield independent criteria called combinatorical independence. This condition basically means that the map corresponding to one permutation cannot be obtained by concatenating the map corresponding to the second permutation with a norm-preserving map. We characterize completely combinatorically independent criteria, and determine simple permutations that represent all independent criteria. The representatives can be visualized by means of a simple graphical notation. They are composed of three basic operations: partial transpose, and two types of so-called reshufflings. In particular, for a four-partite system all criteria except one are composed of partial transpose and only one type of reshuffling; the exceptional one requires the second type of reshuffling. Furthermore, we show how to obtain efficiently for every permutation a simple representative. This method allows to check easily if two permutations are combinatorically equivalent or not.

oai_identifier:
oai:arXiv.org:quant-ph/0503129
categories:
quant-ph
comments:
9 pages, corrected proof of rule 4
arxiv_id:
quant-ph/0503129
journal_ref:
Open Syst. Inf. Dyn. 12, 331 (2005)
created:
2005-03-14
updated:
2005-06-13

Full article ▸

related documents
0408157v1
0505216v2
0609052v3
0502040v2
0104011v2
0603035v1
0611011v1
0302143v1
0611223v2
0505093v1
0611285v1
0610188v1
0603261v2
0509056v2
0510105v2
0409039v3
0703243v2
0701149v3
0602067v3
0610176v1
0612210v3
0507148v1
0601177v1
0604099v1
0607210v5