2000 character limit reached
Quantum optimal transport is cheaper
Published 1 Aug 2019 in math.AP, cs.IT, math-ph, math.IT, math.MP, and math.PR | (1908.01829v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.