Information geometry of operator scaling

04/30/2020
by   Takeru Matsuda, et al.
0

Matrix scaling is a classical problem with a wide range of applications. It is known that the Sinkhorn algorithm for matrix scaling is interpreted as alternating e-projections from the viewpoint of classical information geometry. Recently, a generalization of matrix scaling to completely positive maps called operator scaling has been found to appear in various fields of mathematics and computer science, and the Sinkhorn algorithm has been extended to operator scaling. In this study, the operator Sinkhorn algorithm is studied from the viewpoint of quantum information geometry through the Choi representation of completely positive maps. The operator Sinkhorn algorithm is shown to coincide with alternating e-projections with respect to the symmetric logarithmic derivative metric, which is a Riemannian metric on the space of quantum states relevant to quantum estimation theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2018

Recent progress on scaling algorithms and applications

Scaling problems have a rich and diverse history, and thereby have found...
research
04/05/2019

Spectral analysis of matrix scaling and operator scaling

We present a spectral analysis for matrix scaling and operator scaling. ...
research
11/25/2020

Quantum algorithms for matrix scaling and matrix balancing

Matrix scaling and matrix balancing are two basic linear-algebraic probl...
research
01/01/2018

Operator scaling with specified marginals

The completely positive operators, which can be viewed as a generalizati...
research
04/12/2018

Efficient algorithms for tensor scaling, quantum marginals and moment polytopes

We present a polynomial time algorithm to approximately scale tensors of...
research
04/03/2018

Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing

We propose a new second-order method for geodesically convex optimizatio...
research
09/14/2023

Symplectic and Lagrangian Polar Duality; Applications to Quantum Information Geometry

Polar duality is a well-known concept from convex geometry and analysis....

Please sign up or login with your details

Forgot password? Click here to reset