Efficient Anderson localization bounds for large multi-particle systems

From MaRDI portal



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.


Summary: We study multi-particle interactive quantum disordered systems on a polynomially growing countable connected graph (\(\mathcal{Z}, \mathcal{E}\)). The main novelty is to give localization bounds uniform in finite volumes (subgraphs) in \(\mathcal{Z}^N\) as well as for the whole of \(\mathcal{Z}^N\). Such bounds are proved here by means of a comprehensive fixed-energy multi-particle multiscale analysis. We consider -- for the first time in the literature -- a discrete \(N\)-particle model with an infinite-range, sub-exponentially decaying interaction, and establish (1) exponential spectral localization, and (2) strong dynamical localization with sub-exponential rate of decay of the eigenfunction correlators with respect to the natural symmetrized distance in the multi-particle configuration space.











This page was built for publication: Efficient Anderson localization bounds for large multi-particle systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528820)