Section III: no-entanglement upper bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P54.no_entanglement_upper_boundFor and , there exists a single one-way remote-preparation protocol for all pure targets in , with shared Schmidt rank one and a finite message alphabet of size , such that
Alice knows the target; Bob's CPTP decoders depend only on the announced message. This is the unaffected no-entanglement upper-bound clause of Theorem 8.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal
open MeasureTheory ProbabilityTheory
namespace QAlgorithms.Papers.Independent.Intakenext100.P54
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
/-- Section III, second clause of Theorem 8, PDF pp.4–5. No entanglement is used, and
every pure input has squared fidelity at least 1-eps. -/
theorem no_entanglement_upper_bound (D : ℕ) (hD : 0 < D)
(eps : ℝ) (heps : 0 < eps) (hepsOne : eps ≤ 1) :
∃ P : RSPCode (RSPVector (Fin D)) (Fin D), P.S = 1 ∧
Real.logb 2 P.K ≤ (4 + Real.logb 2 (1 / eps)) * D ∧
∀ psi : RSPVector (Fin D),
1 - eps ≤ (pureDensity psi.val * P.output psi).trace.re := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P54
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every real , there exists a code with , a positive integer , inputs all unit vectors , positive semidefinite effect matrices summing to for each , and decoder maps admitting finite Kraus representations with , such that
The quantifier over includes every norm-one complex vector, and both boundary cases and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.