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/0103038 · Linear Algebra and its Applications

Convexity and the separability problem of quantum mechanical density matrices

A. O. Pittenger, Morton H. Rubin

Published May 1, 2002• 47 citations
arXivHTMLPDF
DOI
10.1016/s0024-3795(01)00524-9

Related papers

Investigating a class of 2⊗2⊗d bound entangled density matrices via linear and nonlinear entanglement witnesses constructed by exact convex optimization

M. A. Jafarizadeh, Y. Akbari, Korosh Aghayar +2 more

Here we consider a class of $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}d$ density matrices which have positive partial transposes with respect to all subsystems. The entanglement witness approach is used to investigate the entanglement of these density matrices. To demonstrate the approach, the three-qubit case is considered in detail. For constructing entanglement witnesses (EWs) detecting these density matrices, we attempt to convert the problem to an exact convex optimization problem. To this aim, we map the convex set of separable states into a convex region, named feasible region, and consider the cases in which the exact geometrical shape of the feasible region can be obtained. In this way, various linear and nonlinear EWs are constructed. The optimality and decomposability of some of the introduced EWs are also considered. Furthermore, the detection of the density matrices by the introduced EWs are discussed analytically and numerically.

arXiv:0801.4953•Physical Review A•Sep 11, 2008•12 citations

Separability of Quantum Systems: A Density Matrix Approach

Roy Mcweeny

Advances in quantum chemistry•Jan 1, 1998•16 citations

Separability criteria and lower bounds of entanglement via realignment

Yuhang Xie, Yanjun Chu, Shao-Ming Fei

The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.

quant-pharXiv:2610.15664•Oct 13, 2026•0 citations

DENSITY MATRICES IN QUANTUM MECHANICS

WORLD SCIENTIFIC eBooks•Jul 1, 1995•1 citation

Generalized convexity property for the energy of a quantum-mechanical system

T. K. Rebane

Theoretical and Mathematical Physics•Sep 1, 1983•10 citations

Maps on Quantum States in -algebras Preserving von Neumann Entropy or Schatten -norm of Convex Combinations

Marcell Gaál

Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten $p$ -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a $C^{\ast }$ -algebra.

Canadian Mathematical Bulletin•Mar 22, 2018•3 citations
Here we consider a class of $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}d$ density matrices which have positive partial transposes with respect to all subsystems. The entanglement witness approach is used to investigate the entanglement of these density matrices. To demonstrate the approach, the three-qubit case is considered in detail. For constructing entanglement witnesses (EWs) detecting these density matrices, we attempt to convert the problem to an exact convex optimization problem. To this aim, we map the convex set of separable states into a convex region, named feasible region, and consider the cases in which the exact geometrical shape of the feasible region can be obtained. In this way, various linear and nonlinear EWs are constructed. The optimality and decomposability of some of the introduced EWs are also considered. Furthermore, the detection of the density matrices by the introduced EWs are discussed analytically and numerically.
The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.
Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten ppp -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a C∗C^{\ast }C∗ -algebra.