Remark 11: recycling fidelity upper bound
ProvedQAlgorithms.Papers.Independent.Extend50.P04.nonoptimal_le_oneLet be the number of ports and their local dimension. Each initial port is the normalized Bell vector . On Alice's ports and input, let , , (inverse zero on the kernel), , and . Write for the swap of port and input, transposed only on input in the computational basis. Here is the Born-weighted average of the unsquared absolute overlaps of normalized whole output branches with the ideal state, retaining the teleported Bell pair and all unused ports. The measurement instrument is ; uses identity resource operations. The one-round unoptimized recycling fidelity satisfies
The uniform full-effect trace used in the source proof is a consequence, not an assumption.
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P04
noncomputable section
namespace QAlgorithms.Papers.Independent.Extend50.P04
open QAlgorithms
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable
/-- PDF pp.14-15, Remark 11, (77): the actual operational fidelity is at most one.
Uniform POVM traces are derived by the paper, not assumed as a hypothesis. -/
theorem nonoptimal_le_one (d n : ℕ) (hd : 2 ≤ d) :
nonoptimalFidelity d n ≤ 1 := by sorry
end QAlgorithms.Papers.Independent.Extend50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers satisfying , put and index matrices by pairs , where and . Define
where is applied by real continuous functional calculus. Define vectors on the product of two copies of this index set by
and put , with matrix square root given by continuous functional calculus with the real square-root function. The theorem asserts
The norms are Euclidean norms, and the inner-product factor is its complex modulus rather than its squared modulus. All reciprocals are total with , so a zero branch contributes zero; real square root is zero on negative arguments. The assertion includes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.