Triangle Inequality for a Quantum Wasserstein Divergence

• URL: http://arxiv.org/abs/2511.20450v1
• Date: Tue, 25 Nov 2025 16:19:51 GMT
• Title: Triangle Inequality for a Quantum Wasserstein Divergence
• Authors: Melchior Wirth,
• Abstract summary: We prove the triangle inequality for a quantum 2-Wasserstein distance.<n>The proof relies on complex analysis methods to establish a new integral representation of the cost.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We resolve a conjecture of De Palma and Trevisan by proving the triangle inequality for a quantum 2-Wasserstein distance. The proof relies on complex analysis methods to establish a new integral representation of the cost in the optimal transport problem.

Related papers

• Strong Kantorovich duality for quantum optimal transport with generic cost and optimal couplings on quantum bits [1.3999481573773072]
  We prove Kantorovich duality for a linearized version of a recently proposed non-quadratic quantum optimal transport problem, where quantum channels realize the transport.<n>As an application, we determine optimal solutions of both the primal and the dual problem using this duality in the case of quantum bits and distinguished cost operators, with certain restrictions on the states involved.
  arXiv  Detail & Related papers  (2025-10-30T10:23:50Z)
• An Egorov Theorem for Wasserstein Distances [0.0]
  We prove a new version of Egorov's theorem formulated in the Schr"odinger picture of quantum mechanics.<n>The special case $p=1$ corresponds to a "low-regularity" Egorov theorem, while larger values $p>1$ yield progressively stronger estimates.
  arXiv  Detail & Related papers  (2025-09-08T20:03:38Z)
• Quantum Lifting for Invertible Permutations and Ideal Ciphers [47.33103206862089]
  We derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models.<n>These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries.
  arXiv  Detail & Related papers  (2025-04-25T09:07:55Z)
• Wasserstein distances and divergences of order $p$ by quantum channels [1.8749305679160366]
  We introduce a non-quadratic generalization of the quantum mechanical optimal transport problem.<n> Relying on this general machinery, we introduce $p$-Wasserstein distances and divergences.<n>We prove triangle inequality for Wasserstein divergences under the sole assumption that an arbitrary one of the states involved is pure.
  arXiv  Detail & Related papers  (2025-01-14T12:29:05Z)
• On the metric property of quantum Wasserstein divergences [1.8749305679160366]
  Quantum Wasserstein divergences are modified versions of quantum Wasserstein defined by channels.<n>We prove triangle inequality for quantum Wasserstein divergences for every quantum system described by a separable Hilbert space.
  arXiv  Detail & Related papers  (2024-02-20T17:05:41Z)
• Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks [41.94295877935867]
  We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization problems.<n>We also solve the more general quadratic unconstrained discrete optimization problems with one-neighbor interactions in a lineal chain.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• On the monotonicity of a quantum optimal transport cost [91.3755431537592]
  We show that the generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. We propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels.
  arXiv  Detail & Related papers  (2022-11-21T18:33:50Z)
• Monotonicity of the quantum 2-Wasserstein distance [0.0]
  We show that for $N=2$ dimensional Hilbert space the quantum 2-Wasserstein distance is monotonous with respect to any single-qubit quantum operation. We conjecture that the unitary invariant quantum 2-Wasserstein semi-distance is monotonous with respect to all CPTP maps in any dimension $N$.
  arXiv  Detail & Related papers  (2022-04-15T09:57:39Z)
• Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
  We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof. We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
  arXiv  Detail & Related papers  (2022-03-30T18:00:00Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Continuous Regularized Wasserstein Barycenters [51.620781112674024]
  We introduce a new dual formulation for the regularized Wasserstein barycenter problem. We establish strong duality and use the corresponding primal-dual relationship to parametrize the barycenter implicitly using the dual potentials of regularized transport problems.
  arXiv  Detail & Related papers  (2020-08-28T08:28:06Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.