Related papers: Parallelized Traveling Cluster Approximation to St…
We present a general method by which linear quantum Hamiltonian dynamics with exponentially many degrees of freedom is replaced by approximate classical nonlinear dynamics with the number of degrees of freedom (phase space dimensionality)…
In this paper, we extend our analysis of lattice systems using the wavelet transform to systems for which exact enumeration is impractical. For such systems, we illustrate a wavelet-accelerated Monte Carlo (WAMC) algorithm, which…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
In this work we propose an efficient parallelization of multiple-precision Taylor series method with variable stepsize and fixed order. For given level of accuracy the optimal variable stepsize determines higher order of the method than in…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
Recently a new class of Monte Carlo methods, called Time Relaxed Monte Carlo (TRMC), designed for the simulation of the Boltzmann equation close to fluid regimes have been introduced. A generalized Wild sum expansion of the solution is at…
Embarrassingly (communication-free) parallel Markov chain Monte Carlo (MCMC) methods are commonly used in learning graphical models. However, MCMC cannot be directly applied in learning topic models because of the quasi-ergodicity problem…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
We develop a multi-dimensional, parallelized domain decomposition strategy (DDC) for mass-transfer particle tracking (MTPT) methods. These methods are a type of Lagrangian algorithm for simulating reactive transport and are able to be…
To evaluate the effectiveness of machine learning in systems with competing interactions, we developed a self-learning quantum Monte Carlo (SLQMC) method to simulate the phase transition in the classical Holstein-spin-fermion model. In…
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…
Recent advances in random-walk particle-tracking have enabled direct simulation of mixing and reactions on particles by allowing the particles to interact with each other using a multi-point mass transfer scheme. The mass transfer scheme…
Classical canonical correlation analysis (CCA) requires matrices to be low dimensional, i.e. the number of features cannot exceed the sample size. Recent developments in CCA have mainly focused on the high-dimensional setting, where the…
Particle transport and localization phenomena in condensed-matter systems can be modeled using a tight-binding lattice Hamiltonian. The ideal experimental emulation of such a model utilizes simultaneous, high-fidelity control and readout of…
We argue that lattice simulations of full QCD with varying quark mass are best conducted at fixed lattice spacing rather than at fixed $\beta$. We present techniques which enable this to be carried out effectively, namely the tuning in bare…
This article introduces a new class of fast algorithms to approximate variational problems involving unbalanced optimal transport. While classical optimal transport considers only normalized probability distributions, it is important for…
We develop a GPU-accelerated hybrid quantum Monte Carlo (QMC) algorithm to solve the fundamental yet difficult problem of $U(1)$ gauge field coupled to fermions, which gives rise to a $U(1)$ Dirac spin liquid state under the description of…
The dynamical cluster approximation (DCA) and its DCA$^+$ extension use coarse-graining of the momentum space to reduce the complexity of quantum many-body problems, thereby mapping the bulk lattice to a cluster embedded in a dynamical…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
Lattice gauge theories coupled to fermionic matter account for many interesting phenomena in both high energy physics and condensed matter physics. Certain regimes, e.g. at finite fermion density, are difficult to simulate with traditional…