Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generic state-induced and diamond distance comparison

Proved
QAlgorithms.Papers.Independent.Advance50.P43.stateDiamondComparison

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Q,BQ,BQ,B be nonzero finite-dimensional registers, MQ=dim⁡QM_Q=\dim QMQ​=dimQ, and let Φ,Ψ\Phi,\PsiΦ,Ψ be CPTP maps from QQQ to BBB. Define d1(Φ,Ψ)=sup⁡ρQ density∥Φ(ρQ)−Ψ(ρQ)∥1d_1(\Phi,\Psi)=\sup_{\rho_Q\text{ density}}\|\Phi(\rho_Q)-\Psi(\rho_Q)\|_1d1​(Φ,Ψ)=supρQ​ density​∥Φ(ρQ​)−Ψ(ρQ​)∥1​. Define the full diamond distance by maximizing the output trace norm over normalized pure inputs on Q′QQ'QQ′Q, with an untouched reference Q′≅QQ'\cong QQ′≅Q. Then

d1(Φ,Ψ)≤∥Φ−Ψ∥⋄≤2MQd1(Φ,Ψ).d_1(\Phi,\Psi)\le\|\Phi-\Psi\|_\diamond\le2M_Qd_1(\Phi,\Psi).d1​(Φ,Ψ)≤∥Φ−Ψ∥⋄​≤2MQ​d1​(Φ,Ψ).

The estimate compares state discrimination without and with an untouched reference. Both distances use the full trace norm, without a factor of one half.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P43
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Advance50.P43

open QAlgorithms.Papers.Independent.Dependency50.P45
  (holevoCapacity resourceCapacity standardEbit)

open QAlgorithms.Papers.Independent.Information100.P32 (evolution)

open QAlgorithms.Papers.Independent.Information100.P69 (replacer diamond)

open QAlgorithms.Papers.Independent.Information100.P67 (mapFirst privateCapacity)

open QAlgorithms.Papers.Independent.Information100.P22 (quantumCapacity)

open QAlgorithms.Papers.Independent.Dependency50.P23 (ordinaryClassicalCapacity)

open QAlgorithms.Papers.Independent.Information100.P34 (choi)

variable {A B C Q : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype Q]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq Q]

/-- arXiv:1905.11920v2, PDF p.6, (44), Appendix A p.8: generic channel norm
comparison, with MQ (the input dimension) in both Schmidt count and final factor.
The Appendix's printed MA labels are inconsistent with (44). -/
theorem stateDiamondComparison [Nonempty Q] [Nonempty B]
    (Phi Psi : Superop Q B)
    (hPhi : IsChannel Phi) (hPsi : IsChannel Psi) :
    stateDistance Phi Psi ≤ diamond (Phi - Psi) ∧
      diamond (Phi - Psi) ≤ 2 * (Fintype.card Q : ℝ) * stateDistance Phi Psi := by sorry

end QAlgorithms.Papers.Independent.Advance50.P43

end
Source
Quantum-capacity bounds in spin-network communication channels, arXiv:1905.11920v2, PDF p. 6, §III.B / Appendix A, Eq.(44)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For any finite nonempty types Q,BQ,BQ,B with decidable equality and any two channels Φ,Ψ\Phi,\PsiΦ,Ψ from matrices on QQQ to matrices on BBB, define

dst(Φ,Ψ)=sup⁡ρ⪰0, tr⁡ρ=1∥Φ(ρ)−Ψ(ρ)∥1,d⋄(Φ−Ψ)=sup⁡X∈Mat⁡Q×Q(C)∥X∥1≤1∥(id⁡Q⊗(Φ−Ψ))(X)∥1,d_{\mathrm{st}}(\Phi,\Psi) =\sup_{\rho\succeq0,\ \operatorname{tr}\rho=1} \|\Phi(\rho)-\Psi(\rho)\|_1, \qquad d_\diamond(\Phi-\Psi) =\sup_{\substack{X\in\operatorname{Mat}_{Q\times Q}(\mathbb C)\\ \|X\|_1\le1}} \|(\operatorname{id}_Q\otimes(\Phi-\Psi))(X)\|_1,dst​(Φ,Ψ)=ρ⪰0, trρ=1sup​∥Φ(ρ)−Ψ(ρ)∥1​,d⋄​(Φ−Ψ)=X∈MatQ×Q​(C)∥X∥1​≤1​sup​∥(idQ​⊗(Φ−Ψ))(X)∥1​,

where ∥M∥1=Re⁡tr⁡cfc⁡(⋅,M†M)\|M\|_1=\operatorname{Re}\operatorname{tr}\operatorname{cfc}(\sqrt{\cdot},M^\dagger M)∥M∥1​=Retrcfc(⋅​,M†M), and the tensor extension applies the map to each block indexed by the reference copy of QQQ. Each channel is assumed to have some finite Kraus representation Z↦∑jKjZKj†Z\mapsto\sum_jK_jZK_j^\daggerZ↦∑j​Kj​ZKj†​ satisfying ∑jKj†Kj=IQ\sum_jK_j^\dagger K_j=I_Q∑j​Kj†​Kj​=IQ​. The theorem asserts both

dst(Φ,Ψ)≤d⋄(Φ−Ψ),d⋄(Φ−Ψ)≤2∣Q∣ dst(Φ,Ψ).d_{\mathrm{st}}(\Phi,\Psi)\le d_\diamond(\Phi-\Psi), \qquad d_\diamond(\Phi-\Psi)\le2|Q|\,d_{\mathrm{st}}(\Phi,\Psi).dst​(Φ,Ψ)≤d⋄​(Φ−Ψ),d⋄​(Φ−Ψ)≤2∣Q∣dst​(Φ,Ψ).

Neither distance contains a factor 1/21/21/2; the diamond supremum includes all complex matrices of trace norm at most one, without positivity or Hermiticity restrictions. One-dimensional QQQ and BBB are included.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me