Corollary 4: optimal channel fidelity is the primal SDP
ProvedQAlgorithms.Papers.Independent.Support50.P11.optimal_fidelity_primal_sdpLet be a finite CPTP channel and . Select NS, PPTp, or their intersection using flags with at least one true. Let consist of density matrices and operators satisfying , together with when is true and when is true. For the unnormalized Choi matrix ,
There is a maximizing feasible pair, and an actual code in the selected class attains the same value. The objective is linear and the constraints are affine equalities and PSD inequalities, giving the stated SDP. At its optimum is one.
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
section Statements
variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]
/-- PDF p.7, Corollary 4: equality with the operational optimum and an attained
primal maximum, for each of NS, PPTp and their intersection, including K=1. -/
theorem optimal_fidelity_primal_sdp
(N : Superop I O) (hN : IsChannel N) (K : ℕ) (hK : 0 < K)
(s p : Bool) (hflags : s = true ∨ p = true) :
∃ rho : Matrix I I ℂ, ∃ L : Matrix (I × O) (I × O) ℂ,
Primal K s p rho L ∧ optimalCodeFidelity (flagsClass s p) N K = primalObjective N L ∧
(∀ rho2 L2, Primal K s p rho2 L2 → primalObjective N L2 ≤ primalObjective N L) ∧
(∃ Z : Superop (Fin K × O) (I × Fin K),
IsForwardCode K (flagsClass s p) Z ∧
channelFidelity K (link K N Z) = primalObjective N L) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types , with their required finite structures and decidable equality, every channel , every natural number , and Boolean flags with at least one true, the assertion supplies matrices on and on satisfying the conditions below. Here a channel is a function with a finite Kraus representation for all matrices and ; means is positive semidefinite; and transposes the second register, . The required matrix conditions are
Put and , using ordinary transpose. A permitted forward code is a channel satisfying, for some channel , for every ; when is true it additionally satisfies for every , for some channel , and when is true the function is a channel. For such a , define
and its score
The theorem states simultaneously that the real supremum of over all permitted codes is , that every pair satisfying the same matrix conditions has , and that some permitted code actually has . It does not require this attaining code’s average input to equal the particular supplied in the conclusion. The statement includes without a separate branch and excludes only the choice in which both flags are false.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.