Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Further Results on the Cross Norm Criterion for Separability
Quantum Information Processing
Characterization of Combinatorially Independent Permutation Separability Criteria
Open Systems & Information Dynamics
Separability of Mixed Quantum States: Linear Contractions and Permutation Criteria
Open Systems & Information Dynamics
A matrix realignment method for recognizing entanglement
Quantum Information & Computation
Quantum Information & Computation
Hi-index | 0.00 |
Recently, P. Wocjan and M. Horodecki [Open Syst. Inf. Dyn. 12, 331 (2005)] gave a characterizationof combinatorially independent permutation separability criteria. Combinatorialindependence is a necessary condition for permutations to yield truly independentcriteria meaning that no criterion is strictly stronger that any other. In this paper weobserve that some of these criteria are still dependent and analyze why these dependenciesoccur. To remove them we introduce an improved necessary condition and give acomplete classification of the remaining permutations. We conjecture that the remainingclass of criteria only contains truly independent permutation separability criteria. Ourconjecture is based on the proof that for two, three and four parties all these criteria aretruly independent and on numerical verification of their independence for up to 8 parties.It was commonly believed that for three parties there were 9 independent criteria, herewe prove that there are exactly 6 independent criteria for three parties and 22 for fourparties.