Related papers: Generalised Pinching Inequality

Generalised Pinching Inequality

URL: http://arxiv.org/abs/2510.19111v1
Date: Tue, 21 Oct 2025 22:17:29 GMT
Title: Generalised Pinching Inequality
Authors: Andreas Winter,
Abstract summary: Hayashi's Pinching Inequality establishes a matrix inequality between a semidefinite matrix and a multiple of its "pinched" version via a projective measurement.<n>Here, we show a very simple proof of it, which lends itself immediately to natural generalisations.<n>We show how the generalised pinching inequality in the case of binary measurements gives rise to a novel gentle measurement lemma.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Hayashi's Pinching Inequality, which establishes a matrix inequality between a semidefinite matrix and a multiple of its "pinched" version via a projective measurement, has found many applications in quantum information theory and beyond. Here, we show a very simple proof of it, which lends itself immediately to natural generalisations where the different projections of the measurement have different weights, and where the matrix inequality can be reversed. As an application we show how the generalised pinching inequality in the case of binary measurements gives rise to a novel gentle measurement lemma, where matrix ordering replaces approximation in trace norm.

Related papers

Violation of steering inequality for generalized equiangular measurements [0.6906005491572401]
We study bipartite quantum steering using a general class of measurement operators known as the generalized equiangular measurement (GEAM)<n>Our approach allows for the construction of steering inequalities that are applicable not only to informationally complete measurements but also to incomplete or lossy scenarios.
arXiv Detail & Related papers (2025-04-11T12:54:00Z)
Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery [8.722715843502321]
We provide for the first time, linear convergence rates independent of the rank of the sought asymmetric matrix in the presence of gross corruptions.<n>By applying our approach to (robust) matrix sensing, we highlight its merits when the measurement operator satisfies a mixed-norm restricted isometry property.
arXiv Detail & Related papers (2024-10-22T08:58:44Z)
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)
A fixed-point algorithm for matrix projections with applications in quantum information [7.988085110283119]
We show that our algorithm converges exponentially fast to the optimal solution in the number of iterations. We discuss several applications of our algorithm in quantum resource theories and quantum Shannon theory.
arXiv Detail & Related papers (2023-12-22T11:16:11Z)
Intrinsic Bayesian Cramér-Rao Bound with an Application to Covariance Matrix Estimation [49.67011673289242]
This paper presents a new performance bound for estimation problems where the parameter to estimate lies in a smooth manifold. It induces a geometry for the parameter manifold, as well as an intrinsic notion of the estimation error measure.
arXiv Detail & Related papers (2023-11-08T15:17:13Z)
Birkhoff-James Orthogonality in the Trace Norm, with Applications to Quantum Resource Theories [0.0]
We develop a simple-to-test criterion that determines which Hermitian matrices are Birkhoff-James orthogonal. We then explore applications of our work in the theory of quantum resources.
arXiv Detail & Related papers (2021-09-12T16:29:59Z)
Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
arXiv Detail & Related papers (2021-05-03T16:36:27Z)
Can Single-Shuffle SGD be Better than Reshuffling SGD and GD? [77.82009268160053]
We conjecture that the means of matrix products corresponding to with- and without-replacement variants of SGD satisfy a series of spectral norm inequalities. We present theorems that support our conjecture by proving several special cases.
arXiv Detail & Related papers (2021-03-12T04:34:45Z)
Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
arXiv Detail & Related papers (2020-02-03T16:17:50Z)
Joint measurability meets Birkhoff-von Neumann's theorem [77.34726150561087]
We prove that joint measurability arises as a mathematical feature of DNTs in this context, needed to establish a characterisation similar to Birkhoff-von Neumann's. We also show that DNTs emerge naturally from a particular instance of a joint measurability problem, remarking its relevance in general operator theory.
arXiv Detail & Related papers (2018-09-19T18:57:45Z)
Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
We develop a relative error bound for nuclear norm regularized matrix completion. We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
arXiv Detail & Related papers (2015-04-26T13:12:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.