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

Factorization through Lorentz cones

Guillaume Aubrun, Francesca La Piana, Alexander Müller-Hermes

math.FAquant-phSubmitted Jun 26, 2026• Announced Jun 29, 2026
arXivHTMLPDF

Abstract

A pair of proper cones $(\mathsf{C}_1,\mathsf{C}_2)$ is said to have the Lorentz factorization property (LFP) if every $(\mathsf{C}_1,\mathsf{C}_2)$-positive map factors through a direct sum of Lorentzian cones, i.e., cones over Euclidean balls. Clearly, $(\mathsf{C}_1,\mathsf{C}_2)$ has the LFP if either $\mathsf{C}_1$ or $\mathsf{C}_2$ is a direct sum of Lorentzian cones, and our main goal is to find other examples. We show that such examples cannot be found for pairs $(\mathsf{C}_1,\mathsf{C}_2)$ where $\mathsf{C}_1=\mathsf{C}_2$, or in the case where both $\mathsf{C}_1$ and $\mathsf{C}_2$ are polyhedral. We also focus on the case where $\mathsf{C}_1=\mathsf{C}_\square$ is the square-based cone in $\mathbf{R}^3$. Here, we show that $(\mathsf{C}_\square,\mathsf{C})$ has the LFP whenever $\mathsf{C}$ is a symmetric cone, i.e., a direct sum of Lorentz cones, cones of positive semidefinite matrices over the real numbers, complex numbers or quaternions, and the cone of $3\times 3$ positive semidefinite matrices over the octonions. We leave open the question whether there are more examples, but we show that this list cannot be extended by any strictly convex cone $\mathsf{C}$ or for a cone $\mathsf{C}$ with $\text{dim}(\mathsf{C})\leq 5$. Finally, we discuss an application to a problem in quantum information theory.

Comments
21 pages. Comments are welcome

Related papers

Annihilating Entanglement Between Cones

Guillaume Aubrun, Alexander Müller‐Hermes

Abstract Every multipartite entangled quantum state becomes fully separable after an entanglement breaking quantum channel acted locally on each of its subsystems. Whether there are other quantum channels with this property has been an open problem with important implications for entanglement theory (e.g., for the distillation problem and the PPT squared conjecture). We cast this problem in the general setting of proper convex cones in finite-dimensional vector spaces. The max-entanglement annihilating maps transform thek-fold maximal tensor product of a cone $${\textsf{C}}_1$$ C1 into thek-fold minimal tensor product of a cone $${\textsf{C}}_2$$ C2 , and the pair $$({\textsf{C}}_1,{\textsf{C}}_2)$$ (C1,C2) is called resilient if all max-entanglement annihilating maps are entanglement breaking. Our main result is that $$({\textsf{C}}_1,{\textsf{C}}_2)$$ (C1,C2) is resilient if either $${\textsf{C}}_1$$ C1 or $${\textsf{C}}_2$$ C2 is a Lorentz cone. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation: As a warm-up, we use the multiplication tensors of real composition algebras to construct a finite family of generalized distillation protocols for Lorentz cones, containing the distillation protocol for entangled qubit states by Bennett et al. (Phys Rev Lett 76(5):722, 1996) as a special case. Then, we construct an infinite family of protocols using solutions to the Hurwitz matrix equations. After proving these results, we focus on maps between cones of positive semidefinite matrices, where we derive necessary conditions for max-entanglement annihilation similar to the reduction criterion in entanglement distillation. Finally, we apply results from the theory of Banach space tensor norms to show that the Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied.

arXiv:2110.11825•Communications in Mathematical Physics•Dec 27, 2022•8 citations

Purifications for Convex Cones

Felix Campidell, Tim Netzer

Motivated by the importance of the purification principle in quantum theory and generalized probabilistic theories, we study purifications using only the geometry of a finite-dimensional proper convex cone. We prove an existence theorem for indecomposable cones and intermediate tensor cones containing the maximally entangled state; in particular, every interior point of an indecomposable homogeneous cone admits a purification. This applies to Lorentz cones, for example. We also give a criterion for uniqueness up to local automorphisms. On the boundary, we show that if every proper face of $C$ is simplicial, then only pure points can admit purifications, and we demonstrate that this conclusion fails in the presence of non-simplicial faces. Examples involving positive semidefinite cones, Lorentz cones, $k$-positive maps, PPT tensors, and polyhedral cones illustrate both existence and non-uniqueness phenomena.

