Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II, unnumbered: linear exact dilution lower bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.exact_dilution_linear

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

prove2quantum

Fix complex amplitudes α,β\alpha,\betaα,β with ∣α∣2+∣β∣2=1|\alpha|^2+|\beta|^2=1∣α∣2+∣β∣2=1, 0<∣α∣2<10<|\alpha|^2<10<∣α∣2<1, and ∣α∣2≠1/2|\alpha|^2\ne1/2∣α∣2=1/2. Write ψ=α∣00⟩+β∣11⟩\psi=\alpha|00\rangle+\beta|11\rangleψ=α∣00⟩+β∣11⟩. There are constants c>0c>0c>0 and NNN such that, for every n≥Nn\ge Nn≥N, every supply of EPR pairs and every exact deterministic quantum protocol producing ψ⊗n\psi^{\otimes n}ψ⊗n, its communication cost satisfies

C≥cn.C\ge c n.C≥cn.

The constants may depend on the fixed amplitudes, and precede the block size and protocol. This is the linear exact-error contrast to approximate dilution.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
Formal statement
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.3, unnumbered exact dilution bound: nonzero unequal Schmidt weights.
The asymptotic constants precede n, the EPR supply and every protocol. -/
theorem exact_dilution_linear (alpha beta : ℂ)
    (hnorm : Complex.normSq alpha + Complex.normSq beta = 1)
    (hpositive : 0 < Complex.normSq alpha) (hbelow : Complex.normSq alpha < 1)
    (hnonflat : Complex.normSq alpha ≠ 1 / 2) :
    ∃ c : ℝ, 0 < c ∧ ∃ N : ℕ, ∀ n ≥ N, ∀ (k : ℕ) (cost : ℝ),
      Quantum (pureDensity (eprPairs k)) (pureDensity (pureStateCopies (binaryState alpha beta) n)) cost →
      c * (n : ℝ) ≤ cost := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 3, §II, unnumbered: linear exact dilution lower bound
Read-back

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

For complex numbers α,β\alpha,\betaα,β satisfying ∣α∣2+∣β∣2=1|\alpha|^2+|\beta|^2=1∣α∣2+∣β∣2=1, 0<∣α∣2<10<|\alpha|^2<10<∣α∣2<1, and ∣α∣2≠1/2|\alpha|^2\neq1/2∣α∣2=1/2, there exist a real c>0c>0c>0 and a natural number NNN such that, for every natural n≥Nn\geq Nn≥N, every natural kkk, and every real cost\mathrm{cost}cost, the following holds. Define

ek=2−k/2∑j=02k−1∣j,j⟩,v=α∣false,false⟩+β∣true,true⟩,v(n)(x,y)=∏j=0n−1v(xj,yj).e_k=2^{-k/2}\sum_{j=0}^{2^k-1}|j,j\rangle, \qquad v=\alpha|\mathrm{false},\mathrm{false}\rangle+ \beta|\mathrm{true},\mathrm{true}\rangle, \qquad v^{(n)}(x,y)=\prod_{j=0}^{n-1}v(x_j,y_j).ek​=2−k/2j=0∑2k−1​∣j,j⟩,v=α∣false,false⟩+β∣true,true⟩,v(n)(x,y)=j=0∏n−1​v(xj​,yj​).

If the matrix v(n)(v(n))†v^{(n)}(v^{(n)})^\daggerv(n)(v(n))† can be obtained exactly from ekek†e_ke_k^\daggerek​ek†​ by a finite sequence of local Kraus maps with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I and transfers of tensor factors between the parties, each transferred factor of positive dimension mmm costing log⁡2m=log⁡m/log⁡2\log_2m=\log m/\log2log2​m=logm/log2, with accumulated cost exactly cost\mathrm{cost}cost, then cn≤costcn\leq\mathrm{cost}cn≤cost. The quantifier over kkk includes k=0k=0k=0, when eke_kek​ is the one-dimensional unit vector; zero copies likewise use an empty product equal to 111, if n=0n=0n=0 lies in the asserted range.

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