Partially separable criterion and classification of states in multipartite systems with an arbitrary finite number of qubits

2003/05/05 by An Min Wang, Wang, An Min
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0305016

Revised Version, 8 pages, no fig. Improved the expression of our theorem and brought our key conclusion into prominence

openalex publication_date 2003/05/05 · arxiv created 2003/05/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

After introducing the partially separable concept, we proved the equivalence between the partial separability of a given m-partite subsystem with m qubits and the purity of states of this m-partite subsystem for a pure state in multipartite systems with arbitrary finite n(>m) qubits. Furthermore, we give out the operational realizations (corollaries) of our theorem, which are the sufficient and necessary criterions of partial separability of states and can be used to classification of states. Our results are helpful to understand and describe quantum entanglement in multipartite systems.

Related

• Criteria of partial separability of multipartite qubit mixed-states
• Separability criterion for bipartite states and its generalization to multipartite systems
• Separability Criteria For Arbitrary Quantum Systems
• Separability of pure n-qubit states: two characterizations
• Separability criterion for pure states in multipartite and high dimensional systems