(46), p. 27 — Σ_{Q:P∼Q} |Q|‖h_Q‖δ_{dist(Q,S)≤d} ≤ ζ₀ Σ_{p∈P} δ_{dist(p,S)≤d+1}
ProvedLatticeHamSim.StrictLR.eq_46lieb-robinson-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-lattice-systemstrictly-local
Let be operators indexed by the subsets of a finite metric space of sites (local dimension ), strictly local in the sense that whenever , and let be a real number with for every site . Then for arbitrary sets of sites and every real ,
Together with (45), this inequality bounds each successive factor of a linked sum by while keeping track of the distance still to be covered.
Formalization Note As in (45), is any upper bound of the site sums , equivalent to the paper's maximum. is setDist Q S, the minimum distance for nonempty sets and if ; is Metric.infDist, also for . Under these conventions the inequality still holds when . is the operator norm.
Preamble
import Mathlib import Definitions.Def_LatticeHamSim_StrictLR_Setting open scoped Matrix.Norms.L2Operator
Formal statement
namespace LatticeHamSim.StrictLR
theorem eq_46 {Λ : Type*} [Fintype Λ] [DecidableEq Λ] [MetricSpace Λ] {q : ℕ}
(h : Finset Λ → Matrix (Λ → Fin q) (Λ → Fin q) ℂ)
(hloc : ∀ X : Finset Λ, 1 < Metric.diam (X : Set Λ) → h X = 0)
(ζ₀ : ℝ) (hζ₀ : ∀ x : Λ, ∑ Q ∈ Finset.univ.filter (fun Q => x ∈ Q), (Q.card : ℝ) * ‖h Q‖ ≤ ζ₀)
(P S : Finset Λ) (d : ℝ) :
∑ Q ∈ Finset.univ.filter (fun Q => LatticeHamSim.CommLR.meets P Q),
(Q.card : ℝ) * ‖h Q‖ * (if LatticeHamSim.CommLR.setDist Q S ≤ d then 1 else 0) ≤
ζ₀ * ∑ p ∈ P, (if Metric.infDist p (S : Set Λ) ≤ d + 1 then (1 : ℝ) else 0) := by sorry
end LatticeHamSim.StrictLR
Source
Haah, Hastings, Kothari and Low, Quantum algorithm for simulating real time evolution of lattice Hamiltonians, arXiv:1801.03922v4, p. 27, Appendix C.4, display (46)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.