§3.2, p. 17 — along a B-Chebyshev cooling schedule, |⟨π_i|π_{i+1}⟩|² ≥ 1/B for all i
ProvedQuantumMC.Cooling.overlap_ge_inv_BLet be a finite set of configurations and a Hamiltonian with at least one configuration of energy . Let be its partition function and let be a -Chebyshev cooling schedule for (Definition 1). For each let be the Gibbs distribution and its quantum sample state. Then for every ,
This is the overlap condition required by the Wocjan–Abeyesinghe quantum sampling theorem (Theorem 9 of the paper, with ): 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 with . The hypothesis that some configuration has is added and disclosed: it makes , without which and the last ratio of Definition 1 would be divisions by zero. No hypothesis on is made; Definition 1 forces . The hypothesis is the paper's model and is kept although the claim does not use it.
import Mathlib import Definitions.Def_QuantumMC_Cooling_Setting open scoped ENNReal InnerProductSpace
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.