Related papers: Worm Algorithm for CP(N-1) Model
Nuclear magnetic resonance spectroscopy is one of the few remaining areas of physical chemistry for which polynomially scaling simulation methods have not so far been available. Here, we report such a method and illustrate its performance…
Various cooling methods, including a recently introduced one which smoothes out only quantum fluctuations larger than a given threshold, are applied to the study of topology in 2d CP(N-1) models. A critical comparison of their properties is…
Quantum heuristics have shown promise in solving various optimization problems, including lattice protein folding. Equally relevant is the inverse problem, protein design, where one seeks sequences that fold to a given target structure. The…
We present results for lattice QCD in the limit of infinite gauge coupling, obtained from a worm-type Monte Carlo algorithm on a discrete spatial lattice but with continuous Euclidean time. This is obtained by sending both the anisotropy…
We present Neural Correspondence Prior (NCP), a new paradigm for computing correspondences between 3D shapes. Our approach is fully unsupervised and can lead to high-quality correspondences even in challenging cases such as sparse point…
Quasi-Monte Carlo (QMC) is an essential tool for integral approximation, Bayesian inference, and sampling for simulation in science, etc. In the QMC area, the rank-1 lattice is important due to its simple operation, and nice properties for…
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses…
We develop an algorithm suitable for parallel molecular dynamics simulations in $d$ spatial dimensions and describe its implementation in C++. All routines work in arbitrary $d$; the maximum simulated $d$ is limited only by available…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum…
Based on the tensor network state representation, we develop a nonlinear dynamic theory coined as network contractor dynamics (NCD) to explore the thermodynamic properties of two-dimensional quantum lattice models. By invoking the rank-$1$…
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…
This paper investigates the construction of space-filling designs for computer experiments. The space-filling property is characterized by the covering and separation radii of a design, which are integrated through the unified criterion of…
In this work, we exhibit a hierarchy of polynomial time algorithms solving approximate variants of the Closest Vector Problem (CVP). Our first contribution is a heuristic algorithm achieving the same distance tradeoff as HSVP algorithms,…
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. It is based on a non-hermitian polynomial approximation of the inverse of the quark matrix and a global Metropolis accept/reject correction…
Lattice spin models are useful for studying critical phenomena and allow the extraction of equilibrium and dynamical properties. Simulations of such systems are usually based on Monte Carlo (MC) techniques, and the main difficulty is often…
The Schwinger model, which describes lattice quantum electrodynamics in $1+1$ space-time dimensions, provides a valuable framework to investigate fundamental aspects of quantum field theory, and a stepping stone towards non-Abelian gauge…
We report an ensemble nuclear magnetic resonance (NMR) implementation of a quantum lattice gas algorithm for the diffusion equation. The algorithm employs an array of quantum information processors sharing classical information, a novel…
The topological susceptibility of $2d$ $\mathrm{CP}^{N-1}$ models is expected, based on perturbative computations, to develop a divergence in the limit $N \to 2$, where these models reduce to the well-known non-linear $\mathrm{O}(3)$…
We use the complex $\phi^4$ field at finite density as a model system for developing further techniques based on worldline formulations of lattice field theories. More specifically we: 1) Discuss new variants of the worm algorithm for…