Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum optimal transport is cheaper
166
0
0.0
(
0
)
Added by
HAL CCSD
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Authors
Franc{c}ois Golse
Ask ChatGPT about the research
No Arabic abstract
We compare bipartite (Euclidean) matching problems in classical and quantum mechanics. The quantum case is treated in terms of a quantum version of the Wasserstein distance introduced in [F. Golse, C. Mouhot, T. Paul, Commun. Math. Phys. 343 (2016), 165-205]. We show that the optimal quantum cost can be cheaper than the classical one. We treat in detail the case of two particles: the equal mass case leads to equal quantum and classical costs. Moreover, we show examples with different masses for which the quantum cost is strictly cheaper than the classical cost.
rate research
Read More
We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies. In this setting, samples of an unknown state are requested sequentially and a decision to either continue or to accept one of the two hypotheses is made after each test. Under the constraint that the number of samples is bounded, either in expectation or with high probability, we exhibit adaptive strategies that minimize both types of misidentification errors. Namely, we show that these errors decrease exponentially (in the stopping time) with decay rates given by the measured relative entropies between the two states. Moreover, if we allow joint measurements on multiple samples, the rates are increased to the respective quantum relative entropies. We also fully characterize the achievable error exponents for non-adaptive strategies and provide numerical evidence showing that adaptive measurements are necessary to achieve our bounds under some additional assumptions.
We study a natural Wasserstein gradient flow on manifolds of probability distributions with discrete sample spaces. We derive the Riemannian structure for the probability simplex from the dynamical formulation of the Wasserstein distance on a weighted graph. We pull back the geometric structure to the parameter space of any given probability model, which allows us to define a natural gradient flow there. In contrast to the natural Fisher-Rao gradient, the natural Wasserstein gradient incorporates a ground metric on sample space. We illustrate the analysis of elementary exponential family examples and demonstrate an application of the Wasserstein natural gradient to maximum likelihood estimation.
In this paper, we consider Strassens version of optimal transport (OT) problem. That is, we minimize the excess-cost probability (i.e., the probability that the cost is larger than a given value) over all couplings of two given distributions. We derive large deviation, moderate deviation, and central limit theorems for this problem. Our proof is based on Strassens dual formulation of the OT problem, Sanovs theorem on the large deviation principle (LDP) of empirical measures, as well as the moderate deviation principle (MDP) and central limit theorems (CLT) of empirical measures. In order to apply the LDP, MDP, and CLT to Strassens OT problem, two nested optimal transport formulas for Strassens OT problem are derived. Based on these nested formulas and using a splitting technique, we carefully design asymptotically optimal solutions to Strassens OT problem and its dual formulation.
This paper is devoted to variational problems on the set of probability measures which involve optimal transport between unequal dimensional spaces. In particular, we study the minimization of a functional consisting of the sum of a term reflecting the cost of (unequal dimensional) optimal transport between one fixed and one free marginal, and another functional of the free marginal (of various forms). Motivating applications include Cournot-Nash equilibria where the strategy space is lower dimensional than the space of agent types. For a variety of different forms of the term described above, we show that a nestedness condition, which is known to yield much improved tractability of the optimal transport problem, holds for any minimizer. Depending on the exact form of the functional, we exploit this to find local differential equations characterizing solutions, prove convergence of an iterative scheme to compute the solution, and prove regularity results.
We elaborate the notion of a Ricci curvature lower bound for parametrized statistical models. Following the seminal ideas of Lott-Strum-Villani, we define this notion based on the geodesic convexity of the Kullback-Leibler divergence in a Wasserstein statistical manifold, that is, a manifold of probability distributions endowed with a Wasserstein metric tensor structure. Within these definitions, the Ricci curvature is related to both, information geometry and Wasserstein geometry. These definitions allow us to formulate bounds on the convergence rate of Wasserstein gradient flows and information functional inequalities in parameter space. We discuss examples of Ricci curvature lower bounds and convergence rates in exponential family models.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
