arXiv:2610.28927
Lieb-Robinson bounds via the Combes-Thomas estimate
Tali Braester, Haochen Luo, George Peykanu, Sergii Solomakha
Abstract
This paper studies quantum spin systems: networks of spins coupled by local interactions. The Lieb-Robinson bound predicts that in these systems, information propagates at an essentially finite speed. We produce a new proof of this result. Our approach relies on a spectral bound on entries of resolvents of band matrices, the Combes-Thomas estimate, rather than on the standard path-counting argument.
AI Summary
The paper asks whether Lieb–Robinson bounds for interacting quantum spin systems can be proved using spectral resolvent estimates rather than path counting. It treats finite connected graphs carrying qubits, with two-site Hamiltonian terms $H_e$ on edges satisfying $\|H_e\|\leq 1$, and maximal graph degree $\mathcal D$. For observables initially supported at sites $x$ and $y$, it establishes $\|[A(t),B]\|\leq 18\mathcal D\,e^{32\mathcal D t-d(x,y)}\|A\|\|B\|$ for $t\geq0$. The constants are independent of system size. An intermediate estimate gives superexponential spatial decay: $\|[A(t),B]\|\leq6\mathcal D[8e\mathcal D t/(d(x,y)-1)]^{d(x,y)-1}\|A\|\|B\|$ when $d(x,y)>32\mathcal D t+1$. The proof first uses an existing differential inequality for edge-supported commutators to dominate propagation by entries of $e^{2t\Delta}$, where $\Delta$ is the adjacency operator of the interaction graph’s line graph, including diagonal entries. The new proof step applies the Combes–Thomas estimate to its resolvent, then transfers off-diagonal decay to the matrix exponential through a contour integral. Optimizing the decay parameter yields the superexponential estimate and subsequently the exponential bound. The resulting bounds are already known in form; the contribution is the alternative proof. Constants are not optimized and are larger than existing ones. The established result is restricted to finite-range, two-site interactions. Extensions to exponentially or algebraically decaying interactions and improved treatment of graphs with growing maximal degree are proposed but not proved.
We used Claude Fable 5.1 in editing stages of this paper: to check proofs and citations against the sources, to flag typographical and consistency errors, to typeset figures and bibliography entries, and to assist in improving the wording.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 18 pages, 4 figures