Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:math-ph/0506030 · Communications in Mathematical Physics

Lieb-Robinson Bounds and the Exponential Clustering Theorem

Bruno Nachtergaele, Robert Sims

Published Mar 22, 2006• 404 citations
arXivHTMLPDF
DOI
10.1007/s00220-006-1556-1

Related papers

Applications of Lieb-Robinson Bounds

Pieter Naaijkens

Lecture notes in physics•Jan 1, 2017•0 citations

Lieb-Robinson bounds

Anna Vershynina, Élliott H. Lieb

Scholarpedia•Jan 1, 2013•5 citations

Lieb-Robinson Bounds

Pieter Naaijkens

Lecture notes in physics•Jan 1, 2017•4 citations

Asymptotically decreasing Lieb-Robinson velocity for a class of dissipative quantum dynamics

Benoît Descamps

We study the velocity of the propagation of information for a class of local dissipative quantum dynamics. This finite velocity is expressed by the so-called Lieb-Robinson bound. Besides the properties of the already studied dynamics, we consider an additional relation that expresses the propagation of certain subspaces. The previously derived bounds did not reflect the dissipative character of the dynamics and yielded the same result as for the reversible case. In this article, we show that for this class the velocity of propagation of information is time dependent and decays in time towards a smaller velocity. In some cases the velocity becomes zero. At the end of the article, the exponential clustering theorem of general frustration free local Markovian dynamics is revisited.

arXiv:1305.6888•Journal of Mathematical Physics•Sep 1, 2013•15 citations

Applications of the Probability-Changing Cluster Algorithm and Related Problems

Yutaka Okabe, Yusuke Tomita, Chiaki Yamaguchi

Springer proceedings in physics•Jan 1, 2002•0 citations

Lieb-Robinson bound at finite temperatures

Zhiqiang Huang, Xiao-Kan Guo

The Lieb-Robinson bound shows that the speed of propagating information in a nonrelativistic quantum lattice system is bounded by a finite velocity, which entails the clustering of correlations. In this paper, we extend the Lieb-Robinson bound to quantum systems at finite temperature by calculating the dynamical correlation function at nonzero temperature for systems whose interactions are, respectively, short range, exponentially decaying, and long range. We introduce a simple way of counting the clusters in a cluster expansion by using the combinatoric generating functions of graphs. Limitations and possible applications of the obtained bound are also discussed.

arXiv:1711.06977•Physical review. E•Jun 18, 2018•7 citations
We study the velocity of the propagation of information for a class of local dissipative quantum dynamics. This finite velocity is expressed by the so-called Lieb-Robinson bound. Besides the properties of the already studied dynamics, we consider an additional relation that expresses the propagation of certain subspaces. The previously derived bounds did not reflect the dissipative character of the dynamics and yielded the same result as for the reversible case. In this article, we show that for this class the velocity of propagation of information is time dependent and decays in time towards a smaller velocity. In some cases the velocity becomes zero. At the end of the article, the exponential clustering theorem of general frustration free local Markovian dynamics is revisited.
The Lieb-Robinson bound shows that the speed of propagating information in a nonrelativistic quantum lattice system is bounded by a finite velocity, which entails the clustering of correlations. In this paper, we extend the Lieb-Robinson bound to quantum systems at finite temperature by calculating the dynamical correlation function at nonzero temperature for systems whose interactions are, respectively, short range, exponentially decaying, and long range. We introduce a simple way of counting the clusters in a cluster expansion by using the combinatoric generating functions of graphs. Limitations and possible applications of the obtained bound are also discussed.