Biomedical subjects

Erik S Sørensen

Publications and source records attributed to Erik S Sørensen.

6 recordsLinked to original sources

PubMed2006

Boundary effects in the critical scaling of entanglement entropy in 1D systems.

We present exact diagonalization and density matrix renormalization group results for the entanglement entropy of critical spin-1/2 XXZ chains. We find that open boundary conditions induce an alternating term in both the energy density and the entanglement entropy which are approximately proportional, decaying away from the boundary with a power law. The power varies with anisotropy along the critical line and is corrected by a logarithmic factor, which we calculate analytically, at the isotropic point. A heuristic resonating valence bond explanation is suggested.

Journal Article↗

PubMed2005

Imaginary-chemical-potential quantum Monte Carlo method for Hubbard molecules.

We generalize the imaginary-chemical-potential quantum Monte Carlo (QMC) method proposed by Dagotto [Phys. Rev. B 41, R811 (1990)] to systems without particle-hole symmetry. The generalized method is tested by comparing the results of the QMC simulations and exact diagonalization on small Hubbard molecules, such as tetrahedron and truncated tetrahedron. Results of the application of the method to the C60 Hubbard molecule are discussed.

Journal Article↗

PubMed2005

Kondo screening cloud around a quantum dot: large-scale numerical results.

Measurements of the persistent current in a ring containing a quantum dot would afford a unique opportunity to finally detect the elusive Kondo screening cloud. We present the first large-scale numerical results on this controversial subject using exact diagonalization and density matrix renormalization group (RG). These extremely challenging numerical calculations confirm RG arguments for weak to strong coupling crossover with varying ring length and give results on the universal scaling functions. We also study, analytically and numerically, the important and surprising effects of particle-hole symmetry breaking.

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

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↗