English
Related papers

Related papers: Quantum Wasserstein distances for quantum permutat…

200 papers

Distances have a ubiquitous role in persistent homology, from the direct comparison of homological representations of data to the definition and optimization of invariants. In this article we introduce a family of parametrized pseudometrics…

Algebraic Topology · Mathematics 2024-08-23 Jens Agerberg , Andrea Guidolin , Isaac Ren , Martina Scolamiero

Given the set of words of a given length for a given alphabet, the Hamming metric between two such words is the number of positions where the two words differ. A quantum version of the corresponding Kantorovich-Wasserstein metric on states…

Operator Algebras · Mathematics 2025-08-01 Marc A. Rieffel

Let $n \in \mathbb N$, let $\zeta_{n,1},...,\zeta_{n,n}$ be a sequence of independent random variables with $\mathbb E \zeta_{n,i}=0$ and $\mathbb E |\zeta_{n,i}|<\infty$ for each $i$, and let $\mu$ be an $\alpha$-stable distribution having…

Probability · Mathematics 2018-11-20 Lihu Xu

Introducing contravariant trace-densities for quantum states, we restore one to one correspondence between quantum operations described by normal CP maps and their trace densities as Hermitian positive operator-valued contravariant kernels.…

Mathematical Physics · Physics 2015-06-26 V P Belavkin

The squared Wasserstein distance is a natural quantity to compare probability distributions in a non-parametric setting. This quantity is usually estimated with the plug-in estimator, defined via a discrete optimal transport problem which…

Optimization and Control · Mathematics 2020-10-30 Lenaic Chizat , Pierre Roussillon , Flavien Léger , François-Xavier Vialard , Gabriel Peyré

The Wasserstein distance and its variations, e.g., the sliced-Wasserstein (SW) distance, have recently drawn attention from the machine learning community. The SW distance, specifically, was shown to have similar properties to the…

Machine Learning · Computer Science 2019-02-04 Soheil Kolouri , Kimia Nadjahi , Umut Simsekli , Roland Badeau , Gustavo K. Rohde

We present a noncommutative optimal transport framework for quantum channels acting on von Neumann algebras. Our central object is the Lipschitz cost measure, a transportation-inspired quantity that evaluates the minimal cost required to…

Operator Algebras · Mathematics 2025-06-05 Roy Araiza , Marius Junge , Peixue Wu

A generalization of the Wasserstein metric, the integrated transportation distance, establishes a novel distance between probability kernels of Markov systems. This metric serves as the foundation for an efficient approximation technique,…

Machine Learning · Computer Science 2023-12-07 Zhengqi Lin , Andrzej Ruszczynski

Let $M$ be a connected compact Riemannian manifold possibly with a boundary, let $V\in C^2(M)$ such that $\mu(\d x):=\e^{V(x)}\d x$ is a probability measure, where $\d x$ is the volume measure, and let $L=\Delta+\nabla V$. The exact…

Probability · Mathematics 2021-07-27 Feng-Yu Wang , Bingyao Wu

We establish general upper bounds on the Kolmogorov distance between two probability distributions in terms of the distance between these distributions as measured with respect to the Wasserstein or smooth Wasserstein metrics. These bounds…

Probability · Mathematics 2023-01-02 Robert E. Gaunt , Siqi Li

Optimal transport theory has recently been extended to quantum settings, where the density matrices generalize the probability measures. In this paper, we study the computational aspects of the order 2 quantum Wasserstein distance,…

Optimization and Control · Mathematics 2025-11-27 Saroj Prasad Chhatoi , Victor Magron

Let $\mu_N$ be the empirical measure associated to a $N$-sample of a given probability distribution $\mu$ on $\mathbb{R}^d$. We are interested in the rate of convergence of $\mu_N$ to $\mu$, when measured in the Wasserstein distance of…

Probability · Mathematics 2013-12-10 Nicolas Fournier , Arnaud Guillin

Distances between probability distributions are a key component of many statistical machine learning tasks, from two-sample testing to generative modeling, among others. We introduce a novel distance between measures that compares them…

Machine Learning · Statistics 2025-07-09 Arturo Castellanos , Anna Korba , Pavlo Mozharovskyi , Hicham Janati

We consider random walks $X,Y$ on a finite graph $G$ with respective lazinesses $\alpha, \beta \in [0,1]$. Let $\mu_k$ and $\nu_k$ be the $k$-step transition probability measures of $X$ and $Y$. In this paper, we study the Wasserstein…

Combinatorics · Mathematics 2021-10-22 Sophia Benjamin , Arushi Mantri , Quinn Perian

We provide a general steady-state diffusion approximation result which bounds the Wasserstein distance between the reversible measure $\mu$ of a diffusion process and the measure $\nu$ of an approximating Markov chain. Our result is…

Probability · Mathematics 2022-03-15 Thomas Bonis

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally…

Machine Learning · Computer Science 2026-02-20 Moritz Piening , Robert Beinert

In this article, we generalize the Wasserstein distance to measures with different masses. We study the properties of such distance. In particular, we show that it metrizes weak convergence for tight sequences. We use this generalized…

Analysis of PDEs · Mathematics 2015-06-05 Benedetto Piccoli , Francesco Rossi

We use Stein's method to bound the Wasserstein distance of order $2$ between a measure $\nu$ and the Gaussian measure using a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. If the stochastic…

Probability · Mathematics 2020-05-12 Thomas Bonis

We derive first-order (in the stepsize) bounds on the bias in Wasserstein distances of the invariant measure of stochastic gradient kinetic Langevin dynamics with minimal assumptions on the stochastic gradient noise. These bounds sharpen…

Computation · Statistics 2026-04-28 Daniel Paulin , Peter A. Whalley

Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a…

Computational Geometry · Computer Science 2018-11-05 Jesse J. Berwald , Joel M. Gottlieb , Elizabeth Munch