Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§IV, unnumbered: logarithmic quantum preparation lower bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.harmonic_quantum_cost

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

prove2quantum

Fix 0≤ε<1/40\le\varepsilon<1/40≤ε<1/4 and put δ=(4ε)1/8\delta=(4\varepsilon)^{1/8}δ=(4ε)1/8. Let ∣μn⟩=Hn−1/2∑i=1ni−1/2∣i,i⟩|\mu_n\rangle=H_n^{-1/2}\sum_{i=1}^ni^{-1/2}|i,i\rangle∣μn​⟩=Hn−1/2​∑i=1n​i−1/2∣i,i⟩, where Hn=∑i=1n1/iH_n=\sum_{i=1}^n1/iHn​=∑i=1n​1/i. There are K>0K>0K>0 and N≥4N\ge4N≥4, chosen before nnn, the finite EPR supply and the protocol, such that every deterministic quantum protocol preparing μn\mu_nμn​ with squared fidelity at least 1−ε1-\varepsilon1−ε satisfies

C≥(12−δ)log⁡2n−Klog⁡2log⁡2n(n≥N).C\ge(\tfrac12-\delta)\log_2 n-K\log_2\log_2 n\qquad(n\ge N).C≥(21​−δ)log2​n−Klog2​log2​n(n≥N).

The constants may depend on the fixed error. The leading coefficient is positive in the smaller regime δ<1/2\delta<1/2δ<1/2.

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.8, unnumbered quantum preparation bound: for each fixed epsilon,
the O(log log n) constant and threshold are uniform over every EPR supply and
protocol. The leading coefficient is positive when delta<1/2. -/
theorem harmonic_quantum_cost (epsilon : ℝ) (hzero : 0 ≤ epsilon) (hsmall : epsilon < 1 / 4) :
    ∃ K : ℝ, 0 < K ∧ ∃ N : ℕ, 4 ≤ N ∧ ∀ n ≥ N, ∀ (k : ℕ) (cost : ℝ),
      QuantumPrepares (eprPairs k) (harmonicState n) epsilon cost →
      (1 / 2 - smoothingError epsilon) * logTwo n - K * logTwo (logTwo 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. 8, §IV, unnumbered: logarithmic quantum preparation lower bound
Read-back

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

For every real ϵ\epsilonϵ satisfying 0≤ϵ<1/40\le\epsilon<1/40≤ϵ<1/4, there exist a real K>0K>0K>0 and a natural number N≥4N\ge4N≥4 such that, for every natural number n≥Nn\ge Nn≥N, every natural number kkk (including k=0k=0k=0), and every real cost ccc, the following holds. Let

∣Ek⟩=2−k/2∑j=02k−1∣j,j⟩,Hn=∑i=1n1i,∣hn⟩=∑j=0n−1∣j,j⟩(j+1)Hn.|E_k\rangle=2^{-k/2}\sum_{j=0}^{2^k-1}|j,j\rangle,\qquad H_n=\sum_{i=1}^{n}\frac1i,\qquad |h_n\rangle=\sum_{j=0}^{n-1}\frac{|j,j\rangle}{\sqrt{(j+1)H_n}}.∣Ek​⟩=2−k/2j=0∑2k−1​∣j,j⟩,Hn​=i=1∑n​i1​,∣hn​⟩=j=0∑n−1​(j+1)Hn​​∣j,j⟩​.

Suppose there is an output matrix σ\sigmaσ on Cn⊗Cn\mathbb C^n\otimes\mathbb C^nCn⊗Cn obtainable from ∣Ek⟩⟨Ek∣|E_k\rangle\langle E_k|∣Ek​⟩⟨Ek​∣ by the following finite execution rules: identity and local maps X↦∑jKjXKj†X\mapsto\sum_j K_jXK_j^\daggerX↦∑j​Kj​XKj†​, with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, cost zero; transferring a register of any positive integer dimension mmm from either party to the other costs log⁡2m\log_2mlog2​m; and sequential executions have their costs added. Finite registers are identified with enumerated coordinate registers, and the execution must have exactly the reported cost ccc. Suppose also that

F(σ,∣hn⟩⟨hn∣)≥1−ϵ,F(X,Y)=(Re⁡tr⁡X Y X)2,F(\sigma,|h_n\rangle\langle h_n|)\ge1-\epsilon, \qquad F(X,Y)=\left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt X\,Y\,\sqrt X}\right)^2,F(σ,∣hn​⟩⟨hn​∣)≥1−ϵ,F(X,Y)=(RetrX​YX​​)2,

where matrix square roots are given by continuous functional calculus and ∣v⟩⟨v∣|v\rangle\langle v|∣v⟩⟨v∣ has entries vivj‾v_i\overline{v_j}vi​vj​​. Then

(12−(4ϵ)1/8)log⁡2n−Klog⁡2(log⁡2n)≤c.\left(\frac12-(4\epsilon)^{1/8}\right)\log_2n -K\log_2(\log_2n)\le c.(21​−(4ϵ)1/8)log2​n−Klog2​(log2​n)≤c.

Here log⁡2x=log⁡x/log⁡2\log_2x=\log x/\log2log2​x=logx/log2; the hypothesis includes ϵ=0\epsilon=0ϵ=0, and it does not require the coefficient 12−(4ϵ)1/8\frac12-(4\epsilon)^{1/8}21​−(4ϵ)1/8 to be positive.

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