Consequence 27
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.relative_entropy_recoveryAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Assume Conjecture 26, namely parameter monotonicity of both actual relativeEntropyDifference functionals (6.12)–(6.13), including their value at one. Let be positive definite density operators and a strict CPTP map. Define . This map is CPTP and
The relative entropy is Umegaki entropy in nats, and is squared fidelity. This retains the normalization of the headline (6.24).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF p.26, Consequence 27, (6.23)–(6.24).
Squared fidelity follows the headline; (6.26) drops a factor two by typo. -/
theorem relative_entropy_recovery (hconjecture : DifferenceParameterConjecture)
(rho sigma : Op A) (N : Superop A B)
(hrho : IsDensityMatrix rho) (hprho : rho.PosDef)
(hsigma : IsDensityMatrix sigma) (hpsigma : sigma.PosDef) (hN : StrictChannel N) :
IsChannel (petz sigma N) ∧
-extendedLog (squaredFidelity rho (petz sigma N (N rho))) ≤ (relativeEntropyDifference rho sigma N : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Assume the following global conjecture. For every pair of finite nonempty register types, every positive definite trace-one pair , and every channel whose extension sends positive definite matrices to positive definite matrices for every natural , two functions satisfy and whenever . Their common value at is
For , their definitions are
Here is spectral functional calculus with scalar value at and elsewhere, and . Under this conjecture, for every such on the particular finite registers , the map
is a channel and satisfies
A channel here means a map with a finite Kraus representation whose Kraus operators satisfy ; inverse square roots vanish on zero eigenvalues. The squared fidelity is , and for , otherwise . The inequality is in the extended reals, with the real entropy difference embedded there; a nonpositive fidelity makes its left-hand side . All logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.