Related papers: Recent progress on cluster and meron algorithms fo…
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many…
We consider the problem of clustering partially labeled data from a minimal number of randomly chosen pairwise comparisons between the items. We introduce an efficient local algorithm based on a power iteration of the non-backtracking…
A new extension of the attractive Hubbard model is constructed to study the critical behavior near a finite temperature superconducting phase transition in two dimensions using the recently developed meron-cluster algorithm. Unlike previous…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
An improved algorithm is proposed for Monte Carlo methods to study fermion systems interacting with adiabatical fields. To obtain a weight for each Monte Carlo sample with a fixed configuration of adiabatical fields, a series expansion…
We give an overview on recently accomplished successful generalizations of `worm' or loop gas simulation methods to O(N) and CP(N-1) sigma models and to simple fermion models. Beside the advantage of (practically) eliminated critical…
Although quantum Monte Carlo is, in principal, an exact method for solving the Schroedinger equation, it is well-known that systems of Fermions still pose a challenge. Thus far all solutions to the "sign problem" remain inefficient (or…
The multilevel blocking algorithm recently proposed as a possible solution to the sign problem in path-integral Monte Carlo simulations has been extended to systems with long-ranged interactions along the Trotter direction. As an…
We offer a new proposal for the Monte Carlo treatment of many-fermion systems in continuous space. It is based upon Diffusion Monte Carlo with significant modifications: correlated pairs of random walkers that carry opposite signs;…
We propose a number of Monte Carlo algorithms for the simulation of ice models and compare their efficiency. One of them, a cluster algorithm for the equivalent three colour model, appears to have a dynamic exponent close to zero, making it…
Quantum Monte Carlo methods are sophisticated numerical techniques for simulating interacting quantum systems. In some cases, however, they suffer from the notorious "sign problem" and become too inefficient to be useful. A recent…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
The building blocks of quantum algorithms and software are quantum gates, with the appropriate combination of quantum gates leading to a desired quantum circuit. Deep expert knowledge is necessary to discover effective combinations of…
Solving the Schr\"{o}dinger equation for interacting many-body quantum systems faces computational challenges due to exponential scaling with system size. This complexity limits the study of important phenomena in materials science and…
Quantum Monte Carlo (QMC) simulations constitute nowadays one of the most powerful methods to study strongly correlated quantum systems, provided that no "sign problem" arises. However, many systems of interest, including highly frustrated…
The Monte Carlo calculation of R\'enyi entanglement entropies $S^{}_n$ of interacting fermions suffers from a well-known signal-to-noise problem, even for a large number of situations in which the infamous sign problem is absent. A few…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
Clustering is an important part of many modern data analysis pipelines, including network analysis and data retrieval. There are many different clustering algorithms developed by various communities, and it is often not clear which…
The problem of finding clusters in complex networks has been extensively studied by mathematicians, computer scientists and, more recently, by physicists. Many of the existing algorithms partition a network into clear clusters, without…
We consider the heavy-dense limit of QCD at finite fermion density in the canonical formulation and approximate it by a 3-state Potts model. In the strong coupling limit, the model is free of the sign problem. Away from the strong coupling,…