Partial trace relations beyond normal matrices
- URL: http://arxiv.org/abs/2507.18278v1
- Date: Thu, 24 Jul 2025 10:27:20 GMT
- Title: Partial trace relations beyond normal matrices
- Authors: Pablo Costa Rico, Michael M. Wolf,
- Abstract summary: We find that every pair of matrices of equal size and trace admits dilations of any rank larger than one.<n>We extend the interval of Werner states in which they are provably 2-undistillable in any dimension.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We investigate the relationship between partial traces and their dilations for general complex matrices, focusing on two main aspects: the existence of (joint) dilations and norm inequalities relating partial traces and their dilations. Throughout our analysis, we pay particular attention to rank constraints. We find that every pair of matrices of equal size and trace admits dilations of any rank larger than one. We generalize Audenaert's subadditivity inequality to encompass general matrices, multiple tensor factors, and different norms. A central ingredient for this is a novel majorization relation for Kronecker sums. As an application, we extend the interval of Werner states in which they are provably 2-undistillable in any dimension $d\geq4$. We also prove new Schmidt-number witnesses and $k$-positive maps.
Related papers
- On subdifferential chain rule of matrix factorization and beyond [20.82938951566065]
We show equality-type Clarke subdifferential chain rules of matrix factorization and factorization machine.
Some tensor generalizations and neural extensions are also discussed, albeit they remain mostly open.
arXiv Detail & Related papers (2024-10-07T13:24:59Z) - Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.<n>This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
arXiv Detail & Related papers (2024-07-15T07:11:44Z) - Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition.
A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues.
We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
arXiv Detail & Related papers (2024-05-23T12:26:25Z) - Log-majorization and matrix norm inequalities with application to quantum information [2.7195102129095003]
We show an extension of Araki's log-majorization and apply it to the $alpha$-$z$-R'enyi divergence in quantum information.
The paper includes an appendix to correct the proof of the author's old result on the equality case in the norm inequality for the weighted geometric mean.
arXiv Detail & Related papers (2024-02-25T11:33:46Z) - The polygon relation and subadditivity of entropic measures for discrete and continuous multipartite entanglement [0.6759148939470331]
We study the relationship between the polygon relation and the subadditivity of entropy.
Our work provides a better understanding of the rich structure of multipartite states.
arXiv Detail & Related papers (2024-01-04T05:09:37Z) - The Schmidt rank for the commuting operator framework [58.720142291102135]
The Schmidt rank is a measure for the entanglement dimension of a pure bipartite state.
We generalize the Schmidt rank to the commuting operator framework.
We analyze bipartite states and compute the Schmidt rank in several examples.
arXiv Detail & Related papers (2023-07-21T14:37:33Z) - The Inductive Bias of Flatness Regularization for Deep Matrix
Factorization [58.851514333119255]
This work takes the first step toward understanding the inductive bias of the minimum trace of the Hessian solutions in deep linear networks.
We show that for all depth greater than one, with the standard Isometry Property (RIP) on the measurements, minimizing the trace of Hessian is approximately equivalent to minimizing the Schatten 1-norm of the corresponding end-to-end matrix parameters.
arXiv Detail & Related papers (2023-06-22T23:14:57Z) - Maximally Entangled Two-Qutrit Quantum Information States and De Gua's
Theorem for Tetrahedron [0.0]
We study relations between separable and entangled two-qubit and two-qutrit quantum information states.
For maximally entangled two-retrit state, this relation is just De Gua's theorem or a three-dimensional analog of the Pythagorean theorem for triorthogonal tetrahedron areas.
arXiv Detail & Related papers (2022-07-08T07:19:21Z) - Annihilating Entanglement Between Cones [77.34726150561087]
We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied.
Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
arXiv Detail & Related papers (2021-10-22T15:02:39Z) - Dimension-free entanglement detection in multipartite Werner states [1.5771347525430772]
Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group.
This paper gives a complete characterization of their entanglement that is independent of the underlying local space.
For every entangled Werner state there exists a dimension-free entanglement witness.
arXiv Detail & Related papers (2021-08-19T14:41:09Z) - Leveraged Matrix Completion with Noise [84.20092979053119]
We show that we can provably recover an unknown $ntimes n$ matrix of rank $r$ from just about $mathcalO(nrlog2 (n))$ entries.
Our proofs are supported by a novel approach that phrases sufficient optimality conditions based on the Golfing Scheme.
arXiv Detail & Related papers (2020-11-11T16:25:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.