{
  "schemaVersion": "1.6",
  "slug": "quantum-transport-cost-cones",
  "title": "Quantum transport cost cones: exponent monotonicity, sharp operator-norm approximation and the sign of the centred cost",
  "shortTitle": "Quantum transport costs: noncommuting observables never help",
  "url": "https://evidencepress.org/releases/quantum-transport-cost-cones/",
  "oneLine": "A conjecture on quantum transport cost operators is proved, a retraction shows that noncommuting observables never improve block-shaped approximations, and the best errors are exact: 1/(1 + 2^max(p,1)) for the simplest limiting cost, with the centred cost of one observable nonnegative exactly when p ≤ 2.",
  "abstract": "In classical optimal transport, moving a unit of mass from x to y often costs |x − y|^p. In the quantum 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 G_p(A) = |A ⊗ I − I ⊗ A^T|^p. Because a state can have positive cost of transport to itself, the self-costs are subtracted; the resulting centred cost is guaranteed nonnegative for quadratic costs. Bunth, Pitrik, Titkos and Virosztek conjectured that the cones C_p of finite sums of such costs, for observables with finitely many outcomes, grow with p; this would make their p-Wasserstein divergence well defined for p ≤ 2. This candidate proves the conjecture by transferring two classical facts about the real line to spectral blocks: the snowflake embedding of the line (Mendel and Naor) and Ball's finite-dimensional compression (as recorded by Deza and Laurent). Its main new tool is a positive, operator-norm-contracting retraction onto classical cones of distance arrays: noncommuting observables never help to approximate a cost that is constant on spectral blocks and vanishes on the diagonal blocks. With it, exact distances are computed: for every three-level cost; 1/(1 + 2^max(p,1)) for the orthogonal-pair generators of the limiting cone in dimension at least three; and half that for the worst trace-one element in finite dimension at least three. These are also the smallest uniform errors in pure-state transport values. For four or more levels a polygon lower bound is proved; it is exact for three levels, can be strict when p > 1, and is conjectured to be exact when p ≤ 1. For one observable with at least three eigenvalues, the centred cost is nonnegative on all pairs of states exactly when p ≤ 2, and for p < 2 the divergence obeys a relaxed triangle inequality with the sharp constant 2^(2/max(p,1) − 1). Limits: bounded observables only; the sign of the centred cost for several noncommuting costs with p > 2 is open. AI-assisted, unrefereed candidate; no external peer review, independent reproduction or formal verification is claimed.",
  "datePublished": "2026-11-15",
  "dateModified": "2026-11-15",
  "version": "0.1.0-candidate",
  "doi": "10.5281/zenodo.24261889",
  "doiUrl": "https://doi.org/10.5281/zenodo.24261889",
  "conceptDoi": "10.5281/zenodo.24261888",
  "pdfUrl": "https://github.com/ipitchford/quantum-transport-cost-cones/releases/download/v0.1.0-candidate/quantum-transport-cost-cones-0.1.0-candidate.pdf",
  "altPdfUrl": null,
  "altPdfLabel": null,
  "zenodoUrl": "https://zenodo.org/records/24261889",
  "repoUrl": "https://github.com/ipitchford/quantum-transport-cost-cones",
  "releaseUrl": "https://github.com/ipitchford/quantum-transport-cost-cones/releases/tag/v0.1.0-candidate",
  "markdownUrl": "https://evidencepress.org/releases/quantum-transport-cost-cones/index.md",
  "bibtexUrl": "https://evidencepress.org/releases/quantum-transport-cost-cones/cite.bib",
  "audioUrl": "https://evidencepress.org/assets/audio/quantum-transport-cost-cones.mp3",
  "imageUrl": "https://evidencepress.org/assets/og/quantum-transport-cost-cones.png?v=2543fa18ca",
  "coverArtUrl": "https://evidencepress.org/assets/art/quantum-transport-cost-cones.svg?v=059113c84b",
  "media": [
    {
      "type": "audio",
      "url": "https://evidencepress.org/assets/audio/quantum-transport-cost-cones.mp3",
      "name": "Plain-English audio briefing",
      "description": "Communication aid; not additional research evidence.",
      "transcriptUrl": "https://evidencepress.org/assets/audio/quantum-transport-cost-cones.txt"
    }
  ],
  "authors": [
    "Anonymous"
  ],
  "license": "CC0-1.0",
  "status": "unrefereed-candidate",
  "verification": {
    "peerReviewed": false,
    "independentlyReproduced": false,
    "formallyVerified": false,
    "internallyReplayed": true,
    "detail": "Unrefereed AI-assisted mathematics candidate with written proofs and numerical checks. Internal AI-assisted review in five reviewer roles and an adversarial review by a second AI model, clean replays, one revision round with extensions (the sign dichotomy, the sharp relaxed triangle constant, the pure-state and unitarily invariant versions, the polygon bound), then a re-review, proof audits and a second-model audit of the new proofs, which refuted a stronger conjecture for p > 1 (now Proposition 7.6); no error was found in the published results. The script checks the proofs and is not part of them. External specialist review, independent reproduction and formal verification have not been established."
  },
  "assurance": [
    {
      "dimension": "availability",
      "label": "Availability and archiving",
      "question": "Is the evidence package publicly retrievable from an archive under a persistent identifier?",
      "state": "passed",
      "evidenceUrl": "https://zenodo.org/records/24261889",
      "note": "The versioned research package and paper are publicly archived on GitHub and Zenodo. Provider asset parity was checked against frozen local files; availability does not establish correctness or peer review."
    },
    {
      "dimension": "internalReplay",
      "label": "Internal replay",
      "question": "Does the producer’s own pipeline reproduce the stated result from the archived package?",
      "state": "passed",
      "note": "The verification script was rerun from fresh copies in normal mode and under python -O with pinned packages; the recorded output matched byte for byte. A perturbed edge constant (--negative-control) makes it fail under -O. GitHub CI reruns the script under -O with the negative control and compares counts and quoted values (blocking), and in normal mode (non-blocking), on Linux."
    },
    {
      "dimension": "independentRerun",
      "label": "Independent rerun",
      "question": "Has someone else run the supplied implementation and obtained the stated result?",
      "state": "not-assessed",
      "note": "No unaffiliated rerun has been established."
    },
    {
      "dimension": "independentReimplementation",
      "label": "Independent reimplementation",
      "question": "Has someone else reached the result from an independent implementation?",
      "state": "not-assessed",
      "note": "No unaffiliated reimplementation; internal reviewers recomputed the quoted constants, and the release banner generator recomputes the edge distances from the formula of Theorem 8.2 and compares them with the recorded output."
    },
    {
      "dimension": "formalVerification",
      "label": "Formal verification",
      "question": "Is a formalised statement machine-checked, and over which trusted base?",
      "state": "not-assessed",
      "note": "No proof-assistant formalisation."
    },
    {
      "dimension": "specialistReview",
      "label": "Specialist review",
      "question": "Has a domain specialist assessed the argument?",
      "state": "not-assessed",
      "note": "AI-assisted internal and adversarial review is not external specialist review."
    },
    {
      "dimension": "editorialPeerReview",
      "label": "Editorial peer review",
      "question": "Has a journal or venue run peer review to a decision?",
      "state": "not-assessed",
      "note": "No external editorial peer review."
    },
    {
      "dimension": "dataEnvironmentReproducibility",
      "label": "Data and environment reproducibility",
      "question": "Are data and computational environment pinned well enough to rebuild?",
      "state": "passed",
      "note": "Python 3.12 with pinned numpy 2.3.5 and scipy 1.17.0 and a fixed seed; output reproduced byte for byte on the release platform; on Linux CI the pass status, instance counts and quoted values agree. Not a locked container."
    }
  ],
  "provenance": {
    "aiGenerated": true,
    "aiAssisted": true,
    "generatedBy": [
      "AI-assisted mathematical research",
      "AI-assisted internal review (five reviewer roles), adversarial review and audit by a second AI model, re-review, proof audits, clean replays",
      "Claude Code: publication packaging and release"
    ],
    "humanRole": "Publication authority only; no human research contribution inferred.",
    "reviewStatus": "Internal AI-assisted and adversarial review, not external peer review."
  },
  "attributionBoundary": null,
  "problem": null,
  "orderedProductAverage": null,
  "corrections": [],
  "publicCorrections": [],
  "publicCorrectionIndexes": null,
  "pageStructureVersion": "2.0",
  "pageStructureVariant": "canonical-theorem",
  "pageStructureWaivers": [],
  "recordMaturity": "current",
  "metadataProvenance": "Prepared from the final paper (revision of 15 November 2026 with the DOI added to the title-page version line, 18 pages), its script and recorded output, the prior-art record and the frozen release archive. The versioned GitHub and Zenodo research archives were checked against the frozen release assets on 15 November 2026.",
  "grandfatheredAtSchemaVersion": null,
  "keywords": [
    "quantum optimal transport",
    "quantum Wasserstein divergence",
    "cost operators",
    "snowflake embeddings",
    "cut cone",
    "negative type",
    "operator-norm approximation",
    "separability"
  ],
  "keyResults": [
    "Theorem 2.1 (proof): for 0 < p < q < ∞, every cost G_p(A) of an observable with n distinct eigenvalues is a sum of at most n(n − 1)/2 costs G_q(B_r) of functions of A; hence C_p ⊆ C_q for 0 < p ≤ q ≤ ∞ (Conjecture 9 of Bunth, Pitrik, Titkos and Virosztek), using the snowflake embedding of the line (Mendel and Naor) and Ball's compression (as recorded by Deza and Laurent).",
    "Theorems 2.2 and 6.1, Propositions 6.3 and 6.4 (proof): a positive, operator-norm-contracting projection maps every C_p onto a classical cone of distance arrays and fixes block-constant targets; noncommuting observables never improve their approximation, in operator norm, in pure-state transport values and, in finite dimension, in every unitarily invariant norm.",
    "Theorems 7.2 and 8.2, Corollary 8.3 (proof): exact distances for every three-level cost; for dim H ≥ 3, dist(E_uv, C_p) = 1/(1 + 2^max(p,1)) (1/3 for p ≤ 1; 1/5, 1/9, 1/17 at p = 2, 3, 4); the worst trace-one element of the limiting cone is at half that distance in finite dimension d ≥ 3.",
    "Propositions 7.5 and 7.6, Conjecture 7.7: a polygon lower bound for any number of levels, exact for three levels; strict for the spectrum 0, 1, 9, 10 with p = 3, q = 6 (bound about 6300.58, best single function about 9224.3); conjectured exact for p ≤ 1, supported by 226 random instances with p ≤ 1 (and 174 with p > 1) and 200 cut-cone linear programmes.",
    "Theorem 5.2 and Corollary 5.3 (proof): for one observable with n ≥ 3 eigenvalues, the centred cost is nonnegative on all states if and only if p ≤ 2, equivalently G_p(A) ∈ C_2; for p < 2 the p-divergence satisfies d(ρ, ω) ≤ 2^(2/max(p,1) − 1)(d(ρ, τ) + d(τ, ω)), with a sharp constant."
  ],
  "reviews": [],
  "evidencePackage": "An 18-page paper with a plain introduction, a table of what was known, written proofs and a list of open problems; a dated prior-art record; a Python script with recorded output that checks the proofs numerically on random finite-dimensional instances with noncommuting observables (spectral identities, the retraction, the exact distances, the sign dichotomy and its sharp constant, a local search that never beats the edge bound, and 400 polygon instances with 200 cut-cone linear programmes). Clean replay from fresh copies in normal and python -O mode reproduced the recorded output byte for byte, and a perturbed edge constant makes the script fail.",
  "openProblems": [],
  "mathObjects": [],
  "relatedWorks": [
    {
      "citation": "Bunth, Pitrik, Titkos and Virosztek (2025), Wasserstein distances and divergences of order p by quantum channels. arXiv:2501.08066, version 3. Defines the cones C_p and the p-Wasserstein divergence, proves the known cases listed in Table 1 of the paper, and states Conjecture 9, proved here.",
      "url": "https://arxiv.org/abs/2501.08066v3",
      "doi": "10.48550/arXiv.2501.08066"
    },
    {
      "citation": "De Palma and Trevisan (2021), Quantum Optimal Transport with Quantum Channels. Annales Henri Poincaré. The channel-based quantum optimal transport framework and nonnegativity of the centred cost for quadratic costs (Theorem 1, Corollary 1).",
      "url": "https://doi.org/10.1007/s00023-021-01042-3",
      "doi": "10.1007/s00023-021-01042-3"
    },
    {
      "citation": "Mendel and Naor (2004), Euclidean quotients of finite metric spaces. Advances in Mathematics. The isometric snowflake embedding of the line (Remark 5.10), one of the two classical facts behind the proof of the conjecture.",
      "url": "https://doi.org/10.1016/j.aim.2003.12.001",
      "doi": "10.1016/j.aim.2003.12.001"
    },
    {
      "citation": "Deza and Laurent (1993), Measure aspects of cut polyhedra: l1-embeddability and probability. Technical Report LIENS-93-17, École Normale Supérieure. Records Ball's finite-dimensional compression and the cones NOR_n(p) (Section 7.1), and Karzanov's NP-completeness result for the cut cone (Section 7.2).",
      "url": "https://www.di.ens.fr/reports/1993/liens-93-17.A4.pdf",
      "doi": null
    },
    {
      "citation": "Schoenberg (1938), Metric spaces and positive definite functions. Transactions of the American Mathematical Society. Negative type of |x − y|^p for p ≤ 2, behind the sign threshold.",
      "url": "https://doi.org/10.1090/s0002-9947-1938-1501980-0",
      "doi": "10.1090/s0002-9947-1938-1501980-0"
    },
    {
      "citation": "Wirth (2025), Triangle Inequality for a Quantum Wasserstein Divergence. arXiv:2511.20450. The triangle inequality for the square root of the centred quadratic cost (Corollary 2.14), the p = 2 case of the relaxed inequality.",
      "url": "https://arxiv.org/abs/2511.20450",
      "doi": "10.48550/arXiv.2511.20450"
    },
    {
      "citation": "Bunth (2026), Wigner symmetries single out symmetric Wasserstein distances in all finite dimensions. arXiv:2607.08298. Minimal numbers of quadratic generators, consistent with Proposition 10.1.",
      "url": "https://arxiv.org/abs/2607.08298",
      "doi": "10.48550/arXiv.2607.08298"
    },
    {
      "citation": "Gao, Ji and Yu (2026), No-Go Theorems for Quantum Transport Metrics from Fixed Cost Operators. arXiv:2607.28358. Without centring, a fixed cost operator with nonnegative values and vanishing self-costs must be zero.",
      "url": "https://arxiv.org/abs/2607.28358",
      "doi": "10.48550/arXiv.2607.28358"
    },
    {
      "citation": "Cole, Eckstein, Friedland and Życzkowski (2023), On Quantum Optimal Transport. Mathematical Physics, Analysis and Geometry. A different, coupling-based quantum transport theory, not used here.",
      "url": "https://doi.org/10.1007/s11040-023-09456-7",
      "doi": "10.1007/s11040-023-09456-7"
    }
  ],
  "claimAssurance": null,
  "operatingModel": {
    "version": "1.0",
    "workId": "ep-work:quantum-transport-cost-cones",
    "attemptIds": [
      "ep-attempt:quantum-transport-cost-cones-publication"
    ],
    "aims": [
      "science"
    ],
    "artifactRoles": [
      "research-output",
      "communication"
    ],
    "lineageId": null,
    "accelerationPrimitives": [
      "adversarial-controls",
      "assurance-vector",
      "agent-readable-research-object"
    ],
    "decisionObject": {
      "type": "other",
      "description": "Treat quantum p-Wasserstein divergences of Bunth, Pitrik, Titkos and Virosztek as well defined for p ≤ 2, and compute best approximations of block-shaped cost operators with commuting (block) observables only.",
      "scope": "Observables with finitely many outcomes for the cone inclusions; bounded observables; exact distances for three levels and for the limiting-cone generators; only a lower bound for four or more levels; multi-observable sign question for p > 2 open."
    },
    "bottleneckTargeted": [
      "assurance",
      "publication"
    ],
    "semanticBridge": {
      "state": "explicit",
      "description": "Section 1 and Table 1 separate what was known (the De Palma–Trevisan framework, the cases proved by Bunth, Pitrik, Titkos and Virosztek, the classical snowflake and compression facts) from what is new (the proof of Conjecture 9, the retraction, the exact distances, the limiting-cone description, the sign dichotomy); PRIOR_ART.md records attribution per result.",
      "remainingRisks": [
        "The bounded literature search is not exhaustive priority certification.",
        "The conjecture paper and three other cited works are recent preprints."
      ]
    },
    "humanJudgmentGates": [
      "Publication is authorised; scientific endorsement is not inferred.",
      "External specialist review and independent reproduction remain open."
    ],
    "parentLinks": [],
    "assuranceTarget": {
      "dimensions": [
        "specialistReview",
        "independentRerun",
        "formalVerification",
        "priorityAssessment"
      ],
      "nextAction": "Have a specialist in quantum optimal transport check the retraction (Theorem 6.1) and the exact distances (Theorems 7.2 and 8.2), and an expert in finite metric embeddings check the transfer argument (Sections 3 and 4).",
      "claimCeiling": "Written proofs of the cone inclusions, the retraction, the exact distances, the limiting-cone description and the sign results; polygon exactness for p ≤ 1 conjectured only; internal verification is not external assurance."
    },
    "impactClaims": [
      {
        "id": "quantum-transport-cost-cones-no-impact",
        "aim": "science",
        "outcome": "An openly inspectable proof of the Bunth–Pitrik–Titkos–Virosztek conjecture with exact approximation errors and a sharp sign rule for the centred cost.",
        "setting": "AI-assisted mathematical physics research",
        "status": "NO_IMPACT_EVIDENCE",
        "designClass": "none",
        "comparator": "None registered.",
        "estimand": "No research-speed or scientific-impact effect is estimated.",
        "evidenceRefs": [],
        "registeredDesignRef": null,
        "independentAssessment": null
      }
    ]
  },
  "researchMetrics": {
    "schemaVersion": "1.0",
    "policyUrl": "https://evidencepress.org/api/research-metrics-policy.json",
    "outcomePolicyUrl": "https://evidencepress.org/api/v2/research-metrics-policy.json",
    "workLedgerUrl": "https://evidencepress.org/api/work-ledger.json",
    "claimCeiling": "These records describe scoped workflow inputs and outcomes. They support calibration and reference-class construction, but do not by themselves establish research acceleration, theorem correctness, novelty, independent assurance or impact.",
    "attempts": [
      {
        "attemptId": "ep-attempt:quantum-transport-cost-cones-publication",
        "status": "active",
        "resultClass": "pending",
        "metrics": {
          "schemaVersion": "1.0",
          "measurementScope": "publication-only",
          "scopeBoundary": "Only archive packaging, site integration, guarded delivery and canonical readback from registration are prospective. Earlier research, review, revision and extension work are left-censored.",
          "forecast": {
            "frozenAt": "2026-11-15T21:15:54Z",
            "procedureClass": "full-candidate-publication",
            "targetOutcome": "Accurately scoped GitHub, Zenodo and canonical Evidence Press release with explanatory media and machine readback, if all publication gates pass.",
            "expectedActiveMinutes": 90,
            "plausibleLowMinutes": 60,
            "plausibleHighMinutes": 150,
            "expectedUnattendedWaitMinutes": 30,
            "referenceClass": {
              "label": "Full mathematical candidate publication",
              "sampleSize": 0,
              "basis": "Route benchmark planning prior, not empirical calibration."
            },
            "fermiComponents": [
              {
                "component": "Research archive packaging, replay and identities",
                "count": 1,
                "lowMinutesPerUnit": 25,
                "centralMinutesPerUnit": 35,
                "highMinutesPerUnit": 60,
                "basis": "One frozen package with a rating-free public export, clean replay and DOI insertion."
              },
              {
                "component": "Page, metadata and media integration",
                "count": 1,
                "lowMinutesPerUnit": 20,
                "centralMinutesPerUnit": 30,
                "highMinutesPerUnit": 45,
                "basis": "One reader-first release, drafted in parallel with verification."
              },
              {
                "component": "Guarded deployment and canonical readback",
                "count": 1,
                "lowMinutesPerUnit": 15,
                "centralMinutesPerUnit": 25,
                "highMinutesPerUnit": 45,
                "basis": "Mandatory site tests, one merge cycle with ledger carry-forward, zero-cost deployment and public checks."
              }
            ],
            "probabilityPositiveSignal": 0.9,
            "probabilityTargetClosure": 0.85,
            "probabilityHorizonMinutes": 300,
            "assumptions": [
              "The approved scientific package remains valid and configured providers remain available."
            ],
            "reforecastTriggers": [
              "A publication gate reveals a scientific or integrity defect, or a provider outage blocks delivery."
            ],
            "stopRule": "Do not weaken assurance, integrity or cost gates to meet the forecast."
          },
          "outcome": null
        },
        "missingnessReason": null
      }
    ]
  }
}