Remark II.4: converse for local unital channels
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.localUnital_converseLet be a density matrix on finite nonzero spaces, put , and fix , . Let and be local CPTP maps on and , respectively, with and . If their product channel has output within full trace norm of a normalized product state, then
The capped function is as in Proposition II.1. This extends the entropy-exchange converse to compositions of local unital channels.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite nonempty types , density matrix on , positive integer , real , and channels on and on , assume and . Here a channel is a map representable on every matrix as for a finite Kraus family satisfying . Define by , and define their local product by
where denotes the matrix unit. If there exist density matrices on and on such that , then
Here , , the canonical purification has coefficients , , and when , while otherwise. The allowed tolerances include and have no upper bound.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.