Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Optimal Transport (2105.06922v2)

Published 14 May 2021 in quant-ph and math.OC

Abstract: We analyze a quantum version of the Monge--Kantorovich optimal transport problem. The quantum transport cost related to a Hermitian cost matrix $C$ is minimized over the set of all bipartite coupling states $\rho{AB}$ with fixed reduced density matrices $\rhoA$ and $\rhoB$ of size $m$ and $n$. The minimum quantum optimal transport cost $\rTQ_{C}(\rhoA,\rhoB)$ can be efficiently computed using semidefinite programming. In the case $m=n$ the cost $\rTQ_{C}$ gives a semidistance if and only if $C$ is positive semidefinite and vanishes exactly on the subspace of symmetric matrices. Furthermore, if $C$ satisfies the above conditions, then $\sqrt{\rTQ_{C}}$ induces a quantum analogue of the Wasserstein-2 distance. Taking the quantum cost matrix $CQ$ to be the projector on the antisymmetric subspace, we provide a semi-analytic expression for $\rTQ_{CQ}$ for any pair of single-qubit states and show that its square root yields a transport distance on the Bloch ball. Numerical simulations suggest that this property holds also in higher dimensions. Assuming that the cost matrix suffers decoherence and that the density matrices become diagonal, we study the quantum-to-classical transition of the Earth mover's distance, propose a continuous family of interpolating distances, and demonstrate that the quantum transport is cheaper than the classical one. Furthermore, we introduce a related quantity -- the SWAP-fidelity -- and compare its properties with the standard Uhlmann--Jozsa fidelity. We also discuss the quantum optimal transport for general $d$-partite systems.

Citations (30)

Summary

We haven't generated a summary for this paper yet.