quant-pharXiv:2607.28202•Jul 31, 2026•0 citations

Annihilating and breaking Lorentz cone entanglement

Francesca La Piana, Alexander Müller‐Hermes

Linear maps between finite-dimensional ordered vector spaces with orders induced by proper cones C A and C B are called entanglement breaking if their partial application sends the maximal tensor product K ⊗ max C A into the minimal tensor product K ⊗ min C B for any proper cone K . We study the larger class of Lorentz-entanglement breaking maps where K is restricted to be a Lorentz cone of any dimension, i.e., any cone over a Euclidean ball. This class of maps appeared recently in the study of asymptotic entanglement annihilation and it is dual to the linear maps factoring through Lorentz cones. Our main results establish connections between these classes of maps and operator ideals studied in the theory of Banach spaces. For operators u : X → Y between finite-dimensional normed spaces X and Y we consider so-called central maps which are positive with respect to the cones C A = C X and C B = C Y . We show how to characterize when such a map factors through a Lorentz cone and when it is Lorentz-entanglement breaking by using the Hilbert-space factorization norm γ 2 and its dual ⁎ γ 2 ⁎ . We also study the class of Lorentz-entanglement annihilating maps whose local application sends the Lorentzian tensor product C A ⊗ L C A into the minimal tensor product C B ⊗ min C B . When C A is a cone over a finite-dimensional normed space and C B is a Lorentz cone itself, the central maps of this kind can be characterized by the 2-summing norm π 2 . Finally, we prove interesting connections between these classes of maps for general cones, and we identify examples with particular properties, e.g., cones with an analogue of the 2-summing property.

arXiv:2506.14480•Linear Algebra and its Applications•Mar 12, 2026•0 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

Convex semidefinite tensor optimization and quantum entanglement

Liding Xu, Ye-Chao Liu, Sebastian Pokutta

The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable quantum states. We study the convex optimization problem over the PSD tensor cone. While this convex cone admits a smooth reparameterization through tensor factorizations (analogous to the matrix case), it is not self-dual. Moreover, there are currently no efficient algorithms for projecting onto or testing membership in this cone, and the semidefinite tensor optimization problem, although convex, is NP-hard. To address these challenges, we develop methods for computing lower and upper bounds on the optimal value of the problem. We propose a general-purpose iterative refinement algorithm that combines a lifted alternating direction method of multipliers with a cutting-plane approach. This algorithm exploits PSD tensor factorizations to produce heuristic solutions and refine the solutions using cutting planes. Since the method requires a linear minimization oracle over PSD tensors, we design a spatial branch-and-bound algorithm based on convex relaxations and valid inequalities. Our framework allows us to study the white-noise mixing threshold, which characterizes the entanglement properties of quantum states. Numerical experiments on benchmark instances demonstrate the effectiveness of the proposed methods.

math.OCCross-listedarXiv:2511.05258•Nov 10, 2025•0 citations

Norms and Cones in the Theory of Quantum Entanglement

Nathaniel Johnston

There are various notions of positivity for matrices and linear matrix-valued maps that play important roles in quantum information theory. The cones of positive semidefinite matrices and completely positive linear maps, which represent quantum states and quantum channels respectively, are the most ubiquitous positive cones. There are also many natural cones that can been regarded as "more" or "less" positive than these standard examples. In particular, entanglement theory deals with the cones of separable operators and entanglement witnesses, which satisfy very strong and weak positivity properties respectively. Rather complementary to the various cones that arise in entanglement theory are norms. The trace and operator norms for operators and the diamond and completely bounded norms for superoperators are the typical norms that are seen throughout quantum information theory. In this work our main goal is to develop a family of norms that play a role analogous to the cone of entanglement witnesses. We investigate the basic mathematical properties of these norms, including their relationships with other well-known norms, their isometry groups, and their dual norms. We also make the place of these norms in entanglement theory rigorous by showing that entanglement witnesses arise from minimal operator systems, and analogously our norms arise from minimal operator spaces. Finally, we connect the various cones and norms considered here to several seemingly unrelated problems from other areas. We characterize the problem of whether or not non-positive partial transpose bound entangled states exist in terms of one of our norms, and provide evidence in favour of their existence. We also characterize the minimum gate fidelity of a quantum channel, the maximum output purity and its completely bounded counterpart, and the geometric measure of entanglement in terms of these norms.

arXiv:1207.1479•Jul 5, 2012•11 citations
A pair of proper cones (C1,C2)(\mathsf{C}_1,\mathsf{C}_2)(C1​,C2​) is said to have the Lorentz factorization property (LFP) if every (C1,C2)(\mathsf{C}_1,\mathsf{C}_2)(C1​,C2​)-positive map factors through a direct sum of Lorentzian cones, i.e., cones over Euclidean balls. Clearly, (C1,C2)(\mathsf{C}_1,\mathsf{C}_2)(C1​,C2​) has the LFP if either C1\mathsf{C}_1C1​ or C2\mathsf{C}_2C2​ is a direct sum of Lorentzian cones, and our main goal is to find other examples. We show that such examples cannot be found for pairs (C1,C2)(\mathsf{C}_1,\mathsf{C}_2)(C1​,C2​) where C1=C2\mathsf{C}_1=\mathsf{C}_2C1​=C2​, or in the case where both C1\mathsf{C}_1C1​ and C2\mathsf{C}_2C2​ are polyhedral. We also focus on the case where C1=C□\mathsf{C}_1=\mathsf{C}_\squareC1​=C□​ is the square-based cone in R3\mathbf{R}^3R3. Here, we show that (C□,C)(\mathsf{C}_\square,\mathsf{C})(C□​,C) has the LFP whenever C\mathsf{C}C is a symmetric cone, i.e., a direct sum of Lorentz cones, cones of positive semidefinite matrices over the real numbers, complex numbers or quaternions, and the cone of 3×33\times 33×3 positive semidefinite matrices over the octonions. We leave open the question whether there are more examples, but we show that this list cannot be extended by any strictly convex cone C\mathsf{C}C or for a cone C\mathsf{C}C with dim(C)≤5\text{dim}(\mathsf{C})\leq 5dim(C)≤5. Finally, we discuss an application to a problem in quantum information theory.
Abstract Every multipartite entangled quantum state becomes fully separable after an entanglement breaking quantum channel acted locally on each of its subsystems. Whether there are other quantum channels with this property has been an open problem with important implications for entanglement theory (e.g., for the distillation problem and the PPT squared conjecture). We cast this problem in the general setting of proper convex cones in finite-dimensional vector spaces. The max-entanglement annihilating maps transform thek-fold maximal tensor product of a cone C1{\textsf{C}}_1C1​ C1 into thek-fold minimal tensor product of a cone C2{\textsf{C}}_2C2​ C2 , and the pair (C1,C2)({\textsf{C}}_1,{\textsf{C}}_2)(C1​,C2​) (C1,C2) is called resilient if all max-entanglement annihilating maps are entanglement breaking. Our main result is that (C1,C2)({\textsf{C}}_1,{\textsf{C}}_2)(C1​,C2​) (C1,C2) is resilient if either C1{\textsf{C}}_1C1​ C1 or C2{\textsf{C}}_2C2​ C2 is a Lorentz cone. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation: As a warm-up, we use the multiplication tensors of real composition algebras to construct a finite family of generalized distillation protocols for Lorentz cones, containing the distillation protocol for entangled qubit states by Bennett et al. (Phys Rev Lett 76(5):722, 1996) as a special case. Then, we construct an infinite family of protocols using solutions to the Hurwitz matrix equations. After proving these results, we focus on maps between cones of positive semidefinite matrices, where we derive necessary conditions for max-entanglement annihilation similar to the reduction criterion in entanglement distillation. Finally, we apply results from the theory of Banach space tensor norms to show that the Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied.
Motivated by the importance of the purification principle in quantum theory and generalized probabilistic theories, we study purifications using only the geometry of a finite-dimensional proper convex cone. We prove an existence theorem for indecomposable cones and intermediate tensor cones containing the maximally entangled state; in particular, every interior point of an indecomposable homogeneous cone admits a purification. This applies to Lorentz cones, for example. We also give a criterion for uniqueness up to local automorphisms. On the boundary, we show that if every proper face of CCC is simplicial, then only pure points can admit purifications, and we demonstrate that this conclusion fails in the presence of non-simplicial faces. Examples involving positive semidefinite cones, Lorentz cones, kkk-positive maps, PPT tensors, and polyhedral cones illustrate both existence and non-uniqueness phenomena.
Linear maps between finite-dimensional ordered vector spaces with orders induced by proper cones C A and C B are called entanglement breaking if their partial application sends the maximal tensor product K ⊗ max C A into the minimal tensor product K ⊗ min C B for any proper cone K . We study the larger class of Lorentz-entanglement breaking maps where K is restricted to be a Lorentz cone of any dimension, i.e., any cone over a Euclidean ball. This class of maps appeared recently in the study of asymptotic entanglement annihilation and it is dual to the linear maps factoring through Lorentz cones. Our main results establish connections between these classes of maps and operator ideals studied in the theory of Banach spaces. For operators u : X → Y between finite-dimensional normed spaces X and Y we consider so-called central maps which are positive with respect to the cones C A = C X and C B = C Y . We show how to characterize when such a map factors through a Lorentz cone and when it is Lorentz-entanglement breaking by using the Hilbert-space factorization norm γ 2 and its dual ⁎ γ 2 ⁎ . We also study the class of Lorentz-entanglement annihilating maps whose local application sends the Lorentzian tensor product C A ⊗ L C A into the minimal tensor product C B ⊗ min C B . When C A is a cone over a finite-dimensional normed space and C B is a Lorentz cone itself, the central maps of this kind can be characterized by the 2-summing norm π 2 . Finally, we prove interesting connections between these classes of maps for general cones, and we identify examples with particular properties, e.g., cones with an analogue of the 2-summing property.
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.
The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable quantum states. We study the convex optimization problem over the PSD tensor cone. While this convex cone admits a smooth reparameterization through tensor factorizations (analogous to the matrix case), it is not self-dual. Moreover, there are currently no efficient algorithms for projecting onto or testing membership in this cone, and the semidefinite tensor optimization problem, although convex, is NP-hard. To address these challenges, we develop methods for computing lower and upper bounds on the optimal value of the problem. We propose a general-purpose iterative refinement algorithm that combines a lifted alternating direction method of multipliers with a cutting-plane approach. This algorithm exploits PSD tensor factorizations to produce heuristic solutions and refine the solutions using cutting planes. Since the method requires a linear minimization oracle over PSD tensors, we design a spatial branch-and-bound algorithm based on convex relaxations and valid inequalities. Our framework allows us to study the white-noise mixing threshold, which characterizes the entanglement properties of quantum states. Numerical experiments on benchmark instances demonstrate the effectiveness of the proposed methods.
There are various notions of positivity for matrices and linear matrix-valued maps that play important roles in quantum information theory. The cones of positive semidefinite matrices and completely positive linear maps, which represent quantum states and quantum channels respectively, are the most ubiquitous positive cones. There are also many natural cones that can been regarded as "more" or "less" positive than these standard examples. In particular, entanglement theory deals with the cones of separable operators and entanglement witnesses, which satisfy very strong and weak positivity properties respectively. Rather complementary to the various cones that arise in entanglement theory are norms. The trace and operator norms for operators and the diamond and completely bounded norms for superoperators are the typical norms that are seen throughout quantum information theory. In this work our main goal is to develop a family of norms that play a role analogous to the cone of entanglement witnesses. We investigate the basic mathematical properties of these norms, including their relationships with other well-known norms, their isometry groups, and their dual norms. We also make the place of these norms in entanglement theory rigorous by showing that entanglement witnesses arise from minimal operator systems, and analogously our norms arise from minimal operator spaces. Finally, we connect the various cones and norms considered here to several seemingly unrelated problems from other areas. We characterize the problem of whether or not non-positive partial transpose bound entangled states exist in terms of one of our norms, and provide evidence in favour of their existence. We also characterize the minimum gate fidelity of a quantum channel, the maximum output purity and its completely bounded counterpart, and the geometric measure of entanglement in terms of these norms.