Proposition 6: PPTp fidelity over a Horodecki channel
ProvedQAlgorithms.Papers.Independent.Support50.P11.horodecki_ppt_fidelityLet be a channel between positive finite-dimensional systems whose Choi matrix has positive partial transpose, and let . For actual forward-assisted PPT-preserving codes, the optimal normalized entanglement fidelity is
The claim is about the optimum over codes. It includes the scalar case , and forward classical assistance is permitted in this class.
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.8, Proposition 6: the optimal PPTp channel fidelity over a Horodecki
channel is 1/K, not the optimalCodeFidelity of every individual code. -/
theorem horodecki_ppt_fidelity
(N : Superop I O) (hN : Horodecki N) (K : ℕ) (hK : 0 < K) :
optimalCodeFidelity .PPTp N K = 1 / (K : ℝ) := 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 input and output index types , let have a finite Kraus representation with , and suppose that the partial transpose of its unnormalized matrix , defined by , is positive semidefinite. For every positive integer , the real supremum of the code fidelities described below equals . The codes are channels , where denotes the index set , such that is also a channel and there exists a channel with for every matrix ; here . Their linked maps are
and their fidelities are , with and . Every occurrence of “channel” means a finite Kraus representation with the stated completeness identity; the conclusion includes , when the supremum equals .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.