Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help


bibkey: bunthpitriktitkosvirosztek2024wasserstein authors: G. Bunth; J. Pitrik; T. Titkos; D. Virosztek year: 2024 title: “On the metric property of quantum Wasserstein divergences” doi: 10.1103/PhysRevA.110.022211 url: https://arxiv.org/abs/2402.13150v4 claim: “Section 4.1 Proposition 3, equation (35), states D²(ρ,ρ)=4(1−√(1−|bρ|²)), corresponding for eigenvalues (1±r)/2 to 8−4(tr√ρ)²; Section 5.1 defines the Wasserstein complexity and states that its convexity is open.” strata_touched:

  • D5/S3/Quantum/QuantumChannels/QubitWassersteinCouplings
  • D5/S3/Quantum/QuantumChannels/WassersteinComplexityNonconvex license: citation-only triage: anchor

Quantum Wasserstein divergences and channel complexity

Verified locator

DOI: https://doi.org/10.1103/PhysRevA.110.022211

Source: https://arxiv.org/abs/2402.13150v4

Source statements

The paper defines couplings by prescribed partial traces, the quadratic quantum Wasserstein distance in equation (eq:2-Wass-quant-def), and the divergence in equation (eq:mod-qw-dist-def). Section 5.1 (PDF p. 17) defines the Wasserstein complexity by

Given a finite collections of observables , let us define the Wasserstein complexity of a channel by .

The same section (PDF p. 18) states:

We note that whether the Wasserstein complexity (37) is convex or not is an open question.

The self-cost identity used by the qubit settlement is literature-attested by Section 4.1, Proposition 3, equation (35): , which becomes for eigenvalues .

The Lean modules use the preregistered finite-dimensional qubit conventions and refute the convexity question for the Pauli triple by an explicit midpoint.

Definitions and encoding

Section 1.2 defines the coupling set by

Equation (eq:2-Wass-quant-def) is

Equation (eq:mod-qw-dist-def) is

The finite-dimensional encoding uses complex matrices on Fin d; the coupling matrix is indexed by Fin d × Fin d. Its positive semidefinite, trace-one condition is stated on that product index type. This is a Lean elaboration repair preserving the source state condition on the tensor product. The dual factor uses Matrix.transpose. The frozen partialTraceRight and partialTraceLeft are the literal explicit sums, and the frozen IsDensity is the literal positive semidefinite, trace-one condition. CW uses the supremum of the source maximum’s value set. Its boundedness and the existence of admissible couplings are proved in the supporting module. The universal claim retains the literal zero-dimensional case.

Scope of the refutation

The repository construction uses the Pauli triple and dephasing parameter . The unitary endpoint channels are mixed with weight . The midpoint complexity is at least , while both endpoints have complexity at most . The supporting module proves the exact self-cost formula for every qubit density state. No assumption of the source’s previously proved metric statements is changed by this refutation. The same midpoint exceeds both endpoint complexities, so quasi-convexity also fails. All three channels are unital, so restriction to unital channels does not restore convexity. The exact value of the complexity for the dephasing family remains open.

Counterexample family

The following extension is proved in prose; the Lean settlement specializes it to . For , set and . Their midpoint is the unital channel .

For a qubit state , put . The vectorized coupling has cross cost . Since is positive, its diagonal entries are real, so . Unitary covariance preserves the self cost, giving .

At , the pure marginal fixes the midpoint cross cost at . The input self cost is and the output self cost is . Consequently,

The strict inequality follows from . Thus subtracting the output self cost causes the convexity failure: channel mixing lowers that self cost while raising the cross cost. The same family refutes quasi-convexity among unital channels.

The pinned numerical check, rerun by the implementation seat, gives: python3 check.py, exit 0, bad= 0. The experiment entry is docs/reports/bunth-pitrik-titkos-virosztek-2024-wasserstein-complexity-convexity/check.py in the-omega-institute/trureturing-experiments at commit 10a541e9aacff47302154c721e10ff180fda60aa, SHA-256 04787a6acc2c5bccda908bcb90ffd00d928e418e14cebc28bfa5f2d90f9c68db.