相关论文: An Algorithm for Gluinos on the Lattice

Bose-Fermi mixtures have been recently realized and invesitigated in ultracold atomic experiments. We formulate quantum Monte Carlo simulation of Bose-Fermi mixtures on the (3+1)-dimensional lattice. As its first application, we analyze the…

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…

We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023)], aimed at identifying the optimal working point of the algorithm. We observe an optimal mixing Hamiltonian strength and analyze the…

We give a detailed description of the so-called Polynomial Hybrid Monte Carlo (PHMC) algorithm. The effects of the correction factor, which is introduced to render the algorithm exact, are discussed, stressing their relevance for the…

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the…

We discuss numerical complexity of the L\"uscher algorithm applied to the Hubbard Model. In particular we present comparison to a certain algorithm based on direct computation of the fermionic determinant.

We present a modification of the Hybrid Monte Carlo algorithm for tackling the critical slowing down of generating Markov chains of lattice gauge configurations towards the continuum limit. We propose a new method to exchange information…

We present a Hamiltonian Monte Carlo algorithm to sample from multivariate Gaussian distributions in which the target space is constrained by linear and quadratic inequalities or products thereof. The Hamiltonian equations of motion can be…

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…

To simulate bosons on a qubit- or qudit-based quantum computer, one has to regularize the theory by truncating infinite-dimensional local Hilbert spaces to finite dimensions. In the search for practical quantum applications, it is important…

We have developed an efficient simulation algorithm for strongly interacting relativistic fermions in two-dimensional field theories based on a formulation as a loop gas. The loop models describing the dynamics of the fermions can be mapped…

A grand canonical Monte Carlo (MC) algorithm is presented for studying the lattice gas model (LGM) of multiple protein sequence alignment, which coherently combines long-range interactions and variable-length insertions. MC simulations are…

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…

We consider generalizations of the classical inverse problem to Bayesien type estimators, where the result is not one optimal parameter but an optimal probability distribution in parameter space. The practical computational tool to compute…

We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects…

Obtaining reliable estimates of the statistical properties of complex macromolecules by computer simulation is a task that requires high computational effort as well as the development of highly efficient simulation algorithms. We present…

The study of ultracold optically trapped atoms has opened new vistas in the physics of correlated quantum systems. Much attention has now turned to mixtures of bosonic and fermionic atoms. A central puzzle is the disagreement between the…

Simulations of supersymmetric models on the lattice with (spontaneously) broken supersymmetry suffer from a fermion sign problem related to the vanishing of the Witten index. We propose a novel approach which solves this problem in low…

We provide physics-inspired derivations of a number of algorithms for computing the permanent of a matrix. In particular we formulate the computation of the permanent as a Grassmann integral that may be viewed as an interacting many-fermion…

We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…