Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0109089 · Physics Letters A

Separability of rank two quantum states

Sergio A Albeverio, Shao-Ming Fei, Debashish Goswami

Published Jul 1, 2001• 31 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(01)00413-3

Related papers

Separability of rank two quantum states on multiple quantum spaces

Shao-Ming Fei, Xiu-Hong Gao, Xiaohong Wang +2 more

arXiv:quant-ph/0208089•Physics Letters A•Aug 1, 2002•16 citations

Separability of Rank-Two Quantum States in $C^M \otimes C^N$ Composite Quantum Systems

Shao-Ming Fei, Xiu-Hong Gao, Xiaohong Wang +2 more

We consider rank-two density matrices ρ supported on an M × N Hilbert space for arbitrary dimensions M and N . Explicit sufficient and necessary conditions for separability of ρ are presented.

Communications in Theoretical Physics•May 15, 2003•2 citations

SEPARABILITY OF RANK TWO QUANTUM STATES ON MULTIPLE QUANTUM SPACES WITH DIFFERENT DIMENSIONS

Shao-Ming Fei, Xiu-Hong Gao, Xiaohong Wang +2 more

We consider the separability of rank two quantum states on multiple quantum spaces with different dimensions. The sufficient and necessary conditions for separability of these multiparty quantum states are explicitly presented. A nonseparability inequality is also given for the case where one of the eigenvectors corresponding to nonzero eigenvalues of the density matrix is maximally entangled.

arXiv:quant-ph/0305080•International Journal of Quantum Information•Mar 1, 2003•5 citations

SEPARABILITY OF MULTIPARTITE QUANTUM SYSTEMS

Ming Li, Wang Jing

Reports on Mathematical Physics•Feb 1, 2012•0 citations

Optimal ensemble length of mixed separable states

Robert Lockhart

The optimal (pure state) ensemble length of a separable state A is the minimum number of (pure) states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length equal to k or fewer. Lower bounds on k are found below which these sets have measure 0 in the set of separable states. In the bipartite case and the multiparticle case where one of the particles has significantly more quantum numbers than the rest the lower bounds are sharp. A consequence of our results is that for all two-particle systems, except possibly those with one qubit or those with a nine-dimensional Hilbert space, and for all systems with more than two particles the optimal pure state ensemble length for a randomly picked separable state is with probability 1 greater than the state’s rank. In bipartite systems with probabilty 1 it is greater than 1/4 the rank raised to the 3/2 power and in a system of p qubits with probability 1 it is greater than 22p/(1+2p), i.e., almost the square of the rank.

arXiv:quant-ph/9908050•Journal of Mathematical Physics•Oct 1, 2000•18 citations

A simple test for the separability of symmetric quantum states

Domenico D’Alessandro

Reports on Mathematical Physics•Aug 1, 2022•0 citations
Separability of Rank-Two Quantum States in CM⊗CNC^M \otimes C^NCM⊗CN Composite Quantum Systems
The optimal (pure state) ensemble length of a separable state A is the minimum number of (pure) states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length equal to k or fewer. Lower bounds on k are found below which these sets have measure 0 in the set of separable states. In the bipartite case and the multiparticle case where one of the particles has significantly more quantum numbers than the rest the lower bounds are sharp. A consequence of our results is that for all two-particle systems, except possibly those with one qubit or those with a nine-dimensional Hilbert space, and for all systems with more than two particles the optimal pure state ensemble length for a randomly picked separable state is with probability 1 greater than the state’s rank. In bipartite systems with probabilty 1 it is greater than 1/4 the rank raised to the 3/2 power and in a system of p qubits with probability 1 it is greater than 22p/(1+2p), i.e., almost the square of the rank.