§5.3, equations (20)–(21): accessible information bounded by entropy production
OpenQAlgorithms.Papers.Independent.Support50.P41.eavesdroppingBoundLet be a countable probability law and density matrices on a nonzero finite-dimensional system. Apply one fixed unitary interaction with an initially independent pure finite environment, inducing the same channel for all . Put , and let and be the corresponding environment outputs. Every countable POVM on that environment, with preparation label and outcome , satisfies
The matrix average and conditional entropy series converge. Mutual information is a nonnegative relative-entropy sum in bits, permitting infinite marginal Shannon entropies. A measurement on part of the environment is included as a POVM on the full environment.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF pp.24--25, (20)--(21): countable preparation ensemble and countable measurement on a pure environment. -/
theorem eavesdroppingBound {K Y : Type*} [Countable K] [Countable Y]
{d e : ℕ} [NeZero d] [NeZero e]
(U : Matrix.unitaryGroup (Fin d × Fin e) ℂ)
(eta : EuclideanSpace ℂ (Fin e)) (heta : IsState eta)
(p : K → ℝ) (hp : ∀ k, 0 ≤ p k) (htotal : HasSum p 1)
(rho : K → Matrix (Fin d) (Fin d) ℂ) (hrho : ∀ k, IsDensityMatrix (rho k))
(M : Y → Matrix (Fin e) (Fin e) ℂ) (hM : IsCountablePOVM M) :
let avg := ∑' k, (p k : ℂ) • rho k
let Phi := dilationChannel U eta
let P := fun z : K × Y => p z.1 * effectProb (M z.2) (environmentOutput U eta (rho z.1))
Summable (fun k => (p k : ℂ) • rho k) ∧
Summable (fun k => p k * entropyExchange Phi (rho k)) ∧
jointInformation P ≤ ENNReal.ofReal (entropyExchange Phi avg -
∑' k, p k * entropyExchange Phi (rho k)) ∧
entropyExchange Phi avg - (∑' k, p k * entropyExchange Phi (rho k)) =
vnEntropy (environmentOutput U eta avg) -
∑' k, p k * vnEntropy (environmentOutput U eta (rho k)) ∧
entropyExchange Phi avg - (∑' k, p k * entropyExchange Phi (rho k)) ≤
entropyExchange Phi avg := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable types, let , let be unitary on , and let have norm . Let satisfy and in the sense of a convergent sum, let each be positive semidefinite with trace , and let satisfy and in the sense of a convergent matrix sum. Put , , , , and . Define , using continuous functional calculus and , and , where . For real , define the extended nonnegative quantity to be if , if and , and otherwise, where ; set . Then the matrix family and the real family are summable, and
Finite and infinite countable types are included; empty or cannot satisfy the respective normalization hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.