§6.2, equations (24)–(25): quantum Fano inequality
ProvedQAlgorithms.Papers.Independent.Support50.P41.quantumFanoLet be a complex-linear completely positive trace-preserving map on a -dimensional system, , and let be any normalized purification of a density matrix . Write and for the entropy of this joint output. Entropies and are in bits. For ,
For , and . This relates entanglement preservation to entropy exchange.
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.26--27, (24)--(25): quantum Fano inequality; the singleton branch avoids log zero. -/
theorem quantumFano {d a : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
(psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi) :
(d = 1 → purificationFidelity psi Phi = 1 ∧ entropyExchange Phi rho = 0) ∧
(2 ≤ d → entropyExchange Phi rho ≤ binEntropy2 (purificationFidelity psi Phi) +
(1 - purificationFidelity psi Phi) * Real.logb 2 ((d : ℝ)^2 - 1)) ∧
entropyExchange Phi rho ≤ 1 + 2*(1-purificationFidelity psi Phi)*Real.logb 2 d := 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 and be integers, and let be complex linear, trace preserving on every matrix, and completely positive, meaning that preserves positive semidefiniteness for every integer . Let be positive semidefinite with , and let satisfy and . Write , , and , where is the canonical purification with coefficients , expressed through the fixed enumeration of the input basis, and for the spectral function , with . Here applies separately to each block indexed by the reference basis. Then implies and ; implies
and in every case , where , with zero logarithmic terms interpreted as zero. Although is quantified over, no unit vector exists in that case.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.