Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.28358

No-Go Theorems for Quantum Transport Metrics from Fixed Cost Operators

Minbo Gao, Zhengfeng Ji, Tianshi Yu

quant-phSubmitted Jul 30, 2026• Announced Jul 31, 2026• 0 citations
arXivHTMLPDF

Abstract

Coupling-based quantum optimal transport generalizes classical optimal transport by representing transport plans as bipartite states with prescribed marginals and evaluating their cost as the expectation of a fixed Hermitian operator. Friedland et al. [Phys. Rev. Lett. 129, 110402 (2022)] conjectured that the square root of the optimal cost associated with the SWAP projector is a metric in every dimension and that this property persists for nearby quantum cost matrices. Miller [arXiv:2607.07764] disproved both conjectures by constructing explicit diagonal qutrit counterexamples. Building on his analysis, we prove a uniform no-go theorem for standard couplings. In every dimension $d\geq3$, no fixed cost operator makes either the optimal cost or its square root a metric, with violations occurring already among commuting states. The obstruction persists under stabilization of the SWAP cost. For channel-induced couplings, global nonnegativity and vanishing self-cost force the cost operator to be zero, precluding point separation when $d\geq2$. Taken together, these no-go results show that fixed-cost coupling formulations do not lead to metrics on the full quantum state space.

Comments
17 pages

Related papers

Quantum Monge-Kantorovich Problem and Transport Distance between Density Matrices

Shmuel Friedland, Michał Eckstein, Sam Cole +1 more

A quantum version of the Monge-Kantorovich optimal transport problem is analyzed. The transport cost is minimized over the set of all bipartite coupling states ρ^{AB} such that both of its reduced density matrices ρ^{A} and ρ^{B} of dimension N are fixed. We show that, selecting the quantum cost matrix to be proportional to the projector on the antisymmetric subspace, the minimal transport cost leads to a semidistance between ρ^{A} and ρ^{B}, which is bounded from below by the rescaled Bures distance and from above by the root infidelity. In the single-qubit case, we provide a semianalytic expression for the optimal transport cost between any two states and prove that its square root satisfies the triangle inequality and yields an analog of the Wasserstein distance of the order of 2 on the set of density matrices. We introduce an associated measure of proximity of quantum states, called swap fidelity, and discuss its properties and applications in quantum machine learning.

arXiv:2102.07787•Physical Review Letters•Sep 7, 2022•31 citations

Metricity of separable quantum optimal transport with the Hilbert-Schmidt cost

Tomasz Miller

We prove that the square root of the separable quantum optimal transport cost associated with the orthogonal projection onto the antisymmetric subspace defines a genuine distance between density matrices. Equivalently, this establishes the triangle inequality for the order-two Beatty-França quantum optimal transport construction induced by the Hilbert-Schmidt distance between pure states. The result also proves metricity of the corresponding distance derived from separable SWAP fidelity. The proof replaces the unavailable gluing argument by convex-roof duality and a dimension-independent interpolation result for Hermitian operators.

quant-pharXiv:2609.03769•Sep 4, 2026•0 citations

Quantum Optimal Transport Barycenters: Existence, Duality, and Gaussian Rigidity

Augusto Gerolin, Zhiyi Lin

We develop a Quantum Optimal Transport (QOT) barycenter framework for quantum states, as an analog of Wasserstein barycenters~\cite{AguCar}, and establish existence and duality results for a broad class of possibly unbounded transport costs on separable Hilbert spaces. Our framework provides, in particular, a unified treatment of $2$-quantum Wasserstein (QW) barycenters in both the quantum-state and quantum-channel formulations by specializing to the canonical quadratic cost operators associated with the $2$-quantum Wasserstein distances of Caglioti--Golse--Mouhot--Paul~\cite{caglioti2021towards,Golse-Mouhot-Paul:2016} and De Palma--Trevisan~\cite{DPaTre19}. The central results concern Gaussian input states and, in particular, Gaussian rigidity: whether Gaussian input states force the 2-QW barycenter itself to be Gaussian and uniquely determined when the minimization is taken over all quantum states. We first show that the barycenter problem admits a Gaussian minimizer and reduces to a finite-dimensional convex optimization problem over covariance matrices. The main difficulty is that uniqueness of the optimal covariance does not, in general, imply uniqueness of the underlying quantum state. We bridge this gap through a state-reconstruction principle under covariance complementary slackness that upgrades uniqueness of the optimal covariance to uniqueness of the full quantum state, and thereby prove a global rigidity theorem: if at least one Gaussian input is faithful, then the barycenter is unique among all quantum states and is necessarily Gaussian. Faithfulness is sufficient but not necessary: families of pure inputs still determine a unique barycenter, whereas partially pure nonfaithful Gaussian inputs may admit multiple barycenters.

quant-pharXiv:2610.01855•Oct 2, 2026•0 citations

Comment on 'Quantum Monge-Kantorovich Problem and Transport Distance between Density Matrices'

Tomasz Miller

Friedland et al. [PRL 129, 110402 (2022)] proposed and studied a quantum analogue of the $p$-Wasserstein distance based on quantum cost matrices and quantum couplings. They conjectured that, despite being only a semidistance in general, this quantity is a true distance for a particular quantum cost matrix and for cost matrices in a small neighborhood of it. We disprove these conjectures by exhibiting an explicit family of triples of states for which the triangle inequality fails.

quant-pharXiv:2607.07764•Jul 9, 2026•0 citations

On the monotonicity of a quantum optimal transport cost

Alexander Müller‐Hermes

We show that the quantum generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. This disproves a recent conjecture by Friedland et al. Finally, we propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels.

arXiv:2211.11713•Nov 21, 2022•1 citation

Classical codes violate the conjectured square-root bound for quantum random access codes

Kangqiao Liu

We consider whether every quantum random access code (QRAC) with density-operator encodings and arbitrary decoding measurements obeys the conjectured bound $p\leq(1+\sqrt{m/n})/2$, where $n$ classical bits are encoded into $m$ qubits and $p$ is the worst-case success probability. We find that classical random access codes with private randomness, which form a subclass of this QRAC model, violate the bound. We embed these classical codes as QRACs with diagonal encoding states and commuting decoding measurements, and construct pure-state realizations with identical decoding statistics. The achievability theorem of Ambainis, Nayak, Ta-Shma, and Vazirani then yields violations for every fixed $p\in(1/2,1)$ at sufficiently large input length. The counterexamples span the full open interval between the conjectured and Nayak bounds at each fixed compression rate. A finite-blocklength analysis further yields order-optimal logarithmic qubit scaling for a recovery bias scaling as $\sqrt{\log_2 n/n}$ with a sufficiently large prefactor. These results identify the classical coding rate as the source of the separation and motivate restricted bounds based on quantitative spectral properties of decoding measurements.

quant-pharXiv:2607.15617•Jul 20, 2026•0 citations
Coupling-based quantum optimal transport generalizes classical optimal transport by representing transport plans as bipartite states with prescribed marginals and evaluating their cost as the expectation of a fixed Hermitian operator. Friedland et al. [Phys. Rev. Lett. 129, 110402 (2022)] conjectured that the square root of the optimal cost associated with the SWAP projector is a metric in every dimension and that this property persists for nearby quantum cost matrices. Miller [arXiv:2607.07764] disproved both conjectures by constructing explicit diagonal qutrit counterexamples. Building on his analysis, we prove a uniform no-go theorem for standard couplings. In every dimension d≥3d\geq3d≥3, no fixed cost operator makes either the optimal cost or its square root a metric, with violations occurring already among commuting states. The obstruction persists under stabilization of the SWAP cost. For channel-induced couplings, global nonnegativity and vanishing self-cost force the cost operator to be zero, precluding point separation when d≥2d\geq2d≥2. Taken together, these no-go results show that fixed-cost coupling formulations do not lead to metrics on the full quantum state space.
A quantum version of the Monge-Kantorovich optimal transport problem is analyzed. The transport cost is minimized over the set of all bipartite coupling states ρ^{AB} such that both of its reduced density matrices ρ^{A} and ρ^{B} of dimension N are fixed. We show that, selecting the quantum cost matrix to be proportional to the projector on the antisymmetric subspace, the minimal transport cost leads to a semidistance between ρ^{A} and ρ^{B}, which is bounded from below by the rescaled Bures distance and from above by the root infidelity. In the single-qubit case, we provide a semianalytic expression for the optimal transport cost between any two states and prove that its square root satisfies the triangle inequality and yields an analog of the Wasserstein distance of the order of 2 on the set of density matrices. We introduce an associated measure of proximity of quantum states, called swap fidelity, and discuss its properties and applications in quantum machine learning.
We prove that the square root of the separable quantum optimal transport cost associated with the orthogonal projection onto the antisymmetric subspace defines a genuine distance between density matrices. Equivalently, this establishes the triangle inequality for the order-two Beatty-França quantum optimal transport construction induced by the Hilbert-Schmidt distance between pure states. The result also proves metricity of the corresponding distance derived from separable SWAP fidelity. The proof replaces the unavailable gluing argument by convex-roof duality and a dimension-independent interpolation result for Hermitian operators.
We develop a Quantum Optimal Transport (QOT) barycenter framework for quantum states, as an analog of Wasserstein barycenters~\cite{AguCar}, and establish existence and duality results for a broad class of possibly unbounded transport costs on separable Hilbert spaces. Our framework provides, in particular, a unified treatment of 222-quantum Wasserstein (QW) barycenters in both the quantum-state and quantum-channel formulations by specializing to the canonical quadratic cost operators associated with the 222-quantum Wasserstein distances of Caglioti--Golse--Mouhot--Paul~\cite{caglioti2021towards,Golse-Mouhot-Paul:2016} and De Palma--Trevisan~\cite{DPaTre19}. The central results concern Gaussian input states and, in particular, Gaussian rigidity: whether Gaussian input states force the 2-QW barycenter itself to be Gaussian and uniquely determined when the minimization is taken over all quantum states. We first show that the barycenter problem admits a Gaussian minimizer and reduces to a finite-dimensional convex optimization problem over covariance matrices. The main difficulty is that uniqueness of the optimal covariance does not, in general, imply uniqueness of the underlying quantum state. We bridge this gap through a state-reconstruction principle under covariance complementary slackness that upgrades uniqueness of the optimal covariance to uniqueness of the full quantum state, and thereby prove a global rigidity theorem: if at least one Gaussian input is faithful, then the barycenter is unique among all quantum states and is necessarily Gaussian. Faithfulness is sufficient but not necessary: families of pure inputs still determine a unique barycenter, whereas partially pure nonfaithful Gaussian inputs may admit multiple barycenters.
Friedland et al. [PRL 129, 110402 (2022)] proposed and studied a quantum analogue of the ppp-Wasserstein distance based on quantum cost matrices and quantum couplings. They conjectured that, despite being only a semidistance in general, this quantity is a true distance for a particular quantum cost matrix and for cost matrices in a small neighborhood of it. We disprove these conjectures by exhibiting an explicit family of triples of states for which the triangle inequality fails.
We show that the quantum generalization of the 222-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. This disproves a recent conjecture by Friedland et al. Finally, we propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels.
We consider whether every quantum random access code (QRAC) with density-operator encodings and arbitrary decoding measurements obeys the conjectured bound p≤(1+m/n)/2p\leq(1+\sqrt{m/n})/2p≤(1+m/n​)/2, where nnn classical bits are encoded into mmm qubits and ppp is the worst-case success probability. We find that classical random access codes with private randomness, which form a subclass of this QRAC model, violate the bound. We embed these classical codes as QRACs with diagonal encoding states and commuting decoding measurements, and construct pure-state realizations with identical decoding statistics. The achievability theorem of Ambainis, Nayak, Ta-Shma, and Vazirani then yields violations for every fixed p∈(1/2,1)p\in(1/2,1)p∈(1/2,1) at sufficiently large input length. The counterexamples span the full open interval between the conjectured and Nayak bounds at each fixed compression rate. A finite-blocklength analysis further yields order-optimal logarithmic qubit scaling for a recovery bias scaling as log⁡2n/n\sqrt{\log_2 n/n}log2​n/n​ with a sufficiently large prefactor. These results identify the classical coding rate as the source of the separation and motivate restricted bounds based on quantitative spectral properties of decoding measurements.