pith. sign in

arxiv: 1404.3978 · v1 · pith:TEKSOBDZnew · submitted 2014-04-15 · 🧮 math-ph · math.MP

Efficient Anderson localization bounds for large multi-particle systems

classification 🧮 math-ph math.MP
keywords localizationboundsmulti-particlesystemsalthoughanalysisandersonanother
0
0 comments X
read the original abstract

We study multi-particle interactive quantum disordered systems on a polynomially-growing countable connected graph (Z,E). The novelty is to give localization bounds uniform in finite or infinite volumes (subgraphs) in Z^N as well as for the whole of Z^N. Such bounds are proved here by means of a comprehensive fixed-energy multi-particle multi-scale analysis. Another feature of the paper is that we consider -- for the first time in the literature -- an infinite-range (although fast-decaying) interaction between particles. For the models under consideration we establish (1) exponential spectral localization, and (2) strong dynamical localization with sub-exponential rate of decay of the eigenfunction correlators.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.