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:1512.03293

Two proofs of Størmer's theorem

Guillaume Aubrun, Stanisław J. Szarek

Published Dec 10, 2015• 42 citations
arXivHTMLPDF

Abstract

The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by Størmer and Woronowicz from 1960s and 1970s settling the low dimensional cases. By duality, these results are equivalent to the Peres-Horodecki positive partial transpose criterion being able to unambiguously establish whether a state in a 2 x 2 or 2 x 3 quantum system is entangled or separable. However, even in these low dimensional cases, the existing arguments (known to the authors) were based on long and seemingly ad hoc computations. We present a simple proof, based on Brouwer's fixed point theorem, for the 2 x 2 case (Størmer's theorem). For completeness, we also include another argument (following the classical outline, but highly streamlined) based on a characterization of extreme self-maps of the Lorentz cone and on a link - noticed by R. Hildebrand - to the S-lemma, a well-known fact from control theory and quadratic/semi-definite programming.

DOI
10.48550/arxiv.1512.03293

Related papers

On a characterization of positive maps

W. A. Majewski, Marcin Marciniak

Drawing on results of Choi, Størmer and Woronowicz, we present a nearly complete characterization of certain important classes of positive maps. In particular, we construct a general class of positive linear maps acting between two matrix algebras ℬ( ) and ℬ( ), where and are finite-dimensional Hilbert spaces. It turns out that elements of this class are characterized by operators from the dual cone of the set of all separable states on ℬ( ⊗ ). Subsequently, the relation between entanglements and positive maps is described. Finally, a new characterization of the cone ℬ( ) + ⊗ℬ( ) + is given.

Journal of Physics A Mathematical and General•Jul 16, 2001•54 citations

Topology of the cone of positive maps on qubit systems

Marek Miller, Robert Olkiewicz

An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra has been presented. The premise of the proof is the identification of positive maps with operators preserving the Lorentz cone in four dimensions, and it allows to decompose the positive maps with respect to those preserving the boundary of the cone. In addition, useful conditions implying complete positivity of a map of have been given, together with a sufficient condition for complete positivity of an extremal Schwarz map of . Lastly, following the same geometrical approach, a description in topological terms of maps that are simultaneously completely positive and completely copositive has been presented.

arXiv:1503.04283•Journal of Physics A Mathematical and Theoretical•Jun 2, 2015•3 citations

Non-Subhomogeneity of Minimal Operator Systems over Positive Semidefinite and Lorentz Cones

Tim Netzer

The minimal operator systems over ${\rm Mat}_k(\mathbb C)_+$, $k\geqslant2$, and the Lorentz cones $\mathcal L_m$, $m\geqslant4$, are not subhomogeneous. For the $2\times2$ cone we construct extreme positive maps of arbitrarily large output dimension. Positive retracts give the remaining cases. Equivalently, for fixed $k\geqslant2$ and $d$, there exist $s>d$ and an entangled positive operator on $\mathbb C^k\otimes\mathbb C^s$ such that every compression of the second factor to $\mathbb C^d$ is separable.

math.OACross-listedarXiv:2608.24648•Aug 26, 2026•0 citations

Toeplitz separability, entanglement, and complete positivity using operator system duality

Douglas Farenick, Michelle McBurney

A new proof is presented of a theorem of L. Gurvits [LANL Unclassified Technical Report (2001), LAUR–01–2030], which states that the cone of positive block-Toeplitz matrices with matrix entries has no entangled elements. The proof of the Gurvits separation theorem is achieved by making use of the structure of the operator system dual of the operator system C ( S 1 ) ( n ) C(S^1)^{(n)} of n × n n\times n Toeplitz matrices over the complex field, and by determining precisely the structure of the generators of the extremal rays of the positive cones of the operator systems C ( S 1 ) ( n ) ⊗ min B ( H ) C(S^1)^{(n)}\otimes _{\text {min}}\mathcal {B}(\mathcal {H}) and C ( S 1 ) ( n ) ⊗ min B ( H ) C(S^1)_{(n)}\otimes _{\text {min}}\mathcal {B}(\mathcal {H}) , where H \mathcal {H} is an arbitrary Hilbert space and C ( S 1 ) ( n ) C(S^1)_{(n)} is the operator system dual of C

arXiv:2208.03236•Proceedings of the American Mathematical Society Series B•Apr 10, 2023•3 citations

Entangled States with Positive Partial Transpose in Any-Dimensional Quantum System

Yu-Chun Wu, Ping‐Xing Chen, Zheng-Wei Zhou +1 more

It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.

Chinese Physics Letters•Feb 24, 2005•2 citations

Dvoretzky's theorem and the complexity of entanglement detection

Stanisław J. Szarek, Guillaume Aubrun

Dvoretzky's theorem and the complexity of entanglement detection, Discrete Analysis 2017:1, 20 pp. Let $H$ be a Hilbert space. A _state_ on $H$ is a linear operator $\rho:H\to H$ such that tr$(\rho)=1$ and tr$(\rho P)\geq 0$ for every orthogonal projection $P$. A linear operator satisfying just the second condition is called _positive_. If $H=H_1\otimes H_2$ then an important piece of information about $\rho$ is the extent to which it can be split up into a part that acts on $H_1$ and a part that acts on $H_2$. An appropriate formal definition is the following: we say that $\rho$ is _separable_ if it can be approximated in the trace-class norm by operators of the form $\sum_ic_i\rho^1_i\otimes\rho^2_i$, where each $\rho^1_i$ is a state on $H_1$, each $\rho^2_i$ is a state on $H_2$, and the $c_i$ are positive constants. An operator that is not separable is called _entangled_. Owing to the importance of entanglement, it is useful to have a criterion that detects it. A simple necessary condition is that if $\Phi$ is a linear map from operators to operators that takes positive operators to positive operators, and if $\rho$ is separable, then $(\Phi\otimes I)\rho$ is a positive operator: that is simply because $(\Phi\otimes I)(\sum_ic_i\rho^1_i\otimes\rho^2_i)=\sum_ic_i\Phi\rho^1_i\otimes\rho^2_i$ and each $\Phi\rho^1_i$ is positive. Interestingly, however, the converse is true: if $\rho$ is entangled, then there exists a positive $\Phi$ such that $(\Phi\otimes I)(\rho)$ is _not_ positive. This equivalence is called the _Horodecki criterion_ for entanglement. The Horodecki criterion gives us a witness $\Phi$ for each entangled state $\rho$. The starting question for this paper is how many different witnesses one needs to detect all entangled states (as a function of the dimensions of $H_1$ and $H_2$). More precisely, since this number is known to be infinite, the paper considers the stronger notion of _robustly_ entangled states, which are states that remain entangled even when you average them with a suitable multiple of the identity. The main result of the paper is that the number needed is large: the authors obtain a bound of $\exp(cd^3/\log d)$. A key observation that enables them to prove this is that there is a resemblance between the problem they are considering and a result from a famous paper of Figiel, Lindenstrauss and Milman concerning Dvoretzky's theorem [1]. It follows from the analysis in the FLM paper that the product of the logarithm of the number of faces of a symmetric convex body with the logarithm of the number of vertices has to be at least $cn$, so it is not possible for a symmetric convex body to have few faces and few vertices (in strong contrast with a general convex body, since an $n$-dimensional simplex has $n+1$ of each). Something like that occurs here. Roughly speaking, the set of separable states can be regarded as having "few" extreme points, and therefore "many" faces. A single witness $\Phi$ cannot help with too many faces, so the number of witnesses needed must be large. These interesting ideas are new to the field of quantum information. [1] T. Figiel, J. Lindenstrauss and V. D. Milman, _The dimension of almost spherical sections of convex bodies,_ Acta Math. 139 (1-2) (1977), pp. 53-94.

arXiv:1510.00578•Discrete Analysis•Jan 1, 2017•9 citations
The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by Størmer and Woronowicz from 1960s and 1970s settling the low dimensional cases. By duality, these results are equivalent to the Peres-Horodecki positive partial transpose criterion being able to unambiguously establish whether a state in a 2 x 2 or 2 x 3 quantum system is entangled or separable. However, even in these low dimensional cases, the existing arguments (known to the authors) were based on long and seemingly ad hoc computations. We present a simple proof, based on Brouwer's fixed point theorem, for the 2 x 2 case (Størmer's theorem). For completeness, we also include another argument (following the classical outline, but highly streamlined) based on a characterization of extreme self-maps of the Lorentz cone and on a link - noticed by R. Hildebrand - to the S-lemma, a well-known fact from control theory and quadratic/semi-definite programming.
Drawing on results of Choi, Størmer and Woronowicz, we present a nearly complete characterization of certain important classes of positive maps. In particular, we construct a general class of positive linear maps acting between two matrix algebras ℬ( ) and ℬ( ), where and are finite-dimensional Hilbert spaces. It turns out that elements of this class are characterized by operators from the dual cone of the set of all separable states on ℬ( ⊗ ). Subsequently, the relation between entanglements and positive maps is described. Finally, a new characterization of the cone ℬ( ) + ⊗ℬ( ) + is given.
An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra has been presented. The premise of the proof is the identification of positive maps with operators preserving the Lorentz cone in four dimensions, and it allows to decompose the positive maps with respect to those preserving the boundary of the cone. In addition, useful conditions implying complete positivity of a map of have been given, together with a sufficient condition for complete positivity of an extremal Schwarz map of . Lastly, following the same geometrical approach, a description in topological terms of maps that are simultaneously completely positive and completely copositive has been presented.
The minimal operator systems over Matk(C)+{\rm Mat}_k(\mathbb C)_+Matk​(C)+​, k⩾2k\geqslant2k⩾2, and the Lorentz cones Lm\mathcal L_mLm​, m⩾4m\geqslant4m⩾4, are not subhomogeneous. For the 2×22\times22×2 cone we construct extreme positive maps of arbitrarily large output dimension. Positive retracts give the remaining cases. Equivalently, for fixed k⩾2k\geqslant2k⩾2 and ddd, there exist s>ds>ds>d and an entangled positive operator on Ck⊗Cs\mathbb C^k\otimes\mathbb C^sCk⊗Cs such that every compression of the second factor to Cd\mathbb C^dCd is separable.
A new proof is presented of a theorem of L. Gurvits [LANL Unclassified Technical Report (2001), LAUR–01–2030], which states that the cone of positive block-Toeplitz matrices with matrix entries has no entangled elements. The proof of the Gurvits separation theorem is achieved by making use of the structure of the operator system dual of the operator system C ( S 1 ) ( n ) C(S^1)^{(n)} of n × n n\times n Toeplitz matrices over the complex field, and by determining precisely the structure of the generators of the extremal rays of the positive cones of the operator systems C ( S 1 ) ( n ) ⊗ min B ( H ) C(S^1)^{(n)}\otimes _{\text {min}}\mathcal {B}(\mathcal {H}) and C ( S 1 ) ( n ) ⊗ min B ( H ) C(S^1)_{(n)}\otimes _{\text {min}}\mathcal {B}(\mathcal {H}) , where H \mathcal {H} is an arbitrary Hilbert space and C ( S 1 ) ( n ) C(S^1)_{(n)} is the operator system dual of C
It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.
Dvoretzky's theorem and the complexity of entanglement detection, Discrete Analysis 2017:1, 20 pp. Let HHH be a Hilbert space. A _state_ on HHH is a linear operator ρ:H→H\rho:H\to Hρ:H→H such that tr(ρ)=1(\rho)=1(ρ)=1 and tr(ρP)≥0(\rho P)\geq 0(ρP)≥0 for every orthogonal projection PPP. A linear operator satisfying just the second condition is called _positive_. If H=H1⊗H2H=H_1\otimes H_2H=H1​⊗H2​ then an important piece of information about ρ\rhoρ is the extent to which it can be split up into a part that acts on H1H_1H1​ and a part that acts on H2H_2H2​. An appropriate formal definition is the following: we say that ρ\rhoρ is _separable_ if it can be approximated in the trace-class norm by operators of the form ∑iciρi1⊗ρi2\sum_ic_i\rho^1_i\otimes\rho^2_i∑i​ci​ρi1​⊗ρi2​, where each ρi1\rho^1_iρi1​ is a state on H1H_1H1​, each ρi2\rho^2_iρi2​ is a state on H2H_2H2​, and the cic_ici​ are positive constants. An operator that is not separable is called _entangled_. Owing to the importance of entanglement, it is useful to have a criterion that detects it. A simple necessary condition is that if Φ\PhiΦ is a linear map from operators to operators that takes positive operators to positive operators, and if ρ\rhoρ is separable, then (Φ⊗I)ρ(\Phi\otimes I)\rho(Φ⊗I)ρ is a positive operator: that is simply because (Φ⊗I)(∑iciρi1⊗ρi2)=∑iciΦρi1⊗ρi2(\Phi\otimes I)(\sum_ic_i\rho^1_i\otimes\rho^2_i)=\sum_ic_i\Phi\rho^1_i\otimes\rho^2_i(Φ⊗I)(∑i​ci​ρi1​⊗ρi2​)=∑i​ci​Φρi1​⊗ρi2​ and each Φρi1\Phi\rho^1_iΦρi1​ is positive. Interestingly, however, the converse is true: if ρ\rhoρ is entangled, then there exists a positive Φ\PhiΦ such that (Φ⊗I)(ρ)(\Phi\otimes I)(\rho)(Φ⊗I)(ρ) is _not_ positive. This equivalence is called the _Horodecki criterion_ for entanglement. The Horodecki criterion gives us a witness Φ\PhiΦ for each entangled state ρ\rhoρ. The starting question for this paper is how many different witnesses one needs to detect all entangled states (as a function of the dimensions of H1H_1H1​ and H2H_2H2​). More precisely, since this number is known to be infinite, the paper considers the stronger notion of _robustly_ entangled states, which are states that remain entangled even when you average them with a suitable multiple of the identity. The main result of the paper is that the number needed is large: the authors obtain a bound of exp⁡(cd3/log⁡d)\exp(cd^3/\log d)exp(cd3/logd). A key observation that enables them to prove this is that there is a resemblance between the problem they are considering and a result from a famous paper of Figiel, Lindenstrauss and Milman concerning Dvoretzky's theorem [1]. It follows from the analysis in the FLM paper that the product of the logarithm of the number of faces of a symmetric convex body with the logarithm of the number of vertices has to be at least cncncn, so it is not possible for a symmetric convex body to have few faces and few vertices (in strong contrast with a general convex body, since an nnn-dimensional simplex has n+1n+1n+1 of each). Something like that occurs here. Roughly speaking, the set of separable states can be regarded as having "few" extreme points, and therefore "many" faces. A single witness Φ\PhiΦ cannot help with too many faces, so the number of witnesses needed must be large. These interesting ideas are new to the field of quantum information. [1] T. Figiel, J. Lindenstrauss and V. D. Milman, _The dimension of almost spherical sections of convex bodies,_ Acta Math. 139 (1-2) (1977), pp. 53-94.