Alberti variational infimum for generalized recovery fidelity
OpenQAlgorithms.Papers.Independent.Intakenext100.P75.recovery_alberti_infimumLet and be density operators on finite-dimensional nonzero complex systems, and let be any pure-state purification of . Write . With squared Uhlmann fidelity and optimization over every local CPTP recovery map, one has
The tensor factors in the operator inequality are canonically reordered onto . This variational value is useful for multiplicativity. No invertibility of the density operators or full Schmidt rank is assumed.
Formalization Note The printed minimum is corrected to an infimum: orthogonal pure states give zero value without any strictly positive feasible pair attaining zero. Lean states the greatest-lower-bound property.
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]
/-- Lemma 1, PDF pp.2–4, (10),(25), with the source correction:
printed minimum over strict positive matrices is an infimum at singular inputs.
No full-rank or full-Schmidt-rank assumption is imposed. -/
theorem recovery_alberti_infimum
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] (rho : Mat (A × B)) (sigma : Mat (A × C))
(purification : Mat ((A × C) × D))
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hpure : IsPure purification) (hmarginal : traceRight purification = sigma) :
IsGLB {v : ℝ | ∃ r : Mat (A × B), ∃ q : Mat (A × D),
r.PosDef ∧ q.PosDef ∧
((Matrix.of fun x y : (A × B) × D =>
q (x.1.1, x.2) (y.1.1, y.2) * (1 : Mat B) x.1.2 y.1.2) -
Matrix.kronecker r (1 : Mat D)).PosSemidef ∧ v = (rho * r⁻¹).trace.re * (marginalAD purification * q).trace.re}
(generalizedRecoveryFidelity rho sigma) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P75
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, let and be positive semidefinite trace-one matrices on and , and let be a matrix on of the form for a unit vector , with . Put . Define , and let be the supremum of over maps having finite Kraus representations with . Then is the greatest lower bound of
where acts on , acts on , positive definiteness is denoted by , and . The conclusion specifies a greatest lower bound and does not assert that a feasible pair attains it.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.