Aug 2026
Faster Algorithms for Multimarginal Optimal Transport
For fixed $m$ and constant normalized accuracy, this work proves sparse-output lower bounds of $\widetilde\Omega(N)$ randomized classical queries, even with unrestricted output size, and $\widetilde\Omega(\sqrt{Nn})$ quantum queries for outputs with at most $n\operatorname{polylog}(n)$ atoms.
Brandon Augustino, Yue Sun, Atithi Acharya et al.
· arXiv.org · 0 citations