Related papers: Recent progress on cluster and meron algorithms fo…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient…
Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
We give a brief discussion of the recently developed Constrained-Path Monte Carlo Method. This method is a quantum Monte Carlo technique that eliminates the fermion sign problem plaguing simulations of systems of interacting electrons. The…
Multi-bosonic fermion simulation algorithms are reviewed, with particular emphasis on a recent application in SU(2) Yang-Mills theory with light gluinos.
Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a…
We present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. The algorithm avoids the computation of almost all non-leading terms. Its use is illustrated by…
Simulations of frustrated quantum antiferromagnets suffer from a severe sign problem. We solve the ergodicity problem of the loop-cluster algorithm in a natural way and apply a powerful strategy to address the sign problem. For the spin 1/2…
Quantum Monte Carlo (QMC) is an advanced simulation methodology for studies of manybody quantum systems. In this review, we focus on the electronic structure QMC, i.e., methods relevant for systems described by the electron-ion…
Graph clustering is widely used in many data analysis applications. In this paper we propose several parallel graph clustering algorithms based on Monte Carlo simulations and expectation maximization in the context of stochastic block…
A two-dimensional lattice hard-core boson system with a small fraction of bosonic or fermionic impurity particles is studied. The impurities have the same hopping and interactions as the dominant bosons and their effects are solely due to…
The Meron Cluster algorithm solves the sign problem in a class of interacting fermion lattice models with a chiral phase transition. Within this framework, we study the geometrical features of the clusters built by the algorithm, that…
Cluster variables have recently revolutionized numerical work in certain models involving fermionic variables. This novel representation of fermionic partition functions is continuing to find new applications. After describing results from…
Quantum Monte Carlo is one of the most powerful numerical tools for studying nonpeturbative properties of quantum many-body systems. However, its application to real-time problems is limited since the complex and highly-oscillating…
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
Graph clustering is a fundamental problem in unsupervised learning, with numerous applications in computer science and in analysing real-world data. In many real-world applications, we find that the clusters have a significant high-level…
Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation…
We present a guiding principle for designing fermionic Hamiltonians and quantum Monte Carlo (QMC) methods that are free from the infamous sign problem by exploiting the Lie groups and Lie algebras that appear naturally in the Monte Carlo…