- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Numerical studies on correlations in dynamics and localization...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Numerical studies on correlations in dynamics and localization of two interacting particles in lattices Chattaraj, Tirthaprasad
Abstract
Two interacting particles in lattices, in the absence of dissipation, can not distin- guish between attractive or repulsive interaction when the range of their tunnelling is limited to nearest neighbor sites. However, we find that, in the case of long-range tunnelling, the particles exhibit different dynamics for different types of interactions of the same strength. The nature of dynamical correlations between particles also becomes significantly different. For weak interactions, particles develop a character in correlation which is in between that of antiwalking and cowalking when the tunnelling is long-range. For strong interactions, particles cowalk independently of their statistics. A few recent experiments have demonstrated such effects of interactions on quantum walk of photons, atoms and spin excitations on various lattice platforms. In disordered lattices the effect of coherent backscattering makes particles localize to their initial position. We find that a weak repulsive interaction reduces localization and a strong interaction enhances localization. We also calculate the correlations between the particles in the disordered 1D and 2D systems. The effect of long-range tunnelling on localization of particles in disordered 1D systems has been explored. For large ordered or disordered lattices, computation of localization parameters becomes difficult. In these cases, an efficient recursive algorithm is used to calculate Green’s functions exactly. We extend such algorithm to disordered systems in both one and two dimensions. We also illustrate that this recursive algorithm maps directly to some graph structures like binary trees. We perform calculations for quantum walk of interacting particles on such graphs. The method is also used to calculate the properties of interacting particles on lattices with gauge fields. For disordered 2D lattices, we introduce and test approximations which produce accurate results and make the calculations more efficient. We examine the localization parameters for a broad range of interaction and disorder strengths and try to find differences among parameters within the range.
Item Metadata
Title |
Numerical studies on correlations in dynamics and localization of two interacting particles in lattices
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2018
|
Description |
Two interacting particles in lattices, in the absence of dissipation, can not distin- guish between attractive or repulsive interaction when the range of their tunnelling is limited to nearest neighbor sites. However, we find that, in the case of long-range tunnelling, the particles exhibit different dynamics for different types of interactions of the same strength. The nature of dynamical correlations between particles also becomes significantly different. For weak interactions, particles develop a character in correlation which is in between that of antiwalking and cowalking when the tunnelling is long-range. For strong interactions, particles cowalk independently of their statistics. A few recent experiments have demonstrated such effects of interactions on quantum walk of photons, atoms and spin excitations on various lattice platforms.
In disordered lattices the effect of coherent backscattering makes particles localize to their initial position. We find that a weak repulsive interaction reduces localization and a strong interaction enhances localization. We also calculate the correlations between the particles in the disordered 1D and 2D systems. The effect of long-range tunnelling on localization of particles in disordered 1D systems has been explored.
For large ordered or disordered lattices, computation of localization parameters becomes difficult. In these cases, an efficient recursive algorithm is used to calculate Green’s functions exactly. We extend such algorithm to disordered systems in both one and two dimensions. We also illustrate that this recursive algorithm maps directly to some graph structures like binary trees. We perform calculations for quantum walk of interacting particles on such graphs. The method is also used to calculate the properties of interacting particles on lattices with gauge fields. For disordered 2D lattices, we introduce and test approximations which produce accurate results and make the calculations more efficient. We examine the localization parameters for a broad range of interaction and disorder strengths and try to find differences among parameters within the range.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2018-10-02
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0372343
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2018-11
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International