Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§3.2, p. 17 — along a B-Chebyshev cooling schedule, |⟨π_i|π_{i+1}⟩|² ≥ 1/B for all i

Proved
QuantumMC.Cooling.overlap_ge_inv_B

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

cooling-schedulegibbs-distributionoverlapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partition-functionquantum-sample

Let Ω\OmegaΩ be a finite set of configurations and H:Ω→{0,1,…,n}H:\Omega\to\{0,1,\dots,n\}H:Ω→{0,1,…,n} a Hamiltonian with at least one configuration of energy 000. Let Z(β)=∑xe−βH(x)Z(\beta)=\sum_{x}e^{-\beta H(x)}Z(β)=∑x​e−βH(x) be its partition function and let 0=β0<β1<⋯<βℓ=∞0=\beta_0<\beta_1<\dots<\beta_\ell=\infty0=β0​<β1​<⋯<βℓ​=∞ be a BBB-Chebyshev cooling schedule for ZZZ (Definition 1). For each iii let πi(x)=e−βiH(x)/Z(βi)\pi_i(x)=e^{-\beta_iH(x)}/Z(\beta_i)πi​(x)=e−βi​H(x)/Z(βi​) be the Gibbs distribution and ∣πi⟩=∑xπi(x)∣x⟩|\pi_i\rangle=\sum_x\sqrt{\pi_i(x)}|x\rangle∣πi​⟩=∑x​πi​(x)​∣x⟩ its quantum sample state. Then for every i∈{0,…,ℓ−1}i\in\{0,\dots,\ell-1\}i∈{0,…,ℓ−1},

∣⟨πi∣πi+1⟩∣2≥1B.|\langle\pi_i|\pi_{i+1}\rangle|^2\ge\frac1B.∣⟨πi​∣πi+1​⟩∣2≥B1​.

This is the overlap condition required by the Wocjan–Abeyesinghe quantum sampling theorem (Theorem 9 of the paper, with p=1/Bp=1/Bp=1/B): it says that each Gibbs state in a Chebyshev cooling schedule is close enough to its predecessor for quantum walks to prepare it from the previous one, and it is what the paper's partition-function algorithm (Theorem 11) uses.

Formalization Note Inverse temperatures are in [0,∞][0,\infty][0,∞] with e−∞⋅h=[h=0]e^{-\infty\cdot h}=[h=0]e−∞⋅h=[h=0]. The hypothesis that some configuration has H(x)=0H(x)=0H(x)=0 is added and disclosed: it makes Z(∞)>0Z(\infty)>0Z(∞)>0, without which πℓ\pi_\ellπℓ​ and the last ratio of Definition 1 would be divisions by zero. No hypothesis on BBB is made; Definition 1 forces B≥1B\ge1B≥1. The hypothesis H≤nH\le nH≤n is the paper's model and is kept although the claim does not use it.

Preamble
import Mathlib
import Definitions.Def_QuantumMC_Cooling_Setting

open scoped ENNReal InnerProductSpace
Formal statement
namespace QuantumMC.Cooling

/-- §3.2, p. 17: along a `B`-Chebyshev cooling schedule `0 = β_0 < ⋯ < β_ℓ = ∞` for the
partition function of a Hamiltonian `H : Ω → {0, …, n}`, the quantum sample states of
consecutive Gibbs distributions satisfy `|⟨π_i|π_{i+1}⟩|² ≥ 1/B` for all `i < ℓ`. -/
theorem overlap_ge_inv_B {Ω : Type*} [Fintype Ω] (H : Ω → ℕ) (n : ℕ) (hH : ∀ x, H x ≤ n)
    (hZ : ∃ x, H x = 0) (β : ℕ → ℝ≥0∞) (ℓ : ℕ) (B : ℝ)
    (hsched : IsChebyshevSchedule H β ℓ B) :
    ∀ i < ℓ,
      1 / B ≤ ‖⟪qsample (gibbs H (β i)), qsample (gibbs H (β (i + 1)))⟫_ℂ‖ ^ 2 := by sorry

end QuantumMC.Cooling
Source
Montanaro, Quantum speedup of Monte Carlo methods, arXiv:1504.06987v3, §3.2, p. 17, sentence "So, for all i, |⟨π_i|π_{i+1}⟩|² ≥ 1/B."
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me