Quantum Optimal Transport
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 AB with fixed reduced density matrices A and B of size m and n. The minimum quantum optimal transport cost QC(A,B) can be efficiently computed using semidefinite programming. In the case m=n the cost QC 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 QC 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 QCQ 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.