Biomedical subjects

Fabien Alet

Publications and source records attributed to Fabien Alet.

7 recordsLinked to original sources

PubMed2005

Interacting classical dimers on the square lattice.

We study a model of close-packed dimers on the square lattice with a nearest neighbor interaction between parallel dimers. This model corresponds to the classical limit of quantum dimer models [D. S. Rokhsar and S. A. Kivelson, Phys. Rev. Lett. 61, 2376 (1988)]. By means of Monte Carlo and transfer matrix calculations, we show that this system undergoes a Kosterlitz-Thouless transition separating a low temperature ordered phase where dimers are aligned in columns from a high temperature critical phase with continuously varying exponents. This is understood by constructing the corresponding Coulomb gas, whose coupling constant is computed numerically. We also discuss doped models and implications on the finite-temperature phase diagram of quantum dimer models.

Journal Article↗

PubMed2005

Supersolids versus phase separation in two-dimensional lattice bosons.

We study the nature of the ground state of the two-dimensional extended boson Hubbard model on a square lattice by quantum Monte Carlo methods. We demonstrate that strong but finite on-site interaction U along with a comparable nearest-neighbor repulsion V result in a thermodynamically stable supersolid ground state for densities larger than 1/2, in contrast to fillings less than 1/2 or for very large U, where the checkerboard supersolid is unstable towards phase separation. We discuss the relevance of our results to realizations of supersolids using cold bosonic atoms in optical lattices.

Journal Article↗

PubMed2005

Generalized directed loop method for quantum Monte Carlo simulations.

Efficient quantum Monte Carlo update schemes called directed loops have recently been proposed, which improve the efficiency of simulations of quantum lattice models. We propose to generalize the detailed balance equations at the local level during the loop construction by accounting for the matrix elements of the operators associated with open world-line segments. Using linear programming techniques to solve the generalized equations, we look for optimal construction schemes for directed loops. This also allows for an extension of the directed loop scheme to general lattice models, such as high-spin or bosonic models. The resulting algorithms are bounce free in larger regions of parameter space than the original directed loop algorithm. The generalized directed loop method is applied to the magnetization process of spin chains in order to compare its efficiency to that of previous directed loop schemes. In contrast to general expectations, we find that minimizing bounces alone does not always lead to more efficient algorithms in terms of autocorrelations of physical observables, because of the nonuniqueness of the bounce-free solutions. We therefore propose different general strategies to further minimize autocorrelations, which can be used as supplementary requirements in any directed loop scheme. We show by calculating autocorrelation times for different observables that such strategies indeed lead to improved efficiency; however, we find that the optimal strategy depends not only on the model parameters but also on the observable of interest.

Journal Article↗

PubMed2004

Dual geometric worm algorithm for two-dimensional discrete classical lattice models.

We present a dual geometrical worm algorithm for two-dimensional Ising models. The existence of such dual algorithms was first pointed out by Prokof'ev and Svistunov [Phys. Rev. Lett. 87, 160601 (2001)]]. The algorithm is defined on the dual lattice and is formulated in terms of bond variables and can therefore be generalized to other two-dimensional models that can be formulated in terms of bond variables. We also discuss two related algorithms formulated on the direct lattice, applicable in any dimension. These latter algorithms turn out to be less efficient but of considerable intrinsic interest. We show how such algorithms quite generally can be "directed" by minimizing the probability for the worms to erase themselves. Explicit proofs of detailed balance are given for all the algorithms. In terms of computational efficiency the dual geometrical worm algorithm is comparable to well known cluster algorithms such as the Swendsen-Wang and Wolff algorithms, however, it is quite different in structure and allows for a very simple and efficient implementation. The dual algorithm also allows for a very elegant way of calculating the domain wall free energy.

Journal Article↗

PubMed2003

Directed geometrical worm algorithm applied to the quantum rotor model.

We discuss the implementation of a directed geometrical worm algorithm for the study of quantum link-current models. In this algorithm the Monte Carlo updates are made through the biased reptation of a worm through the lattice. A directed algorithm is an algorithm where, during the construction of the worm, the probability for erasing the immediately preceding part of the worm, when adding a new part, is minimal. We introduce a simple numerical procedure for minimizing this probability. The procedure only depends on appropriately defined local probabilities and should be generally applicable. Furthermore, we show how correlation functions C(r,tau) can be straightforwardly obtained from the probability of a worm to reach a site (r,tau) away from its starting point independent of whether or not a directed version of the algorithm is used. Detailed analytical proofs of the validity of the Monte Carlo algorithms are presented for both the directed and undirected geometrical worm algorithms. Results for autocorrelation times and Green's functions are presented for the quantum rotor model.

Journal Article↗

PubMed2003

Flat histogram methods for quantum systems: algorithms to overcome tunneling problems and calculate the free energy.

We present a generalization of the classical Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)]] to quantum systems. The algorithm proceeds by stochastically evaluating the coefficients of a high temperature series expansion or a finite temperature perturbation expansion to arbitrary order. Similar to their classical counterpart, the algorithms are efficient at thermal and quantum phase transitions, greatly reducing the tunneling problem at first order phase transitions, and allow the direct calculation of the free energy and entropy.

Journal Article↗

PubMed2003

Cluster Monte Carlo algorithm for the quantum rotor model.

We propose a highly efficient "worm"-like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the algorithm even in the presence of disorder. For the pure quantum rotor model with mu=0, the algorithm yields high- precision estimates for the critical point K(c)=0.333 05(5) and the correlation length exponent nu=0.670(3). For the disordered case, mu=1 / 2+/-1 / 2, we find nu=1.15(10).

Journal Article↗