Related papers: On a matrix inequality related to the distillabili…
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…
Dataset Distillation aims to compress a large dataset into a small synthetic one while maintaining predictive performance. We show that as different demographic groups exhibit distinct predictive patterns, the distillation process struggles…
The partial transpose map is a linear map widely used quantum information theory. We study the equality condition for a matrix inequality generated by partial transpose, namely $\rank(\sum^K_{j=1} A_j^T \otimes B_j)\le K \cdot…
We consider optimization problems involving the multiplication of variable matrices to be selected from a given family, which might be a discrete set, a continuous set or a combination of both. Such nonlinear, and possibly discrete,…
Newton's inequalities $c_n^2 \ge c_{n-1}c_{n+1}$ are shown to hold for the normalized coefficients $c_n$ of the characteristic polynomial of any $M$- or inverse $M$-matrix. They are derived by establishing first an auxiliary set of…
In this paper we shall study noncommutative central moment inequalities with a main focus on whether the commutative bounds are tight in the noncommutative case, or not. We prove that the answer is affirmative for the fourth central moment…
Let $A$ be a positive semidefinite matrix, block partitioned as $$ A=\twomat{B}{C}{C^*}{D}, $$ where $B$ and $D$ are square blocks. We prove the following inequalities for the Schatten $q$-norm $||.||_q$, which are sharp when the blocks are…
We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…
For many classically chaotic systems it is believed that the quantum wave functions become uniformly distributed, that is the matrix elements of smooth observables tend to the phase space average of the observable. In this paper we study…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
Based on the generators of $SU(n)$ we present inequalities for detecting quantum entanglement for $2 \otimes d$ and $M \otimes N$ systems. These inequalities provide a sufficient condition of entanglement for bipartite mixed states and give…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
We study the decidability of three well-known problems related to integer matrix multiplication: Mortality (M), Zero in the Left-Upper Corner (Z), and Zero in the Right-Upper Corner (R). Let d and k be positive integers. Define M(k, d x d)…
An ordinary differential operator of the fourth order with coefficients converging at infinity sufficiently rapidly to constant limits is considered. Scattering theory for this operator is developed in terms of special solutions of the…
Quantum learning (in metrology and machine learning) involves estimating unknown parameters from measurements of quantum states. The quantum Fisher information matrix can bound the average amount of information learnt about the unknown…
We review the status of Bell's inequalities in quantum information, stressing mainly the links with quantum key distribution and distillation of entanglement. We also prove that for all the eavesdropping attacks using one qubit, and for a…
A necessary and sufficient condition for 1-distillability is formulated in terms of decomposable positive maps. As an application we provide insight into why all states violating the reduction criterion map are distillable and demonstrate…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…