Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III: no-entanglement upper bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.no_entanglement_upper_bound

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For D≥1D\ge1D≥1 and 0<ε≤10<\varepsilon\le10<ε≤1, there exists a single one-way remote-preparation protocol for all pure targets in CD\mathbb C^DCD, with shared Schmidt rank one and a finite message alphabet of size KKK, such that

log⁡2K≤(4+log⁡2(1/ε))D,Tr⁡(ψ ρ~ψ)≥1−εfor every pure ψ.\log_2K\le\bigl(4+\log_2(1/\varepsilon)\bigr)D,\qquad \operatorname{Tr}(\psi\,\widetilde\rho_\psi)\ge1-\varepsilon\quad\hbox{for every pure }\psi.log2​K≤(4+log2​(1/ε))D,Tr(ψρ​ψ​)≥1−εfor every pure ψ.

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
Formal statement
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
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 4, Section III: no-entanglement upper bound
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number D>0D>0D>0 and every real 0<ε≤10<\varepsilon\le10<ε≤1, there exists a code with S=1S=1S=1, a positive integer KKK, inputs all unit vectors ψ∈CD\psi\in\mathbb C^Dψ∈CD, positive semidefinite 1×11\times11×1 effect matrices Eψ,jE_{\psi,j}Eψ,j​ summing to 111 for each ψ\psiψ, and decoder maps Dj:C1×1→CD×D\mathcal D_j:\mathbb C^{1\times1}\to\mathbb C^{D\times D}Dj​:C1×1→CD×D admitting finite Kraus representations Dj(X)=∑ℓAj,ℓXAj,ℓ†\mathcal D_j(X)=\sum_\ell A_{j,\ell}XA_{j,\ell}^{\dagger}Dj​(X)=∑ℓ​Aj,ℓ​XAj,ℓ†​ with ∑ℓAj,ℓ†Aj,ℓ=1\sum_\ell A_{j,\ell}^{\dagger}A_{j,\ell}=1∑ℓ​Aj,ℓ†​Aj,ℓ​=1, such that

log⁡2K≤(4+log⁡2(1/ε))D,∀ψ,1−ε≤Re⁡Tr⁡ ⁣(ψψ†∑j=0K−1Dj(Eψ,jT)).\log_2K\le\bigl(4+\log_2(1/\varepsilon)\bigr)D, \qquad \forall\psi,\quad 1-\varepsilon\le \operatorname{Re}\operatorname{Tr}\!\left( \psi\psi^\dagger\sum_{j=0}^{K-1}\mathcal D_j(E_{\psi,j}^{\mathsf T}) \right).log2​K≤(4+log2​(1/ε))D,∀ψ,1−ε≤ReTr(ψψ†j=0∑K−1​Dj​(Eψ,jT​)).

The quantifier over ψ\psiψ includes every norm-one complex vector, and both boundary cases D=1D=1D=1 and ε=1\varepsilon=1ε=1 are included.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me