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:1808.04898

Pair functions computed recursively in ordered and disordered lattices

Tirthaprasad Chattaraj

Published Aug 4, 2018• 2 citations
arXivHTMLPDF

Abstract

In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without performing any integrations. Although, in higher dimensions the system sizes that can be addressed with this method become limited, for disordered systems this size limit can be increased by employing approximations.

DOI
10.48550/arxiv.1808.04898

Related papers

Numerical Studies on Correlations in Dynamics and Localization of Two Interacting Particles in Lattices

Tirthaprasad Chattaraj

Correlation of interacting particles is studied in their dynamics and localization in ideal and disordered lattice systems with the help of numerical tools. Both 1D and 2D systems are considered. In 1D lattices with long-range hopping, differences between dynamics of attractively and repulsively interacting particles are noted. For calculations of 2D systems, a recursion based numerical algorithm for two-particle Greens functions is implemented which provides accurate results. Using this algorithm, spectral properties of 2D Hubbard and Hofstadter models is computed, along with localization parameters of 2D disordered systems.

arXiv:1809.09982•Sep 25, 2018•1 citation

Spectral density of interacting pairs in low-dimensional finite lattices

Tirthaprasad Chattaraj

The spectral density of bound pairs in ideal 1D, 2D and Bethe lattices is computed for weak and strong interactions. The computations are performed with Green's functions by an efficient recursion method in real space. For the range of interaction strengths within which bound states are predominantly single pairs, the spectral profiles guide to the energy bandwidths where the bound pairs can be maximized.

arXiv:2103.15496•Condensed Matter Physics•Mar 1, 2021•0 citations

Numerical studies on correlations in dynamics and localization of two interacting particles in lattices

Tirthaprasad Chattaraj

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.

•Jan 1, 2018•0 citations

Disorder and Interactions on a 1D Chain

Jonathan M. Carter, A. MacKinnon

It has become increasingly clear that a full understanding of the physics of electrons in disordered systems requires an approach in which both disorder and interactions are taken into account. Work on small numbers of electrons has suggested that interactions can substantially increase the localisation length in 1 dimensional systems and possibly lead to delocalisation in 2D. It has not been clear, however, to what extent these results are applicable to systems with a finite density of electrons. Among numerical approaches the transfer matrix method combined with finite size scaling has been particularly successful for non--interacting systems, whereas the density matrix renormalisation group successfully describes interacting systems. We have developed a new approach which combines elements of both these methods and have successfully applied it to spinless electrons with nearest neighbour interactions.

arXiv:cond-mat/0209213•Journal of the Physical Society of Japan•Jan 3, 2003•2 citations

Combinatorial approach to exactly solve the 1D Ising model

Swarnadeep Seth

Abstract The Ising model is a well known statistical model which can be solved exactly by various methods. The most familiar one is the transfer matrix method. Sometimes it can be difficult to approach the open boundary case rather than periodic boundary ones in higher dimensions. But physically it is more intuitive to study the open boundary case, as it gives a closer view of the real system. We have introduced a new method called the pairing method to determine the exact partition function for the simplest case, a 1D Ising lattice. This method simplifies the problem's complexities and reduces it to a pure combinatorial problem. The study also reveals that it is possible to apply this pairing method in the case of a 2D square lattice. The obtained results agree perfectly with the values in the literature and this new approach provides an algorithmic insight to deal with such problems.

European Journal of Physics•Dec 13, 2016•11 citations

Hubbard model in one dimension with a general bond-charge interaction: Analytical ground-state solution for the pairing of two particles

Emmanuel Vallejo, Oracio Navarro

In this work we solve a general Hubbard Hamiltonian for two interacting particles in a periodic and nonperiodic infinite one-dimensional lattice, using a real-space mapping method, the renormalized perturbation expansion (RPE), and the Green-function technique. This Hamiltonian considers a general bond-charge interaction, the on-site interaction, and the general intersite interaction. The real-space method is based on mapping the correlated many-body problem onto an equivalent site- and bond-impurity tight-binding problem in a higher-dimensional space. Analyzing the periodic and the quasiperiodic lattices in this new space, we obtained the analytical solution for the binding condition at the ground state. Our general results for the periodic chain reproduce completely the limit cases of the numerical solution obtained previously and those obtained in reciprocal space

Physical review. B, Condensed matter•May 28, 2003•5 citations
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without performing any integrations. Although, in higher dimensions the system sizes that can be addressed with this method become limited, for disordered systems this size limit can be increased by employing approximations.
Correlation of interacting particles is studied in their dynamics and localization in ideal and disordered lattice systems with the help of numerical tools. Both 1D and 2D systems are considered. In 1D lattices with long-range hopping, differences between dynamics of attractively and repulsively interacting particles are noted. For calculations of 2D systems, a recursion based numerical algorithm for two-particle Greens functions is implemented which provides accurate results. Using this algorithm, spectral properties of 2D Hubbard and Hofstadter models is computed, along with localization parameters of 2D disordered systems.
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.
It has become increasingly clear that a full understanding of the physics of electrons in disordered systems requires an approach in which both disorder and interactions are taken into account. Work on small numbers of electrons has suggested that interactions can substantially increase the localisation length in 1 dimensional systems and possibly lead to delocalisation in 2D. It has not been clear, however, to what extent these results are applicable to systems with a finite density of electrons. Among numerical approaches the transfer matrix method combined with finite size scaling has been particularly successful for non--interacting systems, whereas the density matrix renormalisation group successfully describes interacting systems. We have developed a new approach which combines elements of both these methods and have successfully applied it to spinless electrons with nearest neighbour interactions.
Abstract The Ising model is a well known statistical model which can be solved exactly by various methods. The most familiar one is the transfer matrix method. Sometimes it can be difficult to approach the open boundary case rather than periodic boundary ones in higher dimensions. But physically it is more intuitive to study the open boundary case, as it gives a closer view of the real system. We have introduced a new method called the pairing method to determine the exact partition function for the simplest case, a 1D Ising lattice. This method simplifies the problem's complexities and reduces it to a pure combinatorial problem. The study also reveals that it is possible to apply this pairing method in the case of a 2D square lattice. The obtained results agree perfectly with the values in the literature and this new approach provides an algorithmic insight to deal with such problems.
In this work we solve a general Hubbard Hamiltonian for two interacting particles in a periodic and nonperiodic infinite one-dimensional lattice, using a real-space mapping method, the renormalized perturbation expansion (RPE), and the Green-function technique. This Hamiltonian considers a general bond-charge interaction, the on-site interaction, and the general intersite interaction. The real-space method is based on mapping the correlated many-body problem onto an equivalent site- and bond-impurity tight-binding problem in a higher-dimensional space. Analyzing the periodic and the quasiperiodic lattices in this new space, we obtained the analytical solution for the binding condition at the ground state. Our general results for the periodic chain reproduce completely the limit cases of the numerical solution obtained previously and those obtained in reciprocal space