相关论文: A Norm Compression Inequality for Block Partitione…
In this paper, we revisit Korn's inequality for the piecewise $H^1$ space based on general polygonal or polyhedral decompositions of the domain. Our Korn's inequality is expressed with minimal jump terms. These minimal jump terms are…
In this work, a refinement of the Cauchy--Schwarz inequality in inner product space is proved. A more general refinement of the Kato's inequality or the so called mixed Schwarz inequality is established. Refinements of some famous numerical…
We obtain new optimal estimates for the $L^2(M)\to L^q(M)$, $q\in (2,q_c]$, $q_c=2(n+1)/(n-1)$, operator norms of spectral projection operators associated with spectral windows $[\lambda,\lambda+\delta(\lambda)]$, with…
Cosine similarity normalizes both sides; dot product normalizes neither. We propose a 2x2 framework that independently controls query-side and document-side normalization, exposing two intermediate variants (QNorm, DNorm) that have not been…
Changes of some unitarily invariant norms and anti-norms under the operation of partial trace are examined. The norms considered form a two-parametric family, including both the Ky Fan and Schatten norms as particular cases. The obtained…
The Schatten-$p$ quasi-norm with $p\in(0,1)$ has recently gained considerable attention in various low-rank matrix estimation problems offering significant benefits over relevant convex heuristics such as the nuclear norm. However, due to…
We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even $n$ and every integer $k\geq 1$, we show that under the constraint $\sum_{i=1}^n a_i^2=1$ the global minimum of the even-degree polynomial…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
We study inequalities connecting the product of uniform norms of polynomials with the norm of their product. This circle of problems include the Gelfond-Mahler inequality for the unit disk and the Kneser-Borwein inequality for the segment…
The celebrated Heinz inequality asserts that $ 2|||A^{1/2}XB^{1/2}|||\leq |||A^{\nu}XB^{1-\nu}+A^{1-\nu}XB^{\nu}|||\leq |||AX+XB|||$ for $X \in \mathbb{B}(\mathscr{H})$, $A,B\in \+$, every unitarily invariant norm $|||\cdot|||$ and $\nu \in…
Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE…
We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…
In this paper, we present some extensions of the Young and Heinz inequalities for the Hilbert-Schmidt norm as well as any unitarily invariant norm. Furthermore, we give some inequalities dealing with matrices. More precisely, for two…
In these notes, we obtain new stability estimates for centered non-degenerate selfdecomposable probability measures on $\mathbb{R}^d$ with finite second moment and for non-degenerate symmetric $\alpha$-stable probability measures on…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…
In this paper, we prove the boundedness of matrix Hausdorff operators and rough Hausdorff operators in the two weighted Herz-type Hardy spaces associated with both power weights and Muckenhoupt weights. By applying the fact that the…
We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal…
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No…
Using recent results concerning the homogenization and the Hardy property of weighted means, we establish sharp Hardy constants for concave and monotone weighted quasideviation means and for a few particular subclasses of this broad family.…
This manuscript describes a technique for computing partial rank-revealing factorizations, such as, e.g, a partial QR factorization or a partial singular value decomposition. The method takes as input a tolerance $\varepsilon$ and an…