Operator scaling with specified marginals

01/01/2018
by   Cole Franks, et al.
0

The completely positive operators, which can be viewed as a generalization of the nonnegative matrices, are maps between spaces of linear operators arising in the study of C*-algebras. The existence of the operator analogues of doubly stochastic scalings of matrices is equivalent to a multitude of problems in computer science and mathematics, such rational identity testing in non-commuting variables, noncommutative rank of symbolic matrices, and a basic problem in invariant theory (Garg, Gurvits, Oliveira and Wigderson, FOCS, 2016). We study operator scaling with specified marginals, which is the operator analogue of scaling matrices to specified row and column sums. We characterize the operators which can be scaled to given marginals, much in the spirit of the Gurvits' algorithmic characterization of the operators that can be scaled to doubly stochastic (Gurvits, Journal of Computer and System Sciences, 2004). Our algorithm produces approximate scalings in time poly(n,m) whenever scalings exist. A central ingredient in our analysis is a reduction from the specified marginals setting to the doubly stochastic setting. Operator scaling with specified marginals arises in diverse areas of study such as the Brascamp-Lieb inequalities, communication complexity, eigenvalues of sums of Hermitian matrices, and quantum information theory. Some of the known theorems in these areas, several of which had no effective proof, are straightforward consequences of our characterization theorem. For instance, we obtain a simple algorithm to find, when they exist, a tuple of Hermitian matrices with given spectra whose sum has a given spectrum. We also prove new theorems such as a generalization of Forster's theorem (Forster, Journal of Computer and System Sciences, 2002) concerning radial isotropic position.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2020

Diagonal scalings for the eigenstructure of arbitrary pencils

In this paper we show how to construct diagonal scalings for arbitrary m...
research
12/28/2019

Scaled Relative Graph of Normal Matrices

The Scaled Relative Graph (SRG) by Ryu, Hannah, and Yin (arXiv:1902.0978...
research
04/30/2020

Information geometry of operator scaling

Matrix scaling is a classical problem with a wide range of applications....
research
08/29/2018

Recent progress on scaling algorithms and applications

Scaling problems have a rich and diverse history, and thereby have found...
research
12/11/2020

Scaling positive random matrices: concentration and asymptotic convergence

It is well known that any positive matrix can be scaled to have prescrib...
research
11/21/2017

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory

Alternating minimization heuristics seek to solve a (difficult) global o...
research
06/12/2015

New Results for Domineering from Combinatorial Game Theory Endgame Databases

We have constructed endgame databases for all single-component positions...

Please sign up or login with your details

Forgot password? Click here to reset