Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordinary recovery fidelity and an optimal product recovery

Open
QAlgorithms.Papers.Independent.Intakenext100.P75.ordinaryRecovery_product_optimum

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

prove2quantum

For density operators ρABC\rho_{ABC}ρABC​ and τA′B′C′\tau_{A'B'C'}τA′B′C′​ on arbitrary finite-dimensional nonzero complex systems, define F(A;B∣C)ρ=sup⁡ΓF(ρABC,(idB⊗Γ)(ρBC))F(A;B|C)_\rho=\sup_\Gamma F(\rho_{ABC},(\mathrm{id}_B\otimes\Gamma)(\rho_{BC}))F(A;B∣C)ρ​=supΓ​F(ρABC​,(idB​⊗Γ)(ρBC​)), where Γ:C→AC\Gamma:C\to ACΓ:C→AC is CPTP and FFF is squared fidelity. Then

F(AA′;BB′∣CC′)ρ⊗τ=F(A;B∣C)ρF(A′;B′∣C′)τ.F(AA';BB'|CC')_{\rho\otimes\tau}=F(A;B|C)_\rho F(A';B'|C')_\tau.F(AA′;BB′∣CC′)ρ⊗τ​=F(A;B∣C)ρ​F(A′;B′∣C′)τ​.

There exist optimal individual CPTP maps Γ:C→AC\Gamma:C\to ACΓ:C→AC and Λ:C′→A′C′\Lambda:C'\to A'C'Λ:C′→A′C′ whose product Γ⊗Λ\Gamma\otimes\LambdaΓ⊗Λ is an optimal joint recovery for ρ⊗τ\rho\otimes\tauρ⊗τ. The joint optimization still ranges over every joint CPTP map. This gives an attained product optimum without asserting that every optimizer has product form.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P75
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P75

open scoped Matrix ComplexOrder

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)

variable {A B C D Ap Bp Cp R I J K L : Type}

variable [Fintype A] [DecidableEq A] [Nonempty A]

variable [Fintype B] [DecidableEq B] [Nonempty B]

variable [Fintype C] [DecidableEq C] [Nonempty C]

variable [Fintype D] [DecidableEq D] [Nonempty D]

variable [Fintype Ap] [DecidableEq Ap] [Nonempty Ap]

variable [Fintype Bp] [DecidableEq Bp] [Nonempty Bp]

variable [Fintype Cp] [DecidableEq Cp] [Nonempty Cp]

variable [Fintype R] [DecidableEq R] [Nonempty R]

/-- PDF p.2, (7) and following sentence: ordinary FoR is multiplicative
and SOME optimal joint recovery is a product of optimal individual maps. -/
theorem ordinaryRecovery_product_optimum
    [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty Ap] [Nonempty Bp] [Nonempty Cp] (rho : Mat (B × (A × C)))
    (tau : Mat (Bp × (Ap × Cp))) (hrho : IsDensityMatrix rho) (htau : IsDensityMatrix tau) :
    ordinaryRecovery (ordinaryTensor rho tau) = ordinaryRecovery rho * ordinaryRecovery tau ∧
    ∃ f : Superop C (A × C), ∃ g : Superop Cp (Ap × Cp),
      IsChannel f ∧ IsChannel g ∧ IsChannel (productRecovery f g) ∧
      fidelity rho (recovered rho f) = ordinaryRecovery rho ∧
      fidelity tau (recovered tau g) = ordinaryRecovery tau ∧
      fidelity (ordinaryTensor rho tau)
        (recovered (ordinaryTensor rho tau) (productRecovery f g)) =
          ordinaryRecovery (ordinaryTensor rho tau) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P75
Source
The Fidelity of Recovery is Multiplicative, arXiv:1502.07973v2, PDF p. 2, Introduction, (7) and following sentence
Read-back

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

Let A,B,C,A′,B′,C′A,B,C,A',B',C'A,B,C,A′,B′,C′ be finite nonempty types with decidable equality, and let ρ,τ\rho,\tauρ,τ be positive semidefinite trace-one matrices on B×(A×C)B\times(A\times C)B×(A×C) and B′×(A′×C′)B'\times(A'\times C')B′×(A′×C′). Define F(X,Y)=(Re⁡tr⁡X Y X)2F(X,Y)=(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\,\sqrt X})^2F(X,Y)=(RetrX​YX​​)2, ρBC(b,c),(b′,c′)=∑aρ(b,(a,c)),(b′,(a,c′))\rho_{BC}{}_{(b,c),(b',c')}=\sum_a\rho_{(b,(a,c)),(b',(a,c'))}ρBC​(b,c),(b′,c′)​=∑a​ρ(b,(a,c)),(b′,(a,c′))​, and

O(ρ)=sup⁡fF(ρ,(id⁡B⊗f)(ρBC)),O(\rho)=\sup_f F\bigl(\rho,(\operatorname{id}_B\otimes f)(\rho_{BC})\bigr),O(ρ)=fsup​F(ρ,(idB​⊗f)(ρBC​)),

where f:C→A×Cf:C\to A\times Cf:C→A×C ranges over finite Kraus channels, meaning maps ∑jKjXKj†\sum_jK_jXK_j^\dagger∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I; define O(τ)O(\tau)O(τ) similarly. Let ρ⊠τ\rho\boxtimes\tauρ⊠τ be their tensor product reordered onto (B×B′)×((A×A′)×(C×C′))(B\times B')\times((A\times A')\times(C\times C'))(B×B′)×((A×A′)×(C×C′)), so each entry is the product of the corresponding entries of ρ,τ\rho,\tauρ,τ. Then O(ρ⊠τ)=O(ρ)O(τ)O(\rho\boxtimes\tau)=O(\rho)O(\tau)O(ρ⊠τ)=O(ρ)O(τ), and there exist channels f:C→A×Cf:C\to A\times Cf:C→A×C and g:C′→A′×C′g:C'\to A'\times C'g:C′→A′×C′ attaining the two individual suprema. Their product map, obtained by tensoring f,gf,gf,g on matrix units and regrouping the output as (A×A′)×(C×C′)(A\times A')\times(C\times C')(A×A′)×(C×C′), is also a channel and attains O(ρ⊠τ)O(\rho\boxtimes\tau)O(ρ⊠τ).

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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