Proposition 10: n+1-variable Werner–Holevo fidelity LP
OpenQAlgorithms.Papers.Independent.Support50.P11.werner_fidelity_linear_programFix integers , , , and independent flags selecting NS and PPTp. Let be the explicit coefficients of (A3) and the partial-trace formula. The operational optimum is the attained linear-program maximum
subject to for every , and
A feasible maximizing vector exists and dominates every other feasible objective. Both flags impose both constraints; neither flag gives the unrestricted forward-assisted class. Integer powers retain at the two endpoints of .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.14, Proposition 10, (A4)--(A8): attained n+1-variable LP equals the
operational optimum, with NS/PPTp flags independent and neither flag giving FA. -/
theorem werner_fidelity_linear_program
(d n K : ℕ) (hd : 2 ≤ d) (hn : 0 < n) (hK : 0 < K)
(alpha : ℝ) (ha0 : 0 ≤ alpha) (ha1 : alpha ≤ 1) (s p : Bool) :
∃ x : Fin (n + 1) → ℝ, WernerLPFeasible d n K s p x ∧
optimalCodeFidelity (flagsClass s p) (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) K = lpObjective d n alpha x ∧
(∀ y, WernerLPFeasible d n K s p y → lpObjective d n alpha y ≤ lpObjective d n alpha x) := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every satisfying , , and , every real , and arbitrary Boolean flags , let and , where
For , put
Call a real vector feasible when for every , when implies , and when implies for every . Define
There exists a feasible such that equals the following supremum of code fidelities and for every feasible real vector . The supremum ranges over maps from matrices on to matrices on satisfying these requirements: is a channel; there is a channel such that for every ; if is true, there is also a channel such that for every ; and if is true, is a channel, with . Here a channel means a finite Kraus map with . The fidelity assigned to is
Thus a false flag contributes no additional condition. The formulas include and , with zeroth powers interpreted as .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.