§IV, unnumbered: asymptotically tight classical preparation cost
OpenQAlgorithms.Papers.Independent.Intakenext100.P61.harmonic_classical_costLet tend to zero, and let , where . For every slack , there is , uniform over EPR supplies and deterministic classical-only preparation protocols, such that for all , unconditional squared fidelity at least requires
Equivalently, the universal asymptotic lower ratio is at least one. This interprets the printed coefficient in the asymptotically faithful regime; Lo's cited upper bound is not restated as a new theorem.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P61
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)
open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
attribute [local instance] Classical.propDecidable
/-- PDF p.8, unnumbered classical preparation bound: the printed (1-o(1))
coefficient is interpreted in the asymptotically faithful regime epsilon_n -> 0,
not at fixed nonzero error. Lo's upper bound is background, not a new assertion.
The displayed eventual bound is the universal liminf >= 1 formulation. -/
theorem harmonic_classical_cost (epsilon : ℕ → ℝ) (hzero : ∀ n, 0 ≤ epsilon n)
(hfaithful : Filter.Tendsto epsilon Filter.atTop (nhds 0)) :
∀ slack : ℝ, 0 < slack → ∃ N : ℕ, 2 ≤ N ∧ ∀ n ≥ N, ∀ (k : ℕ) (cost : ℝ),
ClassicalPrepares (eprPairs k) (harmonicState n) (epsilon n) cost →
(1 - slack) * logTwo n ≤ cost := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P61
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every sequence with for every and as , and every real slack , there exists a natural number such that, for every natural number , every natural number (including zero), and every real cost , the following implication holds. Define
Suppose an output matrix on can be obtained from by a finite classical execution of cost , and
Here has entries , and square roots use continuous functional calculus. A classical execution is generated by identity and local Kraus maps of cost zero, sequential composition with addition of costs, and either party’s finite messages as follows: a message has outcomes and local Kraus operators satisfying ; each outcome’s unnormalized branch undergoes a further classical execution, the final output is the sum of the branch outputs, and the assigned cost is , where is any real upper bound on every branch’s continuation cost. Local registers may have arbitrary finite dimensions and are identified with enumerated coordinate registers. Under these assumptions,
Here . No upper bound on individual is assumed, and the conclusion allows every , including .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.