Fawzi–Renner lower bound in bits
OpenQAlgorithms.Papers.Independent.Intakenext100.P75.fawziRennerLet be any density operator on finite-dimensional nonzero complex systems. Let be the maximum squared fidelity with states recovered from by an arbitrary CPTP map , acting identically on . Then
The conditional mutual information is with entropy in bits. The negative logarithm at zero is interpreted as . This is Theorem 5, reproved operationally in this paper, with no full-rank or Markov-state restriction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P75
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]
/-- Theorem 5, PDF p.6, (37), proved through p.7, (47): Fawzi–Renner
in bits. Extended negative log at zero is +infinity. -/
theorem fawziRenner
[Nonempty A] [Nonempty B] [Nonempty C] (rho : Mat (B × (A × C))) (hrho : IsDensityMatrix rho) :
(if ordinaryRecovery rho = 0 then (⊤ : EReal)
else ((-Real.logb 2 (ordinaryRecovery rho) : ℝ) : EReal)) ≤ (conditionedLastCMIBits rho : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P75
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty types with decidable equality and every positive semidefinite trace-one matrix on , define and
where the supremum ranges over maps admitting finite Kraus representations with . Then
as an inequality in the extended real numbers. The marginals use the displayed register ordering after rearranging to , and is defined by spectral functional calculus with . In particular, the zero-recovery case is explicitly assigned on the left.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.