§VII.B, Fig.6: two-use finite-block fidelity comparisons
OpenQAlgorithms.Papers.Independent.Support50.P11.two_use_fidelity_comparisonsFix exactly two parallel uses of the qutrit Werner–Holevo channel. The finite-block optimal fidelities obey
There is a positive integer for which
and for every integer ,
These are the stated two-use comparisons; the strict intersection improvement is retained existentially rather than assigning uncertified rational values from the graph.
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.11, section VII.B, Fig.6: the two-use finite-block comparisons.
The strict intersection improvement is existential, with no invented graph values. -/
theorem two_use_fidelity_comparisons :
let N := piSuperop (fun _ : Fin 2 => wernerHolevoChannel 3 1)
optimalCodeFidelity .NS N 3 = 1 ∧
(∀ K : ℕ, 4 ≤ K → optimalCodeFidelity .NS N K < optimalCodeFidelity .PPTp N K) ∧
(∃ K : ℕ, 0 < K ∧ optimalCodeFidelity .both N K < min (optimalCodeFidelity .NS N K) (optimalCodeFidelity .PPTp N K)) ∧
(∀ K : ℕ, 9 ≤ K → optimalCodeFidelity .both N K = optimalCodeFidelity .NS N K) := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , and let , acting on product matrix units by . For a positive integer , define as the real supremum of
where projects onto , and ranges over channels with for every , for some channel . For class , additionally require a channel with ; for class , additionally require to be a channel, where transposes the second factor; class imposes both additional requirements. Channels are finite Kraus maps satisfying . The assertion consists of all four statements
The existential statement specifies a positive integer without identifying it, and every comparison concerns the optimized real suprema.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.