Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark II.4: converse for local unital channels

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.localUnital_converse

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a density matrix on finite nonzero spaces, put d=dAdBd=d_Ad_Bd=dA​dB​, and fix n≥1n\ge1n≥1, ϵ≥0\epsilon\ge0ϵ≥0. Let FFF and GGG be local CPTP maps on A⊗nA^{\otimes n}A⊗n and B⊗nB^{\otimes n}B⊗n, respectively, with F(1)=1F(\mathbf1)=\mathbf1F(1)=1 and G(1)=1G(\mathbf1)=\mathbf1G(1)=1. If their product channel T=F⊗GT=F\otimes GT=F⊗G has output within full trace norm ϵ\epsilonϵ of a normalized product state, then

Se(T,ρ⊗n)≥n(I(A:B)ρ−3ϵlog⁡2d−η(3ϵ)).S_e(T,\rho^{\otimes n})\ge n\bigl(I(A:B)_\rho-3\epsilon\log_2d-\eta(3\epsilon)\bigr).Se​(T,ρ⊗n)≥n(I(A:B)ρ​−3ϵlog2​d−η(3ϵ)).

The capped function η\etaη is as in Proposition II.1. This extends the entropy-exchange converse to compositions of local unital channels.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P47

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)

open scoped Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.5, Remark II.4: literal identity-preserving local CPTP maps. -/
theorem localUnital_converse {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
    (hrho : IsDensityMatrix rho) (n : ℕ) (hn : 0 < n) (eps : ℝ) (heps : 0 ≤ eps)
    (F : Superop (Copies A n) (Copies A n)) (G : Superop (Copies B n) (Copies B n))
    (hF : IsChannel F) (hG : IsChannel G) (hF1 : F 1 = 1) (hG1 : G 1 = 1)
    (hdec : Decorrelates (localProduct F G (sourcePower rho n)) eps) :
    (n : ℝ) * (mutualInformation rho - 3*eps*logDimension A B - erasureEta (3*eps)) ≤
      entropyExchange (localProduct F G) (sourcePower rho n) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P47

end
Source
On the quantum, classical and total amount of correlations in a quantum state, arXiv:quant-ph/0410091v2, PDF p. 5, Remark II.4: converse for local unital channels
Read-back

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

For any finite nonempty types A,BA,BA,B, density matrix ρ\rhoρ on A×BA\times BA×B, positive integer nnn, real ε≥0\varepsilon\ge0ε≥0, and channels FFF on AnA^nAn and GGG on BnB^nBn, assume F(1)=1F(1)=1F(1)=1 and G(1)=1G(1)=1G(1)=1. Here a channel is a map representable on every matrix as X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ for a finite Kraus family satisfying ∑jKj†Kj=1\sum_jK_j^\dagger K_j=1∑j​Kj†​Kj​=1. Define ρn\rho_nρn​ by (ρn)(a,b),(a′,b′)=∏t=0n−1ρ(at,bt),(at′,bt′)(\rho_n)_{(a,b),(a',b')}=\prod_{t=0}^{n-1}\rho_{(a_t,b_t),(a'_t,b'_t)}(ρn​)(a,b),(a′,b′)​=∏t=0n−1​ρ(at​,bt​),(at′​,bt′​)​, and define their local product Φ\PhiΦ by

Φ(X)(u,v),(u′,v′)=∑a,a′,b,b′X(a,b),(a′,b′) F(Eaa′)u,u′ G(Ebb′)v,v′,\Phi(X)_{(u,v),(u',v')} =\sum_{a,a',b,b'}X_{(a,b),(a',b')}\, F(E_{aa'})_{u,u'}\,G(E_{bb'})_{v,v'},Φ(X)(u,v),(u′,v′)​=a,a′,b,b′∑​X(a,b),(a′,b′)​F(Eaa′​)u,u′​G(Ebb′​)v,v′​,

where Eaa′E_{aa'}Eaa′​ denotes the matrix unit. If there exist density matrices α\alphaα on AnA^nAn and β\betaβ on BnB^nBn such that ∥Φ(ρn)−α⊗β∥1≤ε\|\Phi(\rho_n)-\alpha\otimes\beta\|_1\le\varepsilon∥Φ(ρn​)−α⊗β∥1​≤ε, then

n(I(ρ)−3εlog⁡2(∣A∣∣B∣)−η(3ε))≤H ⁣((id⊗Φ)(∣ρn⟩⟨ρn∣)).n\left(I(\rho)-3\varepsilon\log_2(|A||B|)-\eta(3\varepsilon)\right) \le H\!\left((\mathrm{id}\otimes\Phi)(|\sqrt{\rho_n}\rangle\langle\sqrt{\rho_n}|)\right).n(I(ρ)−3εlog2​(∣A∣∣B∣)−η(3ε))≤H((id⊗Φ)(∣ρn​​⟩⟨ρn​​∣)).

Here I(ρ)=H(Tr⁡Bρ)+H(Tr⁡Aρ)−H(ρ)I(\rho)=H(\operatorname{Tr}_B\rho)+H(\operatorname{Tr}_A\rho)-H(\rho)I(ρ)=H(TrB​ρ)+H(TrA​ρ)−H(ρ), H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X), the canonical purification has coefficients (X)ji(\sqrt X)_{j i}(X​)ji​, ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​, and η(x)=−xlog⁡2x\eta(x)=-x\log_2xη(x)=−xlog2​x when x≤e−1x\le e^{-1}x≤e−1, while η(x)=e−1log⁡2e\eta(x)=e^{-1}\log_2eη(x)=e−1log2​e otherwise. The allowed tolerances include 000 and have no upper bound.

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