vix.ing · top · new · best · stats

Separability Criterion for Density Matrices

1996/04/30 by Asher Peres · 5,274 citations
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Density matrix #Eigenvalues and eigenvectors #Materials science #Mathematical analysis #Mathematical physics #Mathematics #Matrix (chemical analysis) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Separable space #quant-ph

paper · pdf · doi:10.1103/physrevlett.77.1413

published in Physical Review Letters 77(8), 1413-1415 (American Physical Society) · 6 pages LaTeX, contains a simplified derivation and two new examples

arxiv created 1996/06/17 · openalex publication_date 1996/08/19 · arxiv updated 2011/05/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Abstract

A quantum system consisting of two subsystems is separable if its density matrix can be written as \ensuremathρ\phantom\rule0ex0ex=\phantom\rule0ex0ex\ensuremathΣAwA\ensuremathρA^\ensuremath'\ensuremath\bigotimes\ensuremathρA^\ensuremath'\ensuremath', where \ensuremathρA^\ensuremath' and \ensuremathρA^\ensuremath'\ensuremath' are density matrices for the two subsystems, and the positive weights wA satisfy \ensuremathΣwA\phantom\rule0ex0ex=\phantom\rule0ex0ex1. In this Letter, it is proved that a necessary condition for separability is that a matrix, obtained by partial transposition of \ensuremathρ, has only non-negative eigenvalues. Some examples show that this criterion is more sensitive than Bell's inequality for detecting quantum inseparability.

Cited by

Related