Expected projected entropy and asymptotic unit efficiency
ProvedQAlgorithms.Papers.Independent.Support50.P42.expected_yieldFor a common Schmidt bias , let , let denote binary entropy in bits, and let be the entropy of this binomial law. The expected concentrated entropy before standardization is
For every , . If , then along positive . At or , the yield is zero for all . The added endpoint terms have logarithm . This gives the exact entropy loss and its asymptotically negligible fraction.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P42
open scoped BigOperators Matrix ComplexConjugate
open MeasureTheory ProbabilityTheory
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact accepted objects, without introducing same-name aliases.
open Information100.P21 (Op Vec FiniteLOCC)
open Dependency50.P42 (dimensionedPower singlets)
open Dependency50.P48 (pureFidelity)
open Gap48.P32 (pairOfState)
open Next46.P39 (rectAct)
/-- PDF p.8, Eq.(8), and p.4: expected projected entropy, exact entropy-loss
identity, logarithmic loss, and relative unit efficiency only when E>0.
The k=0,n terms added to the printed sum have log-rank zero. -/
theorem expected_yield (p : ℝ) (hp : 0≤p) (hp1 : p≤1) :
(∀ n : ℕ, projectedYield n p+
outcomeEntropy (fun k : Fin (n+1) => schmidtOutcomeWeight n p k.val)=(n : ℝ)*binEntropy2 p) ∧
(∀ n : ℕ, (n : ℝ)*binEntropy2 p-Real.logb 2 (n+1 : ℕ)≤projectedYield n p ∧
projectedYield n p≤(n : ℝ)*binEntropy2 p) ∧
(0<p → p<1 → Filter.Tendsto
(fun n : ℕ => projectedYield (n+1) p/(((n+1 : ℕ) : ℝ)*binEntropy2 p))
Filter.atTop (nhds (1 : ℝ))) ∧
(∀ n : ℕ, projectedYield n 0=0 ∧ projectedYield n 1=0) := by sorry
end QAlgorithms.Papers.Independent.Support50.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , define
and let be binary entropy in bits, using the real-logarithm convention . For every natural number , the theorem asserts
If additionally , it asserts
It also asserts, for every , . All finite-sum assertions include , when the sole weight is and the yield is ; endpoint powers use .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.