Quantum transport cost cones: exponent monotonicity, sharp operator-norm approximation and the sign of the centred cost

Unrefereed research candidate. In one sentence: this paper proves a conjecture of Bunth, Pitrik, Titkos and Virosztek that the cones of quantum transport cost operators grow with the exponent p, shows that noncommuting observables never help to approximate costs built from given measurement blocks, computes the resulting approximation errors exactly in key cases, and finds exactly when the centred cost of a single observable stays nonnegative. Context. In classical optimal transport, moving a unit of mass from x to y often costs |x − y|p. In the quantum optimal transport theory of De Palma and Trevisan, transport between quantum states is carried out by a quantum channel, and an observable A gives the cost operator Gp(A) = |A ⊗ I − I ⊗ AT|p. A state can have positive cost of transport to itself, so one subtracts the self-costs; the resulting centred cost is guaranteed nonnegative for quadratic costs (p = 2). Bunth, Pitrik, Titkos and Virosztek (arXiv:2501.08066) asked whether the cones Cp of finite sums of such costs, for observables with finitely many outcomes, increase with p (their Conjecture 9); if so, their p-Wasserstein divergence is well defined for p ≤ 2. Results. (1) The conjecture holds: Cp ⊆ Cq for 0 < p ≤ q ≤ ∞, and an n-level cost needs at most n(n−1)/2 costs of functions of the same observable. The proof transfers two classical facts about the real line to spectral blocks: the isometric snowflake embedding of the line (Mendel and Naor) and Ball's finite-dimensional compression (as recorded by Deza and Laurent). (2) A positive, operator-norm-contracting retraction maps every cone onto a classical cone of distance arrays; hence noncommuting observables never improve the approximation of a cost that is constant on spectral blocks and vanishes on the diagonal blocks, in operator norm, in pure-state transport values and, in finite dimension, in every unitarily invariant norm. (3) Exact errors: for every three-level cost; in dimension at least three, the generators of the limiting cone are at distance exactly 1/(1+2max(p,1)) from Cp (1/3 for p ≤ 1; 1/5 at p = 2; 1/17 at p = 4), and in finite dimension at least three the worst trace-one element is at half that distance. For four or more levels a polygon lower bound is proved; it is exact for three levels, can be strict when p > 1 (explicit counterexample) and is only conjectured to be exact when p ≤ 1. (4) The finite-dimensional limiting cone is identified and the extreme rays of every cone are classified. (5) For one observable with at least three eigenvalues, the centred cost is nonnegative on all pairs of states exactly when p ≤ 2; for p < 2 the p-divergence satisfies a triangle inequality up to the sharp factor 22/max(p,1)−1. Limits. Exponent monotonicity concerns observables with finitely many outcomes, as in the conjecture. Results are for bounded observables; position and momentum are not covered. For four or more levels only the polygon lower bound is proved. Whether sums of several noncommuting costs keep the centred cost nonnegative when p > 2 is open. Contents. The paper (LaTeX source and PDF); a Python verification script (NumPy and SciPy; deterministic seed) that checks the proofs numerically on random finite-dimensional instances, with its recorded output and a built-in negative control; a dated prior-art record; the bibliography from registry records; a machine-readable index; a research-gate record; a replay receipt and SHA-256 sums. Assurance. Written proofs with numerical checks; the script checks the proofs and does not replace them. Internal AI-assisted review only (five reviewer roles, an adversarial review and an audit of new proofs by a second AI model, clean replays, one revision round, a re-review and proof audits): not peer review, independent reproduction or formal verification. Creator: Anonymous. Text and data CC0-1.0; code MIT.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24261888
Primary Topic
Geometric Analysis and Curvature Flows
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantum transport cost cones: exponent monotonicity, sharp operator-norm approximation and the sign of the centred cost

Zenodo (CERN European Organization for Nuclear Research)
Geometric Analysis and Curvature Flows
preprint

Quantum transport cost cones: exponent monotonicity, sharp operator-norm approximation and the sign of the centred cost

preprint en

Abstract

Unrefereed research candidate. In one sentence: this paper proves a conjecture of Bunth, Pitrik, Titkos and Virosztek that the cones of quantum transport cost operators grow with the exponent p, shows that noncommuting observables never help to approximate costs built from given measurement blocks, computes the resulting approximation errors exactly in key cases, and finds exactly when the centred cost of a single observable stays nonnegative. Context. In classical optimal transport, moving a unit of mass from x to y often costs |x − y|p. In the quantum optimal transport theory of De Palma and Trevisan, transport between quantum states is carried out by a quantum channel, and an observable A gives the cost operator Gp(A) = |A ⊗ I − I ⊗ AT|p. A state can have positive cost of transport to itself, so one subtracts the self-costs; the resulting centred cost is guaranteed nonnegative for quadratic costs (p = 2). Bunth, Pitrik, Titkos and Virosztek (arXiv:2501.08066) asked whether the cones Cp of finite sums of such costs, for observables with finitely many outcomes, increase with p (their Conjecture 9); if so, their p-Wasserstein divergence is well defined for p ≤ 2. Results. (1) The conjecture holds: Cp ⊆ Cq for 0 < p ≤ q ≤ ∞, and an n-level cost needs at most n(n−1)/2 costs of functions of the same observable. The proof transfers two classical facts about the real line to spectral blocks: the isometric snowflake embedding of the line (Mendel and Naor) and Ball's finite-dimensional compression (as recorded by Deza and Laurent). (2) A positive, operator-norm-contracting retraction maps every cone onto a classical cone of distance arrays; hence noncommuting observables never improve the approximation of a cost that is constant on spectral blocks and vanishes on the diagonal blocks, in operator norm, in pure-state transport values and, in finite dimension, in every unitarily invariant norm. (3) Exact errors: for every three-level cost; in dimension at least three, the generators of the limiting cone are at distance exactly 1/(1+2max(p,1)) from Cp (1/3 for p ≤ 1; 1/5 at p = 2; 1/17 at p = 4), and in finite dimension at least three the worst trace-one element is at half that distance. For four or more levels a polygon lower bound is proved; it is exact for three levels, can be strict when p > 1 (explicit counterexample) and is only conjectured to be exact when p ≤ 1. (4) The finite-dimensional limiting cone is identified and the extreme rays of every cone are classified. (5) For one observable with at least three eigenvalues, the centred cost is nonnegative on all pairs of states exactly when p ≤ 2; for p < 2 the p-divergence satisfies a triangle inequality up to the sharp factor 22/max(p,1)−1. Limits. Exponent monotonicity concerns observables with finitely many outcomes, as in the conjecture. Results are for bounded observables; position and momentum are not covered. For four or more levels only the polygon lower bound is proved. Whether sums of several noncommuting costs keep the centred cost nonnegative when p > 2 is open. Contents. The paper (LaTeX source and PDF); a Python verification script (NumPy and SciPy; deterministic seed) that checks the proofs numerically on random finite-dimensional instances, with its recorded output and a built-in negative control; a dated prior-art record; the bibliography from registry records; a machine-readable index; a research-gate record; a replay receipt and SHA-256 sums. Assurance. Written proofs with numerical checks; the script checks the proofs and does not replace them. Internal AI-assisted review only (five reviewer roles, an adversarial review and an audit of new proofs by a second AI model, clean replays, one revision round, a re-review and proof audits): not peer review, independent reproduction or formal verification. Creator: Anonymous. Text and data CC0-1.0; code MIT.

Zenodo (CERN European Organization for Nuclear Research)
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